./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/Problem16_label44.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 04df7a0e588187c87d0a6786097052b38b84b414452cc5f4314f9898df1c2d34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:56:10,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:56:10,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:56:10,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:56:10,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:56:10,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:56:10,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:56:10,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:56:10,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:56:10,328 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:56:10,328 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:56:10,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:56:10,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:56:10,329 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:56:10,329 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:56:10,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:56:10,329 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:56:10,329 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:56:10,330 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:56:10,331 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:56:10,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:56:10,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:56:10,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:56:10,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:56:10,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:56:10,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:56:10,331 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:56:10,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:56:10,332 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:56:10,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:56:10,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:56:10,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:56:10,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:56:10,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:56:10,332 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 -> 04df7a0e588187c87d0a6786097052b38b84b414452cc5f4314f9898df1c2d34 [2025-03-03 10:56:10,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:56:10,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:56:10,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:56:10,583 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:56:10,584 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:56:10,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label44.c [2025-03-03 10:56:11,757 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d54b98df/0413d3b95d6346408f93f0fff6a12280/FLAG02e586f24 [2025-03-03 10:56:12,055 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:56:12,055 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label44.c [2025-03-03 10:56:12,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d54b98df/0413d3b95d6346408f93f0fff6a12280/FLAG02e586f24 [2025-03-03 10:56:12,082 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d54b98df/0413d3b95d6346408f93f0fff6a12280 [2025-03-03 10:56:12,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:56:12,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:56:12,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:56:12,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:56:12,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:56:12,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35f16c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12, skipping insertion in model container [2025-03-03 10:56:12,092 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:56:12,252 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/Problem16_label44.c[3342,3355] [2025-03-03 10:56:12,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:56:12,471 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:56:12,485 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/Problem16_label44.c[3342,3355] [2025-03-03 10:56:12,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:56:12,600 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:56:12,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12 WrapperNode [2025-03-03 10:56:12,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:56:12,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:56:12,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:56:12,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:56:12,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,714 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-03 10:56:12,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:56:12,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:56:12,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:56:12,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:56:12,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,741 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,822 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-03 10:56:12,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,898 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:56:12,899 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:56:12,899 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:56:12,899 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:56:12,900 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (1/1) ... [2025-03-03 10:56:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:56:12,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:12,928 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-03 10:56:12,934 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-03 10:56:12,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:56:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:56:12,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:56:12,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:56:13,010 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:56:13,012 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:56:14,625 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-03 10:56:14,702 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-03 10:56:14,703 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:56:14,719 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:56:14,723 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:56:14,723 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:14 BoogieIcfgContainer [2025-03-03 10:56:14,723 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:56:14,725 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:56:14,725 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:56:14,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:56:14,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:56:12" (1/3) ... [2025-03-03 10:56:14,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b94295b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:14, skipping insertion in model container [2025-03-03 10:56:14,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:56:12" (2/3) ... [2025-03-03 10:56:14,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b94295b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:56:14, skipping insertion in model container [2025-03-03 10:56:14,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:56:14" (3/3) ... [2025-03-03 10:56:14,732 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label44.c [2025-03-03 10:56:14,744 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:56:14,745 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label44.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:56:14,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:56:14,816 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;@1ff37911, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:56:14,816 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:56:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 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-03 10:56:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 10:56:14,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:14,828 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] [2025-03-03 10:56:14,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:14,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:14,833 INFO L85 PathProgramCache]: Analyzing trace with hash 619805562, now seen corresponding path program 1 times [2025-03-03 10:56:14,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:14,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948855517] [2025-03-03 10:56:14,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:14,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:14,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 10:56:14,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 10:56:14,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:14,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:15,076 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-03 10:56:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:15,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948855517] [2025-03-03 10:56:15,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948855517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:15,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:15,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:56:15,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229532783] [2025-03-03 10:56:15,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:15,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:15,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:15,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:15,104 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-03 10:56:16,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:16,473 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-03 10:56:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:16,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-03 10:56:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:16,484 INFO L225 Difference]: With dead ends: 1122 [2025-03-03 10:56:16,484 INFO L226 Difference]: Without dead ends: 662 [2025-03-03 10:56:16,488 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-03 10:56:16,489 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 357 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:16,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 254 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 864 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:56:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-03 10:56:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-03 10:56:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.518910741301059) internal successors, (1004), 661 states have internal predecessors, (1004), 0 states have call successors, (0), 0 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-03 10:56:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1004 transitions. [2025-03-03 10:56:16,545 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1004 transitions. Word has length 30 [2025-03-03 10:56:16,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:16,547 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1004 transitions. [2025-03-03 10:56:16,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 0 states have call successors, (0), 0 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-03 10:56:16,547 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1004 transitions. [2025-03-03 10:56:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 10:56:16,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:16,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:56:16,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:56:16,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:16,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:16,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1228283418, now seen corresponding path program 1 times [2025-03-03 10:56:16,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:16,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172409128] [2025-03-03 10:56:16,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:16,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:16,567 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 10:56:16,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 10:56:16,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:16,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:56:16,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:16,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172409128] [2025-03-03 10:56:16,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172409128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:16,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:16,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:16,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496019078] [2025-03-03 10:56:16,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:16,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:56:16,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:16,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:56:16,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:56:16,888 INFO L87 Difference]: Start difference. First operand 662 states and 1004 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-03 10:56:18,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:18,474 INFO L93 Difference]: Finished difference Result 2309 states and 3414 transitions. [2025-03-03 10:56:18,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:56:18,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-03 10:56:18,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:18,481 INFO L225 Difference]: With dead ends: 2309 [2025-03-03 10:56:18,481 INFO L226 Difference]: Without dead ends: 1649 [2025-03-03 10:56:18,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:56:18,483 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1006 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1496 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:18,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 44 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1496 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:56:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2025-03-03 10:56:18,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649. [2025-03-03 10:56:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1648 states have (on average 1.4010922330097086) internal successors, (2309), 1648 states have internal predecessors, (2309), 0 states have call successors, (0), 0 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-03 10:56:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2309 transitions. [2025-03-03 10:56:18,553 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2309 transitions. Word has length 98 [2025-03-03 10:56:18,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:18,553 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2309 transitions. [2025-03-03 10:56:18,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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-03 10:56:18,554 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2309 transitions. [2025-03-03 10:56:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 10:56:18,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:18,559 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:18,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:56:18,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:18,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:18,562 INFO L85 PathProgramCache]: Analyzing trace with hash -158275761, now seen corresponding path program 1 times [2025-03-03 10:56:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:18,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355869008] [2025-03-03 10:56:18,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:18,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:18,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 10:56:18,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 10:56:18,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:18,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 10:56:18,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:18,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355869008] [2025-03-03 10:56:18,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355869008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:18,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:18,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:56:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106710369] [2025-03-03 10:56:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:18,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:18,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:18,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:18,835 INFO L87 Difference]: Start difference. First operand 1649 states and 2309 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-03 10:56:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:19,935 INFO L93 Difference]: Finished difference Result 3625 states and 5239 transitions. [2025-03-03 10:56:19,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:19,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 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 258 [2025-03-03 10:56:19,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:19,947 INFO L225 Difference]: With dead ends: 3625 [2025-03-03 10:56:19,948 INFO L226 Difference]: Without dead ends: 2307 [2025-03-03 10:56:19,953 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-03 10:56:19,956 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 379 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 379 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:19,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 77 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [379 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:56:19,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2307 states. [2025-03-03 10:56:19,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307. [2025-03-03 10:56:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2307 states, 2306 states have (on average 1.3490893321769297) internal successors, (3111), 2306 states have internal predecessors, (3111), 0 states have call successors, (0), 0 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-03 10:56:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 3111 transitions. [2025-03-03 10:56:20,000 INFO L78 Accepts]: Start accepts. Automaton has 2307 states and 3111 transitions. Word has length 258 [2025-03-03 10:56:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:20,000 INFO L471 AbstractCegarLoop]: Abstraction has 2307 states and 3111 transitions. [2025-03-03 10:56:20,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 0 states have call successors, (0), 0 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-03 10:56:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2307 states and 3111 transitions. [2025-03-03 10:56:20,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-03 10:56:20,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:20,006 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:20,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:56:20,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:20,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1631995273, now seen corresponding path program 1 times [2025-03-03 10:56:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847822483] [2025-03-03 10:56:20,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:20,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-03 10:56:20,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-03 10:56:20,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:20,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-03 10:56:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847822483] [2025-03-03 10:56:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847822483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:20,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:20,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:56:20,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141567147] [2025-03-03 10:56:20,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:20,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:20,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:20,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:20,320 INFO L87 Difference]: Start difference. First operand 2307 states and 3111 transitions. Second operand has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-03 10:56:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:21,301 INFO L93 Difference]: Finished difference Result 5599 states and 7694 transitions. [2025-03-03 10:56:21,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:21,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 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 293 [2025-03-03 10:56:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:21,312 INFO L225 Difference]: With dead ends: 5599 [2025-03-03 10:56:21,312 INFO L226 Difference]: Without dead ends: 3623 [2025-03-03 10:56:21,315 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-03 10:56:21,315 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 359 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:21,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:56:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-03-03 10:56:21,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3294. [2025-03-03 10:56:21,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.2356513817187975) internal successors, (4069), 3293 states have internal predecessors, (4069), 0 states have call successors, (0), 0 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-03 10:56:21,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 4069 transitions. [2025-03-03 10:56:21,377 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 4069 transitions. Word has length 293 [2025-03-03 10:56:21,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:21,378 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 4069 transitions. [2025-03-03 10:56:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.0) internal successors, (189), 2 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-03 10:56:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 4069 transitions. [2025-03-03 10:56:21,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-03 10:56:21,385 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:21,385 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-03 10:56:21,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:56:21,385 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:21,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:21,386 INFO L85 PathProgramCache]: Analyzing trace with hash -772323432, now seen corresponding path program 1 times [2025-03-03 10:56:21,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:21,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523493832] [2025-03-03 10:56:21,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:21,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:21,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-03 10:56:21,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-03 10:56:21,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:21,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2025-03-03 10:56:21,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:21,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523493832] [2025-03-03 10:56:21,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523493832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:21,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:21,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:21,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137764712] [2025-03-03 10:56:21,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:21,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:21,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:21,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:21,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:21,706 INFO L87 Difference]: Start difference. First operand 3294 states and 4069 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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-03 10:56:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:22,656 INFO L93 Difference]: Finished difference Result 7573 states and 9417 transitions. [2025-03-03 10:56:22,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:22,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 546 [2025-03-03 10:56:22,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:22,666 INFO L225 Difference]: With dead ends: 7573 [2025-03-03 10:56:22,666 INFO L226 Difference]: Without dead ends: 3952 [2025-03-03 10:56:22,671 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-03 10:56:22,672 INFO L435 NwaCegarLoop]: 534 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 297 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:22,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 540 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [297 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:56:22,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-03 10:56:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-03-03 10:56:22,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.072892938496583) internal successors, (4239), 3951 states have internal predecessors, (4239), 0 states have call successors, (0), 0 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-03 10:56:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4239 transitions. [2025-03-03 10:56:22,726 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4239 transitions. Word has length 546 [2025-03-03 10:56:22,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:22,726 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4239 transitions. [2025-03-03 10:56:22,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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-03 10:56:22,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4239 transitions. [2025-03-03 10:56:22,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2025-03-03 10:56:22,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:22,739 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:22,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:56:22,740 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:22,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:22,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1665563782, now seen corresponding path program 1 times [2025-03-03 10:56:22,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:22,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89562358] [2025-03-03 10:56:22,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:22,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:22,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 818 statements into 1 equivalence classes. [2025-03-03 10:56:22,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 818 of 818 statements. [2025-03-03 10:56:22,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:22,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1353 backedges. 1067 proven. 0 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2025-03-03 10:56:23,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:23,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89562358] [2025-03-03 10:56:23,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89562358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:23,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:23,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:23,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990703255] [2025-03-03 10:56:23,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:23,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:23,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:23,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:23,436 INFO L87 Difference]: Start difference. First operand 3952 states and 4239 transitions. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-03 10:56:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:24,127 INFO L93 Difference]: Finished difference Result 8889 states and 9584 transitions. [2025-03-03 10:56:24,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:24,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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 818 [2025-03-03 10:56:24,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:24,138 INFO L225 Difference]: With dead ends: 8889 [2025-03-03 10:56:24,138 INFO L226 Difference]: Without dead ends: 5268 [2025-03-03 10:56:24,141 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-03 10:56:24,141 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:24,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 428 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:56:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5268 states. [2025-03-03 10:56:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5268 to 5268. [2025-03-03 10:56:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5268 states, 5267 states have (on average 1.0599962027719765) internal successors, (5583), 5267 states have internal predecessors, (5583), 0 states have call successors, (0), 0 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-03 10:56:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5268 states to 5268 states and 5583 transitions. [2025-03-03 10:56:24,202 INFO L78 Accepts]: Start accepts. Automaton has 5268 states and 5583 transitions. Word has length 818 [2025-03-03 10:56:24,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:24,203 INFO L471 AbstractCegarLoop]: Abstraction has 5268 states and 5583 transitions. [2025-03-03 10:56:24,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 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-03 10:56:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5268 states and 5583 transitions. [2025-03-03 10:56:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2025-03-03 10:56:24,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:24,222 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:56:24,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:56:24,222 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:24,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:24,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1626059453, now seen corresponding path program 1 times [2025-03-03 10:56:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:24,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847154367] [2025-03-03 10:56:24,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:24,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-03-03 10:56:24,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-03-03 10:56:24,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:24,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 1072 proven. 0 refuted. 0 times theorem prover too weak. 436 trivial. 0 not checked. [2025-03-03 10:56:24,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:24,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847154367] [2025-03-03 10:56:24,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847154367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:24,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:24,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:24,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35506265] [2025-03-03 10:56:24,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:24,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:24,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:24,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:24,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:24,693 INFO L87 Difference]: Start difference. First operand 5268 states and 5583 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 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-03 10:56:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:25,370 INFO L93 Difference]: Finished difference Result 11850 states and 12616 transitions. [2025-03-03 10:56:25,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:25,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 881 [2025-03-03 10:56:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:25,383 INFO L225 Difference]: With dead ends: 11850 [2025-03-03 10:56:25,384 INFO L226 Difference]: Without dead ends: 6913 [2025-03-03 10:56:25,387 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-03 10:56:25,388 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 177 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:25,388 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 412 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:56:25,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-03 10:56:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6913. [2025-03-03 10:56:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6913 states, 6912 states have (on average 1.0435474537037037) internal successors, (7213), 6912 states have internal predecessors, (7213), 0 states have call successors, (0), 0 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-03 10:56:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6913 states to 6913 states and 7213 transitions. [2025-03-03 10:56:25,460 INFO L78 Accepts]: Start accepts. Automaton has 6913 states and 7213 transitions. Word has length 881 [2025-03-03 10:56:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:25,461 INFO L471 AbstractCegarLoop]: Abstraction has 6913 states and 7213 transitions. [2025-03-03 10:56:25,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 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-03 10:56:25,461 INFO L276 IsEmpty]: Start isEmpty. Operand 6913 states and 7213 transitions. [2025-03-03 10:56:25,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1179 [2025-03-03 10:56:25,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:25,472 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, 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, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:25,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:56:25,473 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:25,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:25,474 INFO L85 PathProgramCache]: Analyzing trace with hash 989012006, now seen corresponding path program 1 times [2025-03-03 10:56:25,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:25,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116059784] [2025-03-03 10:56:25,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:25,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:25,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1178 statements into 1 equivalence classes. [2025-03-03 10:56:25,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1178 of 1178 statements. [2025-03-03 10:56:25,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:25,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:26,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2746 backedges. 1525 proven. 0 refuted. 0 times theorem prover too weak. 1221 trivial. 0 not checked. [2025-03-03 10:56:26,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:26,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116059784] [2025-03-03 10:56:26,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116059784] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:26,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:26,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:26,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105708933] [2025-03-03 10:56:26,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:26,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:26,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:26,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:26,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:26,488 INFO L87 Difference]: Start difference. First operand 6913 states and 7213 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 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-03 10:56:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:27,128 INFO L93 Difference]: Finished difference Result 14482 states and 15145 transitions. [2025-03-03 10:56:27,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:27,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1178 [2025-03-03 10:56:27,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:27,146 INFO L225 Difference]: With dead ends: 14482 [2025-03-03 10:56:27,146 INFO L226 Difference]: Without dead ends: 7900 [2025-03-03 10:56:27,151 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-03 10:56:27,151 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:27,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 439 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:56:27,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-03-03 10:56:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-03-03 10:56:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.0389922775034814) internal successors, (8207), 7899 states have internal predecessors, (8207), 0 states have call successors, (0), 0 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-03 10:56:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8207 transitions. [2025-03-03 10:56:27,231 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8207 transitions. Word has length 1178 [2025-03-03 10:56:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:27,232 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8207 transitions. [2025-03-03 10:56:27,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 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-03 10:56:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8207 transitions. [2025-03-03 10:56:27,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1197 [2025-03-03 10:56:27,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:27,247 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, 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, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:27,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:56:27,247 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:27,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:27,248 INFO L85 PathProgramCache]: Analyzing trace with hash 652666549, now seen corresponding path program 1 times [2025-03-03 10:56:27,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:27,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219613706] [2025-03-03 10:56:27,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:27,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:27,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-03-03 10:56:27,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-03-03 10:56:27,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:27,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:28,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 1111 proven. 942 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2025-03-03 10:56:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219613706] [2025-03-03 10:56:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219613706] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224925580] [2025-03-03 10:56:28,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:28,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:28,390 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-03 10:56:28,392 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-03 10:56:28,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1196 statements into 1 equivalence classes. [2025-03-03 10:56:28,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1196 of 1196 statements. [2025-03-03 10:56:28,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:28,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:28,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1404 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:56:28,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:29,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 1636 proven. 0 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2025-03-03 10:56:29,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:29,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224925580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:29,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:29,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:56:29,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368531104] [2025-03-03 10:56:29,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:29,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:29,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:29,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:29,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:29,183 INFO L87 Difference]: Start difference. First operand 7900 states and 8207 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 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-03 10:56:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:29,764 INFO L93 Difference]: Finished difference Result 15469 states and 16081 transitions. [2025-03-03 10:56:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 1196 [2025-03-03 10:56:29,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:29,777 INFO L225 Difference]: With dead ends: 15469 [2025-03-03 10:56:29,777 INFO L226 Difference]: Without dead ends: 7900 [2025-03-03 10:56:29,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1196 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:29,784 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 151 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:29,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:29,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-03-03 10:56:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 7900. [2025-03-03 10:56:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7900 states, 7899 states have (on average 1.034054943663755) internal successors, (8168), 7899 states have internal predecessors, (8168), 0 states have call successors, (0), 0 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-03 10:56:29,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8168 transitions. [2025-03-03 10:56:29,848 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8168 transitions. Word has length 1196 [2025-03-03 10:56:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:29,849 INFO L471 AbstractCegarLoop]: Abstraction has 7900 states and 8168 transitions. [2025-03-03 10:56:29,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 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-03 10:56:29,850 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8168 transitions. [2025-03-03 10:56:29,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2025-03-03 10:56:29,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:29,864 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, 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, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:29,872 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-03 10:56:30,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:30,065 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:30,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash 941395418, now seen corresponding path program 1 times [2025-03-03 10:56:30,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:30,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120448907] [2025-03-03 10:56:30,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:30,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:30,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1272 statements into 1 equivalence classes. [2025-03-03 10:56:30,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1272 of 1272 statements. [2025-03-03 10:56:30,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:30,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 2842 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 2647 trivial. 0 not checked. [2025-03-03 10:56:30,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:30,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120448907] [2025-03-03 10:56:30,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120448907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:30,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:30,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:56:30,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291432822] [2025-03-03 10:56:30,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:30,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:56:30,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:30,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:56:30,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:56:30,839 INFO L87 Difference]: Start difference. First operand 7900 states and 8168 transitions. Second operand has 5 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-03 10:56:31,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:31,910 INFO L93 Difference]: Finished difference Result 20773 states and 21525 transitions. [2025-03-03 10:56:31,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 10:56:31,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 0 states have call successors, (0), 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 1272 [2025-03-03 10:56:31,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:31,927 INFO L225 Difference]: With dead ends: 20773 [2025-03-03 10:56:31,927 INFO L226 Difference]: Without dead ends: 12835 [2025-03-03 10:56:31,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:31,934 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 945 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:31,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 446 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:56:31,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12835 states. [2025-03-03 10:56:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12835 to 12177. [2025-03-03 10:56:32,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0330157687253614) internal successors, (12578), 12176 states have internal predecessors, (12578), 0 states have call successors, (0), 0 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-03 10:56:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12578 transitions. [2025-03-03 10:56:32,048 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12578 transitions. Word has length 1272 [2025-03-03 10:56:32,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:32,048 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12578 transitions. [2025-03-03 10:56:32,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.8) internal successors, (324), 5 states have internal predecessors, (324), 0 states have call successors, (0), 0 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-03 10:56:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12578 transitions. [2025-03-03 10:56:32,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1423 [2025-03-03 10:56:32,064 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:32,065 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 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-03 10:56:32,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:56:32,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:32,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:32,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1981372465, now seen corresponding path program 1 times [2025-03-03 10:56:32,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:32,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902638720] [2025-03-03 10:56:32,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:32,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:32,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1422 statements into 1 equivalence classes. [2025-03-03 10:56:32,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1422 of 1422 statements. [2025-03-03 10:56:32,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:32,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:33,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3817 backedges. 1763 proven. 156 refuted. 0 times theorem prover too weak. 1898 trivial. 0 not checked. [2025-03-03 10:56:33,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:33,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902638720] [2025-03-03 10:56:33,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902638720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:33,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199369727] [2025-03-03 10:56:33,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:33,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:33,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:33,799 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-03 10:56:33,801 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-03 10:56:33,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1422 statements into 1 equivalence classes. [2025-03-03 10:56:34,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1422 of 1422 statements. [2025-03-03 10:56:34,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:34,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:34,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 1651 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:56:34,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3817 backedges. 1919 proven. 0 refuted. 0 times theorem prover too weak. 1898 trivial. 0 not checked. [2025-03-03 10:56:34,697 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:34,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199369727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:34,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:34,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:56:34,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543461375] [2025-03-03 10:56:34,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:34,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:34,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:34,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:34,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:34,699 INFO L87 Difference]: Start difference. First operand 12177 states and 12578 transitions. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-03 10:56:35,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:35,302 INFO L93 Difference]: Finished difference Result 25997 states and 26865 transitions. [2025-03-03 10:56:35,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:35,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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 1422 [2025-03-03 10:56:35,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:35,319 INFO L225 Difference]: With dead ends: 25997 [2025-03-03 10:56:35,319 INFO L226 Difference]: Without dead ends: 14151 [2025-03-03 10:56:35,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1426 GetRequests, 1421 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:56:35,330 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 175 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:35,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 95 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:56:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-03 10:56:35,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2025-03-03 10:56:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0306056001736488) internal successors, (14244), 13821 states have internal predecessors, (14244), 0 states have call successors, (0), 0 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-03 10:56:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14244 transitions. [2025-03-03 10:56:35,455 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14244 transitions. Word has length 1422 [2025-03-03 10:56:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:35,455 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14244 transitions. [2025-03-03 10:56:35,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 0 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-03 10:56:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14244 transitions. [2025-03-03 10:56:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1582 [2025-03-03 10:56:35,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:35,474 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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] [2025-03-03 10:56:35,481 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-03 10:56:35,674 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-03 10:56:35,674 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:35,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:35,675 INFO L85 PathProgramCache]: Analyzing trace with hash 2141241534, now seen corresponding path program 1 times [2025-03-03 10:56:35,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:35,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121210050] [2025-03-03 10:56:35,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:35,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:35,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1581 statements into 1 equivalence classes. [2025-03-03 10:56:35,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1581 of 1581 statements. [2025-03-03 10:56:35,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:35,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 4283 backedges. 2939 proven. 0 refuted. 0 times theorem prover too weak. 1344 trivial. 0 not checked. [2025-03-03 10:56:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121210050] [2025-03-03 10:56:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121210050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:56:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256696056] [2025-03-03 10:56:37,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:37,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:56:37,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:37,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:56:37,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:56:37,091 INFO L87 Difference]: Start difference. First operand 13822 states and 14244 transitions. Second operand has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-03 10:56:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:37,983 INFO L93 Difference]: Finished difference Result 27651 states and 28495 transitions. [2025-03-03 10:56:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:56:37,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 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 1581 [2025-03-03 10:56:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:37,999 INFO L225 Difference]: With dead ends: 27651 [2025-03-03 10:56:38,000 INFO L226 Difference]: Without dead ends: 13831 [2025-03-03 10:56:38,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:56:38,010 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:38,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 442 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:56:38,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2025-03-03 10:56:38,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 13822. [2025-03-03 10:56:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0303161855147964) internal successors, (14240), 13821 states have internal predecessors, (14240), 0 states have call successors, (0), 0 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-03 10:56:38,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14240 transitions. [2025-03-03 10:56:38,172 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14240 transitions. Word has length 1581 [2025-03-03 10:56:38,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:38,174 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14240 transitions. [2025-03-03 10:56:38,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 0 states have call successors, (0), 0 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-03 10:56:38,174 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14240 transitions. [2025-03-03 10:56:38,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1612 [2025-03-03 10:56:38,207 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:38,207 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:38,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:56:38,207 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:38,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:38,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1371766417, now seen corresponding path program 1 times [2025-03-03 10:56:38,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:38,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072318885] [2025-03-03 10:56:38,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:38,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:38,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1611 statements into 1 equivalence classes. [2025-03-03 10:56:38,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1611 of 1611 statements. [2025-03-03 10:56:38,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:38,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:38,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4758 backedges. 3018 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-03-03 10:56:38,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:38,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072318885] [2025-03-03 10:56:38,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072318885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:38,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:38,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:38,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402981157] [2025-03-03 10:56:38,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:38,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:38,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:38,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:38,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:38,999 INFO L87 Difference]: Start difference. First operand 13822 states and 14240 transitions. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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-03 10:56:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:39,549 INFO L93 Difference]: Finished difference Result 29287 states and 30249 transitions. [2025-03-03 10:56:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:39,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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 1611 [2025-03-03 10:56:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:39,566 INFO L225 Difference]: With dead ends: 29287 [2025-03-03 10:56:39,567 INFO L226 Difference]: Without dead ends: 15467 [2025-03-03 10:56:39,576 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-03 10:56:39,576 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:39,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 428 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2025-03-03 10:56:39,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15138. [2025-03-03 10:56:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.027812644513444) internal successors, (15558), 15137 states have internal predecessors, (15558), 0 states have call successors, (0), 0 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-03 10:56:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15558 transitions. [2025-03-03 10:56:39,710 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15558 transitions. Word has length 1611 [2025-03-03 10:56:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:39,710 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15558 transitions. [2025-03-03 10:56:39,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 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-03 10:56:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15558 transitions. [2025-03-03 10:56:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1680 [2025-03-03 10:56:39,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:39,731 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:56:39,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:56:39,731 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:39,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:39,732 INFO L85 PathProgramCache]: Analyzing trace with hash 522309733, now seen corresponding path program 1 times [2025-03-03 10:56:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:39,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188031886] [2025-03-03 10:56:39,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:39,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:39,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1679 statements into 1 equivalence classes. [2025-03-03 10:56:39,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1679 of 1679 statements. [2025-03-03 10:56:39,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:39,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5489 backedges. 2686 proven. 1530 refuted. 0 times theorem prover too weak. 1273 trivial. 0 not checked. [2025-03-03 10:56:42,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188031886] [2025-03-03 10:56:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188031886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:42,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746799077] [2025-03-03 10:56:42,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:42,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:42,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:42,130 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-03 10:56:42,131 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-03 10:56:42,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1679 statements into 1 equivalence classes. [2025-03-03 10:56:42,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1679 of 1679 statements. [2025-03-03 10:56:42,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:42,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:42,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 1967 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:56:42,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5489 backedges. 2662 proven. 0 refuted. 0 times theorem prover too weak. 2827 trivial. 0 not checked. [2025-03-03 10:56:42,607 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746799077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:42,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:42,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:56:42,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999186703] [2025-03-03 10:56:42,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:42,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:42,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:42,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:42,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:42,611 INFO L87 Difference]: Start difference. First operand 15138 states and 15558 transitions. Second operand has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-03 10:56:43,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:43,200 INFO L93 Difference]: Finished difference Result 30603 states and 31448 transitions. [2025-03-03 10:56:43,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:43,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 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 1679 [2025-03-03 10:56:43,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:43,213 INFO L225 Difference]: With dead ends: 30603 [2025-03-03 10:56:43,213 INFO L226 Difference]: Without dead ends: 15467 [2025-03-03 10:56:43,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1684 GetRequests, 1680 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:56:43,221 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 263 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:43,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 430 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:56:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2025-03-03 10:56:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15467. [2025-03-03 10:56:43,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0268330531488425) internal successors, (15881), 15466 states have internal predecessors, (15881), 0 states have call successors, (0), 0 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-03 10:56:43,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15881 transitions. [2025-03-03 10:56:43,382 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15881 transitions. Word has length 1679 [2025-03-03 10:56:43,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:43,383 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15881 transitions. [2025-03-03 10:56:43,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.0) internal successors, (621), 3 states have internal predecessors, (621), 0 states have call successors, (0), 0 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-03 10:56:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15881 transitions. [2025-03-03 10:56:43,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2025-03-03 10:56:43,401 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:43,402 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:56:43,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:56:43,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:43,603 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:43,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:43,604 INFO L85 PathProgramCache]: Analyzing trace with hash 2066994344, now seen corresponding path program 1 times [2025-03-03 10:56:43,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:43,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590568325] [2025-03-03 10:56:43,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:43,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:43,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1763 statements into 1 equivalence classes. [2025-03-03 10:56:43,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1763 of 1763 statements. [2025-03-03 10:56:43,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:43,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:46,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6502 backedges. 3168 proven. 443 refuted. 0 times theorem prover too weak. 2891 trivial. 0 not checked. [2025-03-03 10:56:46,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:46,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590568325] [2025-03-03 10:56:46,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590568325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:46,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446164888] [2025-03-03 10:56:46,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:46,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:46,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:46,555 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:46,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 10:56:46,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1763 statements into 1 equivalence classes. [2025-03-03 10:56:46,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1763 of 1763 statements. [2025-03-03 10:56:46,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:46,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:46,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 2059 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:56:46,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6502 backedges. 4003 proven. 0 refuted. 0 times theorem prover too weak. 2499 trivial. 0 not checked. [2025-03-03 10:56:47,022 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:56:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446164888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:47,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:56:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-03 10:56:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168895383] [2025-03-03 10:56:47,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:47,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:47,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:47,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:47,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:56:47,025 INFO L87 Difference]: Start difference. First operand 15467 states and 15881 transitions. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 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-03 10:56:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:47,652 INFO L93 Difference]: Finished difference Result 34551 states and 35485 transitions. [2025-03-03 10:56:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:56:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 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 1763 [2025-03-03 10:56:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:47,667 INFO L225 Difference]: With dead ends: 34551 [2025-03-03 10:56:47,668 INFO L226 Difference]: Without dead ends: 19086 [2025-03-03 10:56:47,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1771 GetRequests, 1765 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:56:47,677 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 221 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:47,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 431 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:56:47,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2025-03-03 10:56:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 18099. [2025-03-03 10:56:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0261907393082108) internal successors, (18572), 18098 states have internal predecessors, (18572), 0 states have call successors, (0), 0 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-03 10:56:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18572 transitions. [2025-03-03 10:56:47,808 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18572 transitions. Word has length 1763 [2025-03-03 10:56:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:47,809 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18572 transitions. [2025-03-03 10:56:47,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 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-03 10:56:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18572 transitions. [2025-03-03 10:56:47,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1802 [2025-03-03 10:56:47,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:47,829 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:47,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 10:56:48,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 10:56:48,030 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:48,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:48,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1616636555, now seen corresponding path program 1 times [2025-03-03 10:56:48,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:48,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256113378] [2025-03-03 10:56:48,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:48,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:48,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1801 statements into 1 equivalence classes. [2025-03-03 10:56:48,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1801 of 1801 statements. [2025-03-03 10:56:48,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:48,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6248 backedges. 4575 proven. 91 refuted. 0 times theorem prover too weak. 1582 trivial. 0 not checked. [2025-03-03 10:56:49,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:49,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256113378] [2025-03-03 10:56:49,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256113378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:56:49,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609862250] [2025-03-03 10:56:49,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:49,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:56:49,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:56:49,741 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:56:49,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 10:56:49,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1801 statements into 1 equivalence classes. [2025-03-03 10:56:50,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1801 of 1801 statements. [2025-03-03 10:56:50,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:50,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:50,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 10:56:50,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:56:52,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6248 backedges. 2551 proven. 201 refuted. 0 times theorem prover too weak. 3496 trivial. 0 not checked. [2025-03-03 10:56:52,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:56:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6248 backedges. 2551 proven. 201 refuted. 0 times theorem prover too weak. 3496 trivial. 0 not checked. [2025-03-03 10:56:54,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609862250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:56:54,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:56:54,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-03-03 10:56:54,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532593993] [2025-03-03 10:56:54,905 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:56:54,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 10:56:54,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:54,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 10:56:54,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 10:56:54,908 INFO L87 Difference]: Start difference. First operand 18099 states and 18572 transitions. Second operand has 10 states, 10 states have (on average 187.9) internal successors, (1879), 10 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-03 10:56:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:56:57,473 INFO L93 Difference]: Finished difference Result 37184 states and 38146 transitions. [2025-03-03 10:56:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 10:56:57,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 187.9) internal successors, (1879), 10 states have internal predecessors, (1879), 0 states have call successors, (0), 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 1801 [2025-03-03 10:56:57,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:56:57,487 INFO L225 Difference]: With dead ends: 37184 [2025-03-03 10:56:57,487 INFO L226 Difference]: Without dead ends: 19087 [2025-03-03 10:56:57,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3612 GetRequests, 3601 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-03 10:56:57,496 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 1105 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6369 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 6369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:56:57,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 80 Invalid, 6510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 6369 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-03 10:56:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19087 states. [2025-03-03 10:56:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19087 to 18428. [2025-03-03 10:56:57,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0243664188419168) internal successors, (18876), 18427 states have internal predecessors, (18876), 0 states have call successors, (0), 0 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-03 10:56:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18876 transitions. [2025-03-03 10:56:57,654 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18876 transitions. Word has length 1801 [2025-03-03 10:56:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:56:57,655 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18876 transitions. [2025-03-03 10:56:57,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.9) internal successors, (1879), 10 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-03 10:56:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18876 transitions. [2025-03-03 10:56:57,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1919 [2025-03-03 10:56:57,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:56:57,677 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:56:57,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 10:56:57,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 10:56:57,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:56:57,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:56:57,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1772782950, now seen corresponding path program 1 times [2025-03-03 10:56:57,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:56:57,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921303714] [2025-03-03 10:56:57,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:56:57,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:56:57,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1918 statements into 1 equivalence classes. [2025-03-03 10:56:58,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1918 of 1918 statements. [2025-03-03 10:56:58,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:56:58,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:56:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7246 backedges. 3627 proven. 0 refuted. 0 times theorem prover too weak. 3619 trivial. 0 not checked. [2025-03-03 10:56:59,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:56:59,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921303714] [2025-03-03 10:56:59,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921303714] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:56:59,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:56:59,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:56:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027856240] [2025-03-03 10:56:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:56:59,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:56:59,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:56:59,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:56:59,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:56:59,477 INFO L87 Difference]: Start difference. First operand 18428 states and 18876 transitions. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-03 10:57:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:00,101 INFO L93 Difference]: Finished difference Result 40144 states and 41101 transitions. [2025-03-03 10:57:00,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:00,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 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 1918 [2025-03-03 10:57:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:00,120 INFO L225 Difference]: With dead ends: 40144 [2025-03-03 10:57:00,120 INFO L226 Difference]: Without dead ends: 21718 [2025-03-03 10:57:00,131 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-03 10:57:00,132 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:00,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 42 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21718 states. [2025-03-03 10:57:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21718 to 19415. [2025-03-03 10:57:00,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19415 states, 19414 states have (on average 1.0239002781497888) internal successors, (19878), 19414 states have internal predecessors, (19878), 0 states have call successors, (0), 0 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-03 10:57:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19415 states to 19415 states and 19878 transitions. [2025-03-03 10:57:00,340 INFO L78 Accepts]: Start accepts. Automaton has 19415 states and 19878 transitions. Word has length 1918 [2025-03-03 10:57:00,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:00,341 INFO L471 AbstractCegarLoop]: Abstraction has 19415 states and 19878 transitions. [2025-03-03 10:57:00,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-03 10:57:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 19415 states and 19878 transitions. [2025-03-03 10:57:00,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1944 [2025-03-03 10:57:00,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:00,371 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:00,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:57:00,371 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:00,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash -844017326, now seen corresponding path program 1 times [2025-03-03 10:57:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152784850] [2025-03-03 10:57:00,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:00,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1943 statements into 1 equivalence classes. [2025-03-03 10:57:00,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1943 of 1943 statements. [2025-03-03 10:57:00,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 7487 backedges. 5310 proven. 153 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2025-03-03 10:57:02,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:02,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152784850] [2025-03-03 10:57:02,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152784850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:57:02,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277850525] [2025-03-03 10:57:02,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:02,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:57:02,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:57:02,628 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:57:02,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 10:57:02,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1943 statements into 1 equivalence classes. [2025-03-03 10:57:02,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1943 of 1943 statements. [2025-03-03 10:57:02,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:02,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:02,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 2237 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:57:03,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:57:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7487 backedges. 3929 proven. 0 refuted. 0 times theorem prover too weak. 3558 trivial. 0 not checked. [2025-03-03 10:57:03,334 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:57:03,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277850525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:03,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:57:03,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 10:57:03,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943416761] [2025-03-03 10:57:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:03,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:57:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:03,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:57:03,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:57:03,336 INFO L87 Difference]: Start difference. First operand 19415 states and 19878 transitions. Second operand has 4 states, 4 states have (on average 176.25) internal successors, (705), 4 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-03 10:57:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:04,207 INFO L93 Difference]: Finished difference Result 39815 states and 40761 transitions. [2025-03-03 10:57:04,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:57:04,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 176.25) internal successors, (705), 4 states have internal predecessors, (705), 0 states have call successors, (0), 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 1943 [2025-03-03 10:57:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:04,226 INFO L225 Difference]: With dead ends: 39815 [2025-03-03 10:57:04,226 INFO L226 Difference]: Without dead ends: 20402 [2025-03-03 10:57:04,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1948 GetRequests, 1942 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:57:04,237 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 496 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:04,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 56 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:57:04,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20402 states. [2025-03-03 10:57:04,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20402 to 19744. [2025-03-03 10:57:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19744 states, 19743 states have (on average 1.0238565567542928) internal successors, (20214), 19743 states have internal predecessors, (20214), 0 states have call successors, (0), 0 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-03 10:57:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19744 states to 19744 states and 20214 transitions. [2025-03-03 10:57:04,393 INFO L78 Accepts]: Start accepts. Automaton has 19744 states and 20214 transitions. Word has length 1943 [2025-03-03 10:57:04,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:04,394 INFO L471 AbstractCegarLoop]: Abstraction has 19744 states and 20214 transitions. [2025-03-03 10:57:04,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.25) internal successors, (705), 4 states have internal predecessors, (705), 0 states have call successors, (0), 0 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-03 10:57:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 19744 states and 20214 transitions. [2025-03-03 10:57:04,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2011 [2025-03-03 10:57:04,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:04,417 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 2, 2, 2, 2, 2, 2, 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-03 10:57:04,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 10:57:04,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 10:57:04,618 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:04,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:04,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1488125580, now seen corresponding path program 1 times [2025-03-03 10:57:04,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:04,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998688902] [2025-03-03 10:57:04,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:04,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:04,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2010 statements into 1 equivalence classes. [2025-03-03 10:57:04,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2010 of 2010 statements. [2025-03-03 10:57:04,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:04,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:07,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7306 backedges. 5540 proven. 0 refuted. 0 times theorem prover too weak. 1766 trivial. 0 not checked. [2025-03-03 10:57:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998688902] [2025-03-03 10:57:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998688902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:57:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086845508] [2025-03-03 10:57:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:57:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:07,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:57:07,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:57:07,050 INFO L87 Difference]: Start difference. First operand 19744 states and 20214 transitions. Second operand has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 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-03 10:57:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:08,671 INFO L93 Difference]: Finished difference Result 46066 states and 47218 transitions. [2025-03-03 10:57:08,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:57:08,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 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 2010 [2025-03-03 10:57:08,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:08,703 INFO L225 Difference]: With dead ends: 46066 [2025-03-03 10:57:08,704 INFO L226 Difference]: Without dead ends: 26324 [2025-03-03 10:57:08,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:57:08,722 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 577 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:08,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 52 Invalid, 2466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2307 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:57:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26324 states. [2025-03-03 10:57:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26324 to 23363. [2025-03-03 10:57:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23363 states, 23362 states have (on average 1.023628114031333) internal successors, (23914), 23362 states have internal predecessors, (23914), 0 states have call successors, (0), 0 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-03 10:57:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23363 states to 23363 states and 23914 transitions. [2025-03-03 10:57:09,034 INFO L78 Accepts]: Start accepts. Automaton has 23363 states and 23914 transitions. Word has length 2010 [2025-03-03 10:57:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:09,035 INFO L471 AbstractCegarLoop]: Abstraction has 23363 states and 23914 transitions. [2025-03-03 10:57:09,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 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-03 10:57:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 23363 states and 23914 transitions. [2025-03-03 10:57:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2027 [2025-03-03 10:57:09,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:09,083 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-03 10:57:09,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:57:09,083 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:09,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash 425071868, now seen corresponding path program 1 times [2025-03-03 10:57:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545564741] [2025-03-03 10:57:09,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:09,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:09,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2026 statements into 1 equivalence classes. [2025-03-03 10:57:09,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2026 of 2026 statements. [2025-03-03 10:57:09,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:09,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:10,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7743 backedges. 4734 proven. 0 refuted. 0 times theorem prover too weak. 3009 trivial. 0 not checked. [2025-03-03 10:57:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545564741] [2025-03-03 10:57:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545564741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921646344] [2025-03-03 10:57:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:10,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:10,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:10,817 INFO L87 Difference]: Start difference. First operand 23363 states and 23914 transitions. Second operand has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 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-03 10:57:11,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:11,487 INFO L93 Difference]: Finished difference Result 49356 states and 50535 transitions. [2025-03-03 10:57:11,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:11,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 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 2026 [2025-03-03 10:57:11,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:11,508 INFO L225 Difference]: With dead ends: 49356 [2025-03-03 10:57:11,508 INFO L226 Difference]: Without dead ends: 25995 [2025-03-03 10:57:11,517 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-03 10:57:11,517 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 42 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:11,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 407 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25995 states. [2025-03-03 10:57:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25995 to 23692. [2025-03-03 10:57:11,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23692 states, 23691 states have (on average 1.0244396606306192) internal successors, (24270), 23691 states have internal predecessors, (24270), 0 states have call successors, (0), 0 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-03 10:57:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23692 states to 23692 states and 24270 transitions. [2025-03-03 10:57:11,687 INFO L78 Accepts]: Start accepts. Automaton has 23692 states and 24270 transitions. Word has length 2026 [2025-03-03 10:57:11,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:11,688 INFO L471 AbstractCegarLoop]: Abstraction has 23692 states and 24270 transitions. [2025-03-03 10:57:11,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.0) internal successors, (828), 3 states have internal predecessors, (828), 0 states have call successors, (0), 0 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-03 10:57:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23692 states and 24270 transitions. [2025-03-03 10:57:11,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2089 [2025-03-03 10:57:11,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:11,712 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-03 10:57:11,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:57:11,712 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1943821631, now seen corresponding path program 1 times [2025-03-03 10:57:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:11,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646678256] [2025-03-03 10:57:11,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:11,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:11,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2088 statements into 1 equivalence classes. [2025-03-03 10:57:11,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2088 of 2088 statements. [2025-03-03 10:57:11,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:11,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:14,126 INFO L134 CoverageAnalysis]: Checked inductivity of 7995 backedges. 5177 proven. 79 refuted. 0 times theorem prover too weak. 2739 trivial. 0 not checked. [2025-03-03 10:57:14,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646678256] [2025-03-03 10:57:14,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646678256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:57:14,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621176654] [2025-03-03 10:57:14,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:14,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:57:14,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:57:14,130 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:57:14,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 10:57:14,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2088 statements into 1 equivalence classes. [2025-03-03 10:57:14,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2088 of 2088 statements. [2025-03-03 10:57:14,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:14,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:14,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 2393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:57:14,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:57:15,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7995 backedges. 4033 proven. 250 refuted. 0 times theorem prover too weak. 3712 trivial. 0 not checked. [2025-03-03 10:57:15,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:57:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 7995 backedges. 2866 proven. 0 refuted. 0 times theorem prover too weak. 5129 trivial. 0 not checked. [2025-03-03 10:57:16,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621176654] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:57:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:57:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-03-03 10:57:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817148608] [2025-03-03 10:57:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:16,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:16,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:16,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:57:16,571 INFO L87 Difference]: Start difference. First operand 23692 states and 24270 transitions. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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-03 10:57:17,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:17,164 INFO L93 Difference]: Finished difference Result 46724 states and 47837 transitions. [2025-03-03 10:57:17,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:17,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 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 2088 [2025-03-03 10:57:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:17,184 INFO L225 Difference]: With dead ends: 46724 [2025-03-03 10:57:17,184 INFO L226 Difference]: Without dead ends: 23034 [2025-03-03 10:57:17,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4178 GetRequests, 4173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:57:17,197 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:17,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 17 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:57:17,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23034 states. [2025-03-03 10:57:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23034 to 22376. [2025-03-03 10:57:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22376 states, 22375 states have (on average 1.0224804469273743) internal successors, (22878), 22375 states have internal predecessors, (22878), 0 states have call successors, (0), 0 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-03 10:57:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22376 states to 22376 states and 22878 transitions. [2025-03-03 10:57:17,353 INFO L78 Accepts]: Start accepts. Automaton has 22376 states and 22878 transitions. Word has length 2088 [2025-03-03 10:57:17,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:17,354 INFO L471 AbstractCegarLoop]: Abstraction has 22376 states and 22878 transitions. [2025-03-03 10:57:17,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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-03 10:57:17,354 INFO L276 IsEmpty]: Start isEmpty. Operand 22376 states and 22878 transitions. [2025-03-03 10:57:17,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2089 [2025-03-03 10:57:17,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:17,377 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:17,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 10:57:17,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:57:17,578 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:17,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:17,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1301142313, now seen corresponding path program 1 times [2025-03-03 10:57:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:17,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255689726] [2025-03-03 10:57:17,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:17,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2088 statements into 1 equivalence classes. [2025-03-03 10:57:17,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2088 of 2088 statements. [2025-03-03 10:57:17,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:17,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:19,676 INFO L134 CoverageAnalysis]: Checked inductivity of 8688 backedges. 6450 proven. 153 refuted. 0 times theorem prover too weak. 2085 trivial. 0 not checked. [2025-03-03 10:57:19,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:19,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255689726] [2025-03-03 10:57:19,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255689726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:57:19,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193777632] [2025-03-03 10:57:19,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:19,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:57:19,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:57:19,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:57:19,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 10:57:19,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2088 statements into 1 equivalence classes. [2025-03-03 10:57:20,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2088 of 2088 statements. [2025-03-03 10:57:20,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:20,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:20,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 2401 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:57:20,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:57:20,358 INFO L134 CoverageAnalysis]: Checked inductivity of 8688 backedges. 5082 proven. 0 refuted. 0 times theorem prover too weak. 3606 trivial. 0 not checked. [2025-03-03 10:57:20,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:57:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193777632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:20,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:57:20,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-03 10:57:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408350183] [2025-03-03 10:57:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:20,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:20,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:57:20,360 INFO L87 Difference]: Start difference. First operand 22376 states and 22878 transitions. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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-03 10:57:21,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:21,009 INFO L93 Difference]: Finished difference Result 48040 states and 49113 transitions. [2025-03-03 10:57:21,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:21,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 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 2088 [2025-03-03 10:57:21,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:21,030 INFO L225 Difference]: With dead ends: 48040 [2025-03-03 10:57:21,031 INFO L226 Difference]: Without dead ends: 25666 [2025-03-03 10:57:21,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2093 GetRequests, 2088 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:57:21,044 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 253 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:21,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 422 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:57:21,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25666 states. [2025-03-03 10:57:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25666 to 22376. [2025-03-03 10:57:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22376 states, 22375 states have (on average 1.0224804469273743) internal successors, (22878), 22375 states have internal predecessors, (22878), 0 states have call successors, (0), 0 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-03 10:57:21,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22376 states to 22376 states and 22878 transitions. [2025-03-03 10:57:21,215 INFO L78 Accepts]: Start accepts. Automaton has 22376 states and 22878 transitions. Word has length 2088 [2025-03-03 10:57:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:21,215 INFO L471 AbstractCegarLoop]: Abstraction has 22376 states and 22878 transitions. [2025-03-03 10:57:21,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 0 states have call successors, (0), 0 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-03 10:57:21,215 INFO L276 IsEmpty]: Start isEmpty. Operand 22376 states and 22878 transitions. [2025-03-03 10:57:21,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2120 [2025-03-03 10:57:21,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:21,241 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:57:21,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 10:57:21,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-03 10:57:21,441 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 2105667781, now seen corresponding path program 1 times [2025-03-03 10:57:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766112823] [2025-03-03 10:57:21,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:21,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:21,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2119 statements into 1 equivalence classes. [2025-03-03 10:57:21,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2119 of 2119 statements. [2025-03-03 10:57:21,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:21,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:23,673 INFO L134 CoverageAnalysis]: Checked inductivity of 8521 backedges. 6092 proven. 153 refuted. 0 times theorem prover too weak. 2276 trivial. 0 not checked. [2025-03-03 10:57:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766112823] [2025-03-03 10:57:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766112823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:57:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175063183] [2025-03-03 10:57:23,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:23,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:57:23,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:57:23,676 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:57:23,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 10:57:23,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2119 statements into 1 equivalence classes. [2025-03-03 10:57:24,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2119 of 2119 statements. [2025-03-03 10:57:24,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:24,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:24,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 2411 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:57:24,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:57:24,301 INFO L134 CoverageAnalysis]: Checked inductivity of 8521 backedges. 4746 proven. 0 refuted. 0 times theorem prover too weak. 3775 trivial. 0 not checked. [2025-03-03 10:57:24,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:57:24,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175063183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:24,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:57:24,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-03 10:57:24,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785308009] [2025-03-03 10:57:24,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:24,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:57:24,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:24,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:57:24,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:57:24,303 INFO L87 Difference]: Start difference. First operand 22376 states and 22878 transitions. Second operand has 4 states, 4 states have (on average 208.5) internal successors, (834), 4 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-03 10:57:25,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:25,176 INFO L93 Difference]: Finished difference Result 45408 states and 46419 transitions. [2025-03-03 10:57:25,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:57:25,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 208.5) internal successors, (834), 4 states have internal predecessors, (834), 0 states have call successors, (0), 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 2119 [2025-03-03 10:57:25,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:25,198 INFO L225 Difference]: With dead ends: 45408 [2025-03-03 10:57:25,198 INFO L226 Difference]: Without dead ends: 23034 [2025-03-03 10:57:25,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2124 GetRequests, 2118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:57:25,212 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 362 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:25,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 61 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1483 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:57:25,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23034 states. [2025-03-03 10:57:25,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23034 to 22047. [2025-03-03 10:57:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22047 states, 22046 states have (on average 1.0222716138982129) internal successors, (22537), 22046 states have internal predecessors, (22537), 0 states have call successors, (0), 0 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-03 10:57:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22047 states to 22047 states and 22537 transitions. [2025-03-03 10:57:25,454 INFO L78 Accepts]: Start accepts. Automaton has 22047 states and 22537 transitions. Word has length 2119 [2025-03-03 10:57:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:25,454 INFO L471 AbstractCegarLoop]: Abstraction has 22047 states and 22537 transitions. [2025-03-03 10:57:25,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 208.5) internal successors, (834), 4 states have internal predecessors, (834), 0 states have call successors, (0), 0 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-03 10:57:25,455 INFO L276 IsEmpty]: Start isEmpty. Operand 22047 states and 22537 transitions. [2025-03-03 10:57:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2187 [2025-03-03 10:57:25,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:25,481 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 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, 1, 1, 1, 1, 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-03 10:57:25,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 10:57:25,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:57:25,682 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:25,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:25,683 INFO L85 PathProgramCache]: Analyzing trace with hash 385405427, now seen corresponding path program 1 times [2025-03-03 10:57:25,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:25,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164398775] [2025-03-03 10:57:25,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:25,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:25,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2186 statements into 1 equivalence classes. [2025-03-03 10:57:25,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2186 of 2186 statements. [2025-03-03 10:57:25,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:25,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:28,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8586 backedges. 6018 proven. 0 refuted. 0 times theorem prover too weak. 2568 trivial. 0 not checked. [2025-03-03 10:57:28,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:28,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164398775] [2025-03-03 10:57:28,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164398775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:28,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:28,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:57:28,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101385040] [2025-03-03 10:57:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:28,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:57:28,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:28,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:57:28,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:57:28,494 INFO L87 Difference]: Start difference. First operand 22047 states and 22537 transitions. Second operand has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 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-03 10:57:29,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:29,434 INFO L93 Difference]: Finished difference Result 45737 states and 46735 transitions. [2025-03-03 10:57:29,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:57:29,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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 2186 [2025-03-03 10:57:29,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:29,504 INFO L225 Difference]: With dead ends: 45737 [2025-03-03 10:57:29,505 INFO L226 Difference]: Without dead ends: 23692 [2025-03-03 10:57:29,509 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-03 10:57:29,510 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 310 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:29,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 44 Invalid, 1613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1518 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:57:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23692 states. [2025-03-03 10:57:29,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23692 to 22705. [2025-03-03 10:57:29,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22705 states, 22704 states have (on average 1.0217582804792107) internal successors, (23198), 22704 states have internal predecessors, (23198), 0 states have call successors, (0), 0 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-03 10:57:29,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22705 states to 22705 states and 23198 transitions. [2025-03-03 10:57:29,677 INFO L78 Accepts]: Start accepts. Automaton has 22705 states and 23198 transitions. Word has length 2186 [2025-03-03 10:57:29,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:29,677 INFO L471 AbstractCegarLoop]: Abstraction has 22705 states and 23198 transitions. [2025-03-03 10:57:29,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 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-03 10:57:29,677 INFO L276 IsEmpty]: Start isEmpty. Operand 22705 states and 23198 transitions. [2025-03-03 10:57:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2255 [2025-03-03 10:57:29,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:29,704 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 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-03 10:57:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:57:29,705 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:29,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:29,705 INFO L85 PathProgramCache]: Analyzing trace with hash -100635138, now seen corresponding path program 1 times [2025-03-03 10:57:29,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:29,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323814268] [2025-03-03 10:57:29,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:29,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2254 statements into 1 equivalence classes. [2025-03-03 10:57:29,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2254 of 2254 statements. [2025-03-03 10:57:29,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:29,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:57:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 10075 backedges. 5339 proven. 0 refuted. 0 times theorem prover too weak. 4736 trivial. 0 not checked. [2025-03-03 10:57:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:57:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323814268] [2025-03-03 10:57:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323814268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:57:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:57:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:57:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609387378] [2025-03-03 10:57:31,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:57:31,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:57:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:57:31,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:57:31,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:57:31,612 INFO L87 Difference]: Start difference. First operand 22705 states and 23198 transitions. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-03 10:57:32,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:57:32,210 INFO L93 Difference]: Finished difference Result 45737 states and 46728 transitions. [2025-03-03 10:57:32,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:57:32,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 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 2254 [2025-03-03 10:57:32,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:57:32,230 INFO L225 Difference]: With dead ends: 45737 [2025-03-03 10:57:32,230 INFO L226 Difference]: Without dead ends: 23034 [2025-03-03 10:57:32,241 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-03 10:57:32,241 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 243 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:57:32,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 69 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:57:32,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23034 states. [2025-03-03 10:57:32,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23034 to 22047. [2025-03-03 10:57:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22047 states, 22046 states have (on average 1.0219994556835708) internal successors, (22531), 22046 states have internal predecessors, (22531), 0 states have call successors, (0), 0 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-03 10:57:32,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22047 states to 22047 states and 22531 transitions. [2025-03-03 10:57:32,413 INFO L78 Accepts]: Start accepts. Automaton has 22047 states and 22531 transitions. Word has length 2254 [2025-03-03 10:57:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:57:32,414 INFO L471 AbstractCegarLoop]: Abstraction has 22047 states and 22531 transitions. [2025-03-03 10:57:32,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 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-03 10:57:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 22047 states and 22531 transitions. [2025-03-03 10:57:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2302 [2025-03-03 10:57:32,440 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:57:32,441 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 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, 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, 1, 1, 1, 1, 1, 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-03 10:57:32,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 10:57:32,441 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:57:32,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:57:32,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1454678796, now seen corresponding path program 1 times [2025-03-03 10:57:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:57:32,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726399786] [2025-03-03 10:57:32,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:57:32,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:57:32,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2301 statements into 1 equivalence classes. [2025-03-03 10:57:32,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2301 of 2301 statements. [2025-03-03 10:57:32,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:57:32,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 10:57:32,938 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 10:57:32,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2301 statements into 1 equivalence classes.