./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.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 cf2e081cc9f75dea6397073b82669a6a6f9f53b1ab4e083e4f8da1bc210df95c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:59:46,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:59:46,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:59:46,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:59:46,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:59:46,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:59:46,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:59:46,718 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:59:46,718 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:59:46,718 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:59:46,719 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:59:46,719 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:59:46,719 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:59:46,719 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:59:46,720 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:59:46,720 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:59:46,720 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:59:46,720 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:59:46,720 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:59:46,720 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:59:46,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:59:46,721 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:59:46,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:59:46,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:59:46,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:59:46,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:59:46,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:59:46,723 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 -> cf2e081cc9f75dea6397073b82669a6a6f9f53b1ab4e083e4f8da1bc210df95c [2025-03-08 05:59:46,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:59:46,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:59:46,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:59:46,938 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:59:46,938 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:59:46,939 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2025-03-08 05:59:48,155 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ade67ec/41e1b8067e5d459a87d56e3b8538525d/FLAG7c71dc52e [2025-03-08 05:59:48,377 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:59:48,378 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2025-03-08 05:59:48,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ade67ec/41e1b8067e5d459a87d56e3b8538525d/FLAG7c71dc52e [2025-03-08 05:59:48,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41ade67ec/41e1b8067e5d459a87d56e3b8538525d [2025-03-08 05:59:48,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:59:48,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:59:48,714 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:59:48,714 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:59:48,716 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:59:48,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:48,717 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@91113e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48, skipping insertion in model container [2025-03-08 05:59:48,717 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:48,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:59:48,895 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/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c[12820,12833] [2025-03-08 05:59:48,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:59:48,908 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:59:48,960 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/seq-mthreaded/pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c[12820,12833] [2025-03-08 05:59:48,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:59:48,978 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:59:48,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48 WrapperNode [2025-03-08 05:59:48,980 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:59:48,981 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:59:48,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:59:48,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:59:48,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:48,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,017 INFO L138 Inliner]: procedures = 25, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 381 [2025-03-08 05:59:49,017 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:59:49,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:59:49,018 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:59:49,018 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:59:49,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,046 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 05:59:49,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,047 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,054 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,058 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:59:49,065 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:59:49,065 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:59:49,065 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:59:49,066 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (1/1) ... [2025-03-08 05:59:49,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:59:49,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:49,089 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:59:49,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:59:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:59:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:59:49,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:59:49,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:59:49,183 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:59:49,185 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:59:49,593 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-08 05:59:49,596 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:59:49,607 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:59:49,608 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:59:49,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:59:49 BoogieIcfgContainer [2025-03-08 05:59:49,608 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:59:49,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:59:49,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:59:49,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:59:49,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:59:48" (1/3) ... [2025-03-08 05:59:49,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785116db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:59:49, skipping insertion in model container [2025-03-08 05:59:49,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:59:48" (2/3) ... [2025-03-08 05:59:49,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785116db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:59:49, skipping insertion in model container [2025-03-08 05:59:49,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:59:49" (3/3) ... [2025-03-08 05:59:49,618 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c [2025-03-08 05:59:49,629 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:59:49,632 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr-var-start-time.5.1.ufo.UNBOUNDED.pals.c that has 1 procedures, 103 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:59:49,687 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:59:49,700 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;@4feeacda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:59:49,701 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:59:49,704 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 101 states have (on average 1.7425742574257426) internal successors, (176), 102 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:59:49,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:49,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:49,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:49,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:49,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1859792487, now seen corresponding path program 1 times [2025-03-08 05:59:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:49,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513575894] [2025-03-08 05:59:49,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:49,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:49,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:59:49,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:59:49,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:49,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:49,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:49,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:49,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513575894] [2025-03-08 05:59:49,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513575894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:49,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:49,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:59:49,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539716777] [2025-03-08 05:59:49,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:49,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:59:49,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:49,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:59:49,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:59:49,960 INFO L87 Difference]: Start difference. First operand has 103 states, 101 states have (on average 1.7425742574257426) internal successors, (176), 102 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:49,973 INFO L93 Difference]: Finished difference Result 166 states and 280 transitions. [2025-03-08 05:59:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:59:49,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 05:59:49,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:49,979 INFO L225 Difference]: With dead ends: 166 [2025-03-08 05:59:49,980 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 05:59:49,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:59:49,983 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:49,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:49,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 05:59:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 05:59:50,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.7272727272727273) internal successors, (171), 99 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 171 transitions. [2025-03-08 05:59:50,006 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 171 transitions. Word has length 33 [2025-03-08 05:59:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:50,006 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 171 transitions. [2025-03-08 05:59:50,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 171 transitions. [2025-03-08 05:59:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-08 05:59:50,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:50,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:50,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:59:50,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:50,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1605055942, now seen corresponding path program 1 times [2025-03-08 05:59:50,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:50,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724063509] [2025-03-08 05:59:50,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:50,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-08 05:59:50,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-08 05:59:50,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:50,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:50,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:50,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:50,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724063509] [2025-03-08 05:59:50,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724063509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:50,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:50,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:59:50,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160998834] [2025-03-08 05:59:50,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:50,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:59:50,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:50,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:59:50,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:59:50,230 INFO L87 Difference]: Start difference. First operand 100 states and 171 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:50,310 INFO L93 Difference]: Finished difference Result 166 states and 276 transitions. [2025-03-08 05:59:50,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:59:50,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-08 05:59:50,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:50,312 INFO L225 Difference]: With dead ends: 166 [2025-03-08 05:59:50,312 INFO L226 Difference]: Without dead ends: 100 [2025-03-08 05:59:50,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:59:50,313 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 0 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:50,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 639 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:50,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-08 05:59:50,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-03-08 05:59:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 139 transitions. [2025-03-08 05:59:50,317 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 139 transitions. Word has length 33 [2025-03-08 05:59:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:50,318 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 139 transitions. [2025-03-08 05:59:50,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 139 transitions. [2025-03-08 05:59:50,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:59:50,319 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:50,319 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:50,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:59:50,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:50,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:50,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1127338766, now seen corresponding path program 1 times [2025-03-08 05:59:50,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:50,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107056166] [2025-03-08 05:59:50,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:50,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:50,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:59:50,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:59:50,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:50,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:50,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107056166] [2025-03-08 05:59:50,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107056166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:50,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:50,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:50,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153582858] [2025-03-08 05:59:50,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:50,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:50,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:50,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:50,439 INFO L87 Difference]: Start difference. First operand 100 states and 139 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:50,494 INFO L93 Difference]: Finished difference Result 216 states and 327 transitions. [2025-03-08 05:59:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:50,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 05:59:50,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:50,498 INFO L225 Difference]: With dead ends: 216 [2025-03-08 05:59:50,498 INFO L226 Difference]: Without dead ends: 154 [2025-03-08 05:59:50,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:50,499 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 85 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:50,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 304 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-08 05:59:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2025-03-08 05:59:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 151 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2025-03-08 05:59:50,508 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 64 [2025-03-08 05:59:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:50,508 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2025-03-08 05:59:50,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2025-03-08 05:59:50,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:59:50,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:50,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:50,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:59:50,511 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:50,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:50,512 INFO L85 PathProgramCache]: Analyzing trace with hash -940490081, now seen corresponding path program 1 times [2025-03-08 05:59:50,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:50,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712685423] [2025-03-08 05:59:50,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:50,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:50,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:59:50,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:59:50,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:50,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:50,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:50,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:50,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712685423] [2025-03-08 05:59:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712685423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898024598] [2025-03-08 05:59:50,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:50,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:50,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:50,610 INFO L87 Difference]: Start difference. First operand 152 states and 224 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:50,634 INFO L93 Difference]: Finished difference Result 364 states and 568 transitions. [2025-03-08 05:59:50,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:50,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 05:59:50,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:50,636 INFO L225 Difference]: With dead ends: 364 [2025-03-08 05:59:50,636 INFO L226 Difference]: Without dead ends: 250 [2025-03-08 05:59:50,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:50,637 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 81 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:50,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 301 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-03-08 05:59:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2025-03-08 05:59:50,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 1.534412955465587) internal successors, (379), 247 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 379 transitions. [2025-03-08 05:59:50,653 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 379 transitions. Word has length 64 [2025-03-08 05:59:50,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:50,654 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 379 transitions. [2025-03-08 05:59:50,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,654 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 379 transitions. [2025-03-08 05:59:50,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 05:59:50,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:50,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:50,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:59:50,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:50,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:50,656 INFO L85 PathProgramCache]: Analyzing trace with hash -751552820, now seen corresponding path program 1 times [2025-03-08 05:59:50,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:50,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222389990] [2025-03-08 05:59:50,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:50,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 05:59:50,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 05:59:50,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:50,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:50,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:50,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222389990] [2025-03-08 05:59:50,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222389990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:50,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:50,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:59:50,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346559314] [2025-03-08 05:59:50,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:50,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:59:50,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:50,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:59:50,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:59:50,846 INFO L87 Difference]: Start difference. First operand 248 states and 379 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:50,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:50,986 INFO L93 Difference]: Finished difference Result 1508 states and 2425 transitions. [2025-03-08 05:59:50,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:59:50,987 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 05:59:50,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:50,991 INFO L225 Difference]: With dead ends: 1508 [2025-03-08 05:59:50,991 INFO L226 Difference]: Without dead ends: 1298 [2025-03-08 05:59:50,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:59:50,993 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1399 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:50,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 980 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2025-03-08 05:59:51,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 456. [2025-03-08 05:59:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 1.5626373626373626) internal successors, (711), 455 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 711 transitions. [2025-03-08 05:59:51,031 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 711 transitions. Word has length 64 [2025-03-08 05:59:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:51,031 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 711 transitions. [2025-03-08 05:59:51,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 711 transitions. [2025-03-08 05:59:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-08 05:59:51,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:51,035 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:59:51,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:51,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1793686728, now seen corresponding path program 1 times [2025-03-08 05:59:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:51,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003750607] [2025-03-08 05:59:51,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:51,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 05:59:51,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 05:59:51,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:51,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:51,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:51,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003750607] [2025-03-08 05:59:51,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003750607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:51,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:51,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:59:51,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128765090] [2025-03-08 05:59:51,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:51,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:59:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:51,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:59:51,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:59:51,247 INFO L87 Difference]: Start difference. First operand 456 states and 711 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:51,270 INFO L93 Difference]: Finished difference Result 482 states and 744 transitions. [2025-03-08 05:59:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:59:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2025-03-08 05:59:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:51,272 INFO L225 Difference]: With dead ends: 482 [2025-03-08 05:59:51,273 INFO L226 Difference]: Without dead ends: 480 [2025-03-08 05:59:51,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:59:51,273 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:51,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:51,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2025-03-08 05:59:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2025-03-08 05:59:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 479 states have (on average 1.534446764091858) internal successors, (735), 479 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 735 transitions. [2025-03-08 05:59:51,289 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 735 transitions. Word has length 65 [2025-03-08 05:59:51,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:51,290 INFO L471 AbstractCegarLoop]: Abstraction has 480 states and 735 transitions. [2025-03-08 05:59:51,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,290 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 735 transitions. [2025-03-08 05:59:51,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 05:59:51,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:51,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:51,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:59:51,292 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:51,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash 319005836, now seen corresponding path program 1 times [2025-03-08 05:59:51,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:51,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984276992] [2025-03-08 05:59:51,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:51,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:51,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 05:59:51,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 05:59:51,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:51,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:51,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:51,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984276992] [2025-03-08 05:59:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984276992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:51,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:51,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:51,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310345802] [2025-03-08 05:59:51,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:51,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:51,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:51,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:51,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:51,369 INFO L87 Difference]: Start difference. First operand 480 states and 735 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:51,398 INFO L93 Difference]: Finished difference Result 1304 states and 2029 transitions. [2025-03-08 05:59:51,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:51,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2025-03-08 05:59:51,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:51,401 INFO L225 Difference]: With dead ends: 1304 [2025-03-08 05:59:51,401 INFO L226 Difference]: Without dead ends: 862 [2025-03-08 05:59:51,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:51,403 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 65 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:51,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 232 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:51,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-03-08 05:59:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 852. [2025-03-08 05:59:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 852 states, 851 states have (on average 1.535840188014101) internal successors, (1307), 851 states have internal predecessors, (1307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1307 transitions. [2025-03-08 05:59:51,443 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1307 transitions. Word has length 66 [2025-03-08 05:59:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:51,445 INFO L471 AbstractCegarLoop]: Abstraction has 852 states and 1307 transitions. [2025-03-08 05:59:51,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,445 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1307 transitions. [2025-03-08 05:59:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:59:51,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:51,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:51,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:59:51,447 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1960253371, now seen corresponding path program 1 times [2025-03-08 05:59:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004449452] [2025-03-08 05:59:51,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:51,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:51,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:59:51,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:59:51,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:51,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:51,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004449452] [2025-03-08 05:59:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004449452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:51,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98791668] [2025-03-08 05:59:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:51,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:51,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:51,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:51,508 INFO L87 Difference]: Start difference. First operand 852 states and 1307 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:51,539 INFO L93 Difference]: Finished difference Result 2352 states and 3621 transitions. [2025-03-08 05:59:51,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:51,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 05:59:51,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:51,544 INFO L225 Difference]: With dead ends: 2352 [2025-03-08 05:59:51,544 INFO L226 Difference]: Without dead ends: 1538 [2025-03-08 05:59:51,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:51,545 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 73 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:51,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2025-03-08 05:59:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1536. [2025-03-08 05:59:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1536 states, 1535 states have (on average 1.521172638436482) internal successors, (2335), 1535 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1536 states to 1536 states and 2335 transitions. [2025-03-08 05:59:51,583 INFO L78 Accepts]: Start accepts. Automaton has 1536 states and 2335 transitions. Word has length 67 [2025-03-08 05:59:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:51,583 INFO L471 AbstractCegarLoop]: Abstraction has 1536 states and 2335 transitions. [2025-03-08 05:59:51,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1536 states and 2335 transitions. [2025-03-08 05:59:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 05:59:51,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:51,585 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:51,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:59:51,586 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:51,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:51,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1176038035, now seen corresponding path program 1 times [2025-03-08 05:59:51,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:51,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898990343] [2025-03-08 05:59:51,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:51,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 05:59:51,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 05:59:51,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:51,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:51,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898990343] [2025-03-08 05:59:51,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898990343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:51,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124376978] [2025-03-08 05:59:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:51,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:51,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:51,661 INFO L87 Difference]: Start difference. First operand 1536 states and 2335 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:51,745 INFO L93 Difference]: Finished difference Result 4276 states and 6481 transitions. [2025-03-08 05:59:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:51,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2025-03-08 05:59:51,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:51,758 INFO L225 Difference]: With dead ends: 4276 [2025-03-08 05:59:51,758 INFO L226 Difference]: Without dead ends: 2778 [2025-03-08 05:59:51,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:51,761 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 77 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:51,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 299 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:51,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2778 states. [2025-03-08 05:59:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2778 to 2776. [2025-03-08 05:59:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2776 states, 2775 states have (on average 1.495855855855856) internal successors, (4151), 2775 states have internal predecessors, (4151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2776 states to 2776 states and 4151 transitions. [2025-03-08 05:59:51,840 INFO L78 Accepts]: Start accepts. Automaton has 2776 states and 4151 transitions. Word has length 67 [2025-03-08 05:59:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:51,840 INFO L471 AbstractCegarLoop]: Abstraction has 2776 states and 4151 transitions. [2025-03-08 05:59:51,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2776 states and 4151 transitions. [2025-03-08 05:59:51,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 05:59:51,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:51,841 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:51,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:59:51,841 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1485654306, now seen corresponding path program 1 times [2025-03-08 05:59:51,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:51,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729427181] [2025-03-08 05:59:51,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:51,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:51,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 05:59:51,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 05:59:51,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:51,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:51,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:51,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:51,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729427181] [2025-03-08 05:59:51,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729427181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:51,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:51,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:51,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220147104] [2025-03-08 05:59:51,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:51,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:51,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:51,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:51,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:51,898 INFO L87 Difference]: Start difference. First operand 2776 states and 4151 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:51,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:51,989 INFO L93 Difference]: Finished difference Result 5471 states and 8221 transitions. [2025-03-08 05:59:51,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:51,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2025-03-08 05:59:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:52,005 INFO L225 Difference]: With dead ends: 5471 [2025-03-08 05:59:52,006 INFO L226 Difference]: Without dead ends: 3964 [2025-03-08 05:59:52,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:52,009 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 86 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:52,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:52,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-03-08 05:59:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3962. [2025-03-08 05:59:52,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3962 states, 3961 states have (on average 1.484726079272911) internal successors, (5881), 3961 states have internal predecessors, (5881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 5881 transitions. [2025-03-08 05:59:52,109 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 5881 transitions. Word has length 68 [2025-03-08 05:59:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:52,109 INFO L471 AbstractCegarLoop]: Abstraction has 3962 states and 5881 transitions. [2025-03-08 05:59:52,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 5881 transitions. [2025-03-08 05:59:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:59:52,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:52,114 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:52,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:59:52,115 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:52,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:52,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1194092312, now seen corresponding path program 1 times [2025-03-08 05:59:52,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:52,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408097288] [2025-03-08 05:59:52,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:52,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:52,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:59:52,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:59:52,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:52,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:52,296 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 05:59:52,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:52,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408097288] [2025-03-08 05:59:52,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408097288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:52,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:52,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:59:52,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118729336] [2025-03-08 05:59:52,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:52,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:59:52,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:52,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:59:52,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:59:52,297 INFO L87 Difference]: Start difference. First operand 3962 states and 5881 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:52,534 INFO L93 Difference]: Finished difference Result 13206 states and 19839 transitions. [2025-03-08 05:59:52,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:59:52,535 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 94 [2025-03-08 05:59:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:52,583 INFO L225 Difference]: With dead ends: 13206 [2025-03-08 05:59:52,583 INFO L226 Difference]: Without dead ends: 11220 [2025-03-08 05:59:52,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:59:52,586 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 892 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:52,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 1076 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:52,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11220 states. [2025-03-08 05:59:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11220 to 5898. [2025-03-08 05:59:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5898 states, 5897 states have (on average 1.4856706800067832) internal successors, (8761), 5897 states have internal predecessors, (8761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5898 states to 5898 states and 8761 transitions. [2025-03-08 05:59:52,742 INFO L78 Accepts]: Start accepts. Automaton has 5898 states and 8761 transitions. Word has length 94 [2025-03-08 05:59:52,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:52,742 INFO L471 AbstractCegarLoop]: Abstraction has 5898 states and 8761 transitions. [2025-03-08 05:59:52,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:52,743 INFO L276 IsEmpty]: Start isEmpty. Operand 5898 states and 8761 transitions. [2025-03-08 05:59:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:59:52,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:52,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:59:52,761 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:52,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:52,761 INFO L85 PathProgramCache]: Analyzing trace with hash 999770516, now seen corresponding path program 1 times [2025-03-08 05:59:52,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987399614] [2025-03-08 05:59:52,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:52,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:59:52,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:59:52,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:52,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:52,918 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 05:59:52,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:52,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987399614] [2025-03-08 05:59:52,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987399614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:52,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:52,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:59:52,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778795403] [2025-03-08 05:59:52,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:52,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:59:52,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:52,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:59:52,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:59:52,919 INFO L87 Difference]: Start difference. First operand 5898 states and 8761 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:53,213 INFO L93 Difference]: Finished difference Result 15142 states and 22719 transitions. [2025-03-08 05:59:53,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:59:53,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 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 94 [2025-03-08 05:59:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:53,260 INFO L225 Difference]: With dead ends: 15142 [2025-03-08 05:59:53,260 INFO L226 Difference]: Without dead ends: 13156 [2025-03-08 05:59:53,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:59:53,269 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 962 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:53,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 955 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:53,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13156 states. [2025-03-08 05:59:53,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13156 to 7834. [2025-03-08 05:59:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7834 states, 7833 states have (on average 1.486148346738159) internal successors, (11641), 7833 states have internal predecessors, (11641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:53,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7834 states to 7834 states and 11641 transitions. [2025-03-08 05:59:53,512 INFO L78 Accepts]: Start accepts. Automaton has 7834 states and 11641 transitions. Word has length 94 [2025-03-08 05:59:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:53,512 INFO L471 AbstractCegarLoop]: Abstraction has 7834 states and 11641 transitions. [2025-03-08 05:59:53,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 7834 states and 11641 transitions. [2025-03-08 05:59:53,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:59:53,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:53,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:53,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:59:53,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:53,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:53,516 INFO L85 PathProgramCache]: Analyzing trace with hash 415243077, now seen corresponding path program 1 times [2025-03-08 05:59:53,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:53,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113190169] [2025-03-08 05:59:53,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:53,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:53,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:59:53,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:59:53,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:53,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 05:59:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:53,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113190169] [2025-03-08 05:59:53,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113190169] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:53,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:53,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:59:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996885933] [2025-03-08 05:59:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:53,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:59:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:53,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:59:53,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:59:53,676 INFO L87 Difference]: Start difference. First operand 7834 states and 11641 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:53,899 INFO L93 Difference]: Finished difference Result 17078 states and 25599 transitions. [2025-03-08 05:59:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:59:53,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 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 94 [2025-03-08 05:59:53,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:53,924 INFO L225 Difference]: With dead ends: 17078 [2025-03-08 05:59:53,924 INFO L226 Difference]: Without dead ends: 15092 [2025-03-08 05:59:53,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:59:53,932 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 918 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:53,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 988 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:53,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15092 states. [2025-03-08 05:59:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15092 to 9770. [2025-03-08 05:59:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9770 states, 9769 states have (on average 1.4864366874808066) internal successors, (14521), 9769 states have internal predecessors, (14521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:54,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9770 states to 9770 states and 14521 transitions. [2025-03-08 05:59:54,160 INFO L78 Accepts]: Start accepts. Automaton has 9770 states and 14521 transitions. Word has length 94 [2025-03-08 05:59:54,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:54,161 INFO L471 AbstractCegarLoop]: Abstraction has 9770 states and 14521 transitions. [2025-03-08 05:59:54,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:54,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9770 states and 14521 transitions. [2025-03-08 05:59:54,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 05:59:54,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:54,165 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:54,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:59:54,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:54,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:54,166 INFO L85 PathProgramCache]: Analyzing trace with hash -743432813, now seen corresponding path program 1 times [2025-03-08 05:59:54,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:54,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545664042] [2025-03-08 05:59:54,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:54,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:54,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 05:59:54,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 05:59:54,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:54,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:54,300 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:59:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545664042] [2025-03-08 05:59:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545664042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:54,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:54,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:59:54,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479022390] [2025-03-08 05:59:54,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:54,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:59:54,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:54,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:59:54,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:59:54,302 INFO L87 Difference]: Start difference. First operand 9770 states and 14521 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:54,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:54,625 INFO L93 Difference]: Finished difference Result 19014 states and 28479 transitions. [2025-03-08 05:59:54,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:59:54,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 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 94 [2025-03-08 05:59:54,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:54,654 INFO L225 Difference]: With dead ends: 19014 [2025-03-08 05:59:54,655 INFO L226 Difference]: Without dead ends: 17028 [2025-03-08 05:59:54,663 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:59:54,663 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 823 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 823 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:54,663 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [823 Valid, 1085 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:59:54,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17028 states. [2025-03-08 05:59:54,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17028 to 11706. [2025-03-08 05:59:54,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11706 states, 11705 states have (on average 1.486629645450662) internal successors, (17401), 11705 states have internal predecessors, (17401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:54,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11706 states to 11706 states and 17401 transitions. [2025-03-08 05:59:54,938 INFO L78 Accepts]: Start accepts. Automaton has 11706 states and 17401 transitions. Word has length 94 [2025-03-08 05:59:54,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:54,938 INFO L471 AbstractCegarLoop]: Abstraction has 11706 states and 17401 transitions. [2025-03-08 05:59:54,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 7 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:54,938 INFO L276 IsEmpty]: Start isEmpty. Operand 11706 states and 17401 transitions. [2025-03-08 05:59:54,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:59:54,941 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:54,941 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:54,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:59:54,941 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:54,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:54,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1728776098, now seen corresponding path program 1 times [2025-03-08 05:59:54,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:54,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059188217] [2025-03-08 05:59:54,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:54,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:54,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:59:54,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:59:54,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:54,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:55,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059188217] [2025-03-08 05:59:55,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059188217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:55,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:55,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028966240] [2025-03-08 05:59:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:55,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:55,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:55,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:55,050 INFO L87 Difference]: Start difference. First operand 11706 states and 17401 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:55,156 INFO L93 Difference]: Finished difference Result 23374 states and 34763 transitions. [2025-03-08 05:59:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 05:59:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:55,176 INFO L225 Difference]: With dead ends: 23374 [2025-03-08 05:59:55,176 INFO L226 Difference]: Without dead ends: 11708 [2025-03-08 05:59:55,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:55,190 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 68 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:55,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 300 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11708 states. [2025-03-08 05:59:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11708 to 11706. [2025-03-08 05:59:55,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11706 states, 11705 states have (on average 1.4743272105937633) internal successors, (17257), 11705 states have internal predecessors, (17257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11706 states to 11706 states and 17257 transitions. [2025-03-08 05:59:55,390 INFO L78 Accepts]: Start accepts. Automaton has 11706 states and 17257 transitions. Word has length 95 [2025-03-08 05:59:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:55,390 INFO L471 AbstractCegarLoop]: Abstraction has 11706 states and 17257 transitions. [2025-03-08 05:59:55,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 11706 states and 17257 transitions. [2025-03-08 05:59:55,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:59:55,393 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:55,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:55,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:59:55,394 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:55,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:55,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1429138485, now seen corresponding path program 1 times [2025-03-08 05:59:55,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:55,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199122970] [2025-03-08 05:59:55,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:55,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:55,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:59:55,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:59:55,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:55,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:55,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199122970] [2025-03-08 05:59:55,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199122970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:59:55,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:59:55,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:59:55,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642638514] [2025-03-08 05:59:55,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:59:55,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:59:55,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:55,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:59:55,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:55,542 INFO L87 Difference]: Start difference. First operand 11706 states and 17257 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:55,628 INFO L93 Difference]: Finished difference Result 17542 states and 25867 transitions. [2025-03-08 05:59:55,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:59:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 05:59:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:55,641 INFO L225 Difference]: With dead ends: 17542 [2025-03-08 05:59:55,642 INFO L226 Difference]: Without dead ends: 5876 [2025-03-08 05:59:55,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:59:55,657 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 62 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:55,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:59:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5876 states. [2025-03-08 05:59:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5876 to 5874. [2025-03-08 05:59:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5874 states, 5873 states have (on average 1.4604120551677167) internal successors, (8577), 5873 states have internal predecessors, (8577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5874 states to 5874 states and 8577 transitions. [2025-03-08 05:59:55,747 INFO L78 Accepts]: Start accepts. Automaton has 5874 states and 8577 transitions. Word has length 95 [2025-03-08 05:59:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 5874 states and 8577 transitions. [2025-03-08 05:59:55,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 5874 states and 8577 transitions. [2025-03-08 05:59:55,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:59:55,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:55,749 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:55,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:59:55,750 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:55,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:55,750 INFO L85 PathProgramCache]: Analyzing trace with hash 810160712, now seen corresponding path program 1 times [2025-03-08 05:59:55,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:55,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926530935] [2025-03-08 05:59:55,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:55,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:55,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:59:55,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:59:55,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:55,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:56,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:59:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926530935] [2025-03-08 05:59:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926530935] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:59:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880416967] [2025-03-08 05:59:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:59:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:59:56,792 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:59:56,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:59:56,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:59:56,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:59:56,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:56,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:59:56,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 05:59:56,911 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:59:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:57,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:59:58,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 05:59:58,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880416967] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:59:58,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:59:58,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-03-08 05:59:58,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357608150] [2025-03-08 05:59:58,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:59:58,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 05:59:58,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:59:58,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 05:59:58,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=552, Unknown=0, NotChecked=0, Total=650 [2025-03-08 05:59:58,295 INFO L87 Difference]: Start difference. First operand 5874 states and 8577 transitions. Second operand has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:59:59,463 INFO L93 Difference]: Finished difference Result 25608 states and 37868 transitions. [2025-03-08 05:59:59,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 05:59:59,464 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 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 95 [2025-03-08 05:59:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:59:59,493 INFO L225 Difference]: With dead ends: 25608 [2025-03-08 05:59:59,493 INFO L226 Difference]: Without dead ends: 19774 [2025-03-08 05:59:59,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=416, Invalid=1390, Unknown=0, NotChecked=0, Total=1806 [2025-03-08 05:59:59,504 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 2650 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 05:59:59,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 1655 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 05:59:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19774 states. [2025-03-08 05:59:59,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19774 to 12534. [2025-03-08 05:59:59,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12534 states, 12533 states have (on average 1.4557568020426075) internal successors, (18245), 12533 states have internal predecessors, (18245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:59,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12534 states to 12534 states and 18245 transitions. [2025-03-08 05:59:59,712 INFO L78 Accepts]: Start accepts. Automaton has 12534 states and 18245 transitions. Word has length 95 [2025-03-08 05:59:59,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:59:59,712 INFO L471 AbstractCegarLoop]: Abstraction has 12534 states and 18245 transitions. [2025-03-08 05:59:59,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 9.153846153846153) internal successors, (238), 25 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 05:59:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 12534 states and 18245 transitions. [2025-03-08 05:59:59,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-08 05:59:59,714 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:59:59,714 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:59:59,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:59:59,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 05:59:59,915 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:59:59,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:59:59,916 INFO L85 PathProgramCache]: Analyzing trace with hash -16879435, now seen corresponding path program 1 times [2025-03-08 05:59:59,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:59:59,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552983290] [2025-03-08 05:59:59,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:59:59,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:59:59,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-08 05:59:59,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-08 05:59:59,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:59:59,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:00,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:00,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552983290] [2025-03-08 06:00:00,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552983290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:00,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:00,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:00,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273154506] [2025-03-08 06:00:00,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:00,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:00,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:00,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:00,014 INFO L87 Difference]: Start difference. First operand 12534 states and 18245 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:00,085 INFO L93 Difference]: Finished difference Result 18736 states and 27253 transitions. [2025-03-08 06:00:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:00,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-08 06:00:00,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:00,095 INFO L225 Difference]: With dead ends: 18736 [2025-03-08 06:00:00,095 INFO L226 Difference]: Without dead ends: 6242 [2025-03-08 06:00:00,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:00,104 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 48 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:00,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 274 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:00,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2025-03-08 06:00:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 6096. [2025-03-08 06:00:00,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6096 states, 6095 states have (on average 1.4351107465135358) internal successors, (8747), 6095 states have internal predecessors, (8747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:00,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 8747 transitions. [2025-03-08 06:00:00,235 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 8747 transitions. Word has length 95 [2025-03-08 06:00:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 6096 states and 8747 transitions. [2025-03-08 06:00:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 8747 transitions. [2025-03-08 06:00:00,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:00:00,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:00,238 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:00,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:00:00,238 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:00,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:00,239 INFO L85 PathProgramCache]: Analyzing trace with hash 192831607, now seen corresponding path program 1 times [2025-03-08 06:00:00,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:00,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050253208] [2025-03-08 06:00:00,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:00,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:00:00,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:00:00,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:00,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:00,292 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:00,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:00,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050253208] [2025-03-08 06:00:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050253208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:00,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052033900] [2025-03-08 06:00:00,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:00,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:00,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:00,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:00,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:00,294 INFO L87 Difference]: Start difference. First operand 6096 states and 8747 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:00,395 INFO L93 Difference]: Finished difference Result 17018 states and 24347 transitions. [2025-03-08 06:00:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-03-08 06:00:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:00,415 INFO L225 Difference]: With dead ends: 17018 [2025-03-08 06:00:00,415 INFO L226 Difference]: Without dead ends: 10962 [2025-03-08 06:00:00,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:00,425 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 67 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:00,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 275 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10962 states. [2025-03-08 06:00:00,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10962 to 10960. [2025-03-08 06:00:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10960 states, 10959 states have (on average 1.4139063783191896) internal successors, (15495), 10959 states have internal predecessors, (15495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:00,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10960 states to 10960 states and 15495 transitions. [2025-03-08 06:00:00,586 INFO L78 Accepts]: Start accepts. Automaton has 10960 states and 15495 transitions. Word has length 96 [2025-03-08 06:00:00,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:00,586 INFO L471 AbstractCegarLoop]: Abstraction has 10960 states and 15495 transitions. [2025-03-08 06:00:00,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:00,586 INFO L276 IsEmpty]: Start isEmpty. Operand 10960 states and 15495 transitions. [2025-03-08 06:00:00,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:00:00,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:00,589 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:00,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:00:00,589 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:00,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1533956403, now seen corresponding path program 1 times [2025-03-08 06:00:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:00,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759139640] [2025-03-08 06:00:00,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:00,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:00:00,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:00:00,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:00,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:01,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759139640] [2025-03-08 06:00:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759139640] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:00:01,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602834986] [2025-03-08 06:00:01,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:01,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:00:01,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:00:01,156 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:00:01,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:00:01,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:00:01,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:00:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:01,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-08 06:00:01,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:00:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:01,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:00:02,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:02,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602834986] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:00:02,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:00:02,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 9] total 25 [2025-03-08 06:00:02,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029646159] [2025-03-08 06:00:02,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:00:02,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-08 06:00:02,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:02,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-08 06:00:02,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2025-03-08 06:00:02,172 INFO L87 Difference]: Start difference. First operand 10960 states and 15495 transitions. Second operand has 25 states, 25 states have (on average 11.24) internal successors, (281), 25 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:11,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:11,917 INFO L93 Difference]: Finished difference Result 137210 states and 192204 transitions. [2025-03-08 06:00:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2025-03-08 06:00:11,918 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 11.24) internal successors, (281), 25 states have internal predecessors, (281), 0 states have call successors, (0), 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 96 [2025-03-08 06:00:11,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:12,159 INFO L225 Difference]: With dead ends: 137210 [2025-03-08 06:00:12,160 INFO L226 Difference]: Without dead ends: 128746 [2025-03-08 06:00:12,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19173 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=5462, Invalid=41410, Unknown=0, NotChecked=0, Total=46872 [2025-03-08 06:00:12,208 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 7534 mSDsluCounter, 2209 mSDsCounter, 0 mSdLazyCounter, 2533 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7534 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:12,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7534 Valid, 2368 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2533 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 06:00:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128746 states. [2025-03-08 06:00:14,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128746 to 113206. [2025-03-08 06:00:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113206 states, 113205 states have (on average 1.3804690605538625) internal successors, (156276), 113205 states have internal predecessors, (156276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113206 states to 113206 states and 156276 transitions. [2025-03-08 06:00:14,948 INFO L78 Accepts]: Start accepts. Automaton has 113206 states and 156276 transitions. Word has length 96 [2025-03-08 06:00:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:14,948 INFO L471 AbstractCegarLoop]: Abstraction has 113206 states and 156276 transitions. [2025-03-08 06:00:14,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 11.24) internal successors, (281), 25 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 113206 states and 156276 transitions. [2025-03-08 06:00:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:00:14,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:14,952 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:14,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 06:00:15,153 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,SelfDestructingSolverStorable19 [2025-03-08 06:00:15,154 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:15,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:15,154 INFO L85 PathProgramCache]: Analyzing trace with hash -616060130, now seen corresponding path program 1 times [2025-03-08 06:00:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028712550] [2025-03-08 06:00:15,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:15,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:15,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:00:15,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:00:15,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:15,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:15,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:15,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028712550] [2025-03-08 06:00:15,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028712550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:15,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:15,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:15,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107732393] [2025-03-08 06:00:15,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:15,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:15,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:15,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:15,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:15,268 INFO L87 Difference]: Start difference. First operand 113206 states and 156276 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:16,830 INFO L93 Difference]: Finished difference Result 169062 states and 232116 transitions. [2025-03-08 06:00:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:16,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:00:16,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:16,962 INFO L225 Difference]: With dead ends: 169062 [2025-03-08 06:00:16,962 INFO L226 Difference]: Without dead ends: 55896 [2025-03-08 06:00:17,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:17,037 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 40 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:17,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 258 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55896 states. [2025-03-08 06:00:18,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55896 to 51406. [2025-03-08 06:00:18,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51406 states, 51405 states have (on average 1.3475537399085693) internal successors, (69271), 51405 states have internal predecessors, (69271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51406 states to 51406 states and 69271 transitions. [2025-03-08 06:00:18,534 INFO L78 Accepts]: Start accepts. Automaton has 51406 states and 69271 transitions. Word has length 97 [2025-03-08 06:00:18,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:18,535 INFO L471 AbstractCegarLoop]: Abstraction has 51406 states and 69271 transitions. [2025-03-08 06:00:18,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 51406 states and 69271 transitions. [2025-03-08 06:00:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 06:00:18,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:18,538 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:18,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:00:18,538 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:18,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:18,539 INFO L85 PathProgramCache]: Analyzing trace with hash 760153473, now seen corresponding path program 1 times [2025-03-08 06:00:18,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:18,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370536146] [2025-03-08 06:00:18,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:18,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:18,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 06:00:18,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 06:00:18,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:18,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:18,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:18,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370536146] [2025-03-08 06:00:18,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370536146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:18,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:18,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:00:18,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542098295] [2025-03-08 06:00:18,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:18,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:00:18,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:18,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:00:18,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:18,589 INFO L87 Difference]: Start difference. First operand 51406 states and 69271 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:20,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:20,201 INFO L93 Difference]: Finished difference Result 139462 states and 187360 transitions. [2025-03-08 06:00:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:00:20,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 06:00:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:20,322 INFO L225 Difference]: With dead ends: 139462 [2025-03-08 06:00:20,323 INFO L226 Difference]: Without dead ends: 89081 [2025-03-08 06:00:20,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:00:20,354 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 63 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:20,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 328 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:20,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89081 states. [2025-03-08 06:00:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89081 to 88951. [2025-03-08 06:00:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88951 states, 88950 states have (on average 1.3310961214165262) internal successors, (118401), 88950 states have internal predecessors, (118401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88951 states to 88951 states and 118401 transitions. [2025-03-08 06:00:22,606 INFO L78 Accepts]: Start accepts. Automaton has 88951 states and 118401 transitions. Word has length 97 [2025-03-08 06:00:22,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:22,607 INFO L471 AbstractCegarLoop]: Abstraction has 88951 states and 118401 transitions. [2025-03-08 06:00:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 88951 states and 118401 transitions. [2025-03-08 06:00:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:00:22,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:22,611 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:22,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:00:22,611 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:22,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:22,611 INFO L85 PathProgramCache]: Analyzing trace with hash 310699378, now seen corresponding path program 1 times [2025-03-08 06:00:22,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:22,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227046008] [2025-03-08 06:00:22,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:22,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:00:22,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:00:22,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:22,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:00:22,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:22,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227046008] [2025-03-08 06:00:22,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227046008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:00:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:00:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 06:00:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804803228] [2025-03-08 06:00:22,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:00:22,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 06:00:22,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:22,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 06:00:22,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 06:00:22,702 INFO L87 Difference]: Start difference. First operand 88951 states and 118401 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:25,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:25,374 INFO L93 Difference]: Finished difference Result 158686 states and 212815 transitions. [2025-03-08 06:00:25,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 06:00:25,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 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-08 06:00:25,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:25,554 INFO L225 Difference]: With dead ends: 158686 [2025-03-08 06:00:25,554 INFO L226 Difference]: Without dead ends: 143004 [2025-03-08 06:00:25,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-08 06:00:25,595 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 938 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:25,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1171 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:00:25,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143004 states. [2025-03-08 06:00:28,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143004 to 104030. [2025-03-08 06:00:28,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104030 states, 104029 states have (on average 1.33119610877736) internal successors, (138483), 104029 states have internal predecessors, (138483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:28,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104030 states to 104030 states and 138483 transitions. [2025-03-08 06:00:28,512 INFO L78 Accepts]: Start accepts. Automaton has 104030 states and 138483 transitions. Word has length 98 [2025-03-08 06:00:28,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:00:28,513 INFO L471 AbstractCegarLoop]: Abstraction has 104030 states and 138483 transitions. [2025-03-08 06:00:28,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 104030 states and 138483 transitions. [2025-03-08 06:00:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-08 06:00:28,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:00:28,521 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:00:28,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:00:28,521 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:00:28,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:00:28,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1323335756, now seen corresponding path program 1 times [2025-03-08 06:00:28,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:00:28,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270736303] [2025-03-08 06:00:28,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:28,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:00:28,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:00:28,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:00:28,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:28,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:28,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:00:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270736303] [2025-03-08 06:00:28,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270736303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:00:28,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390369145] [2025-03-08 06:00:28,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:00:28,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:00:28,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:00:28,790 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:00:28,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:00:28,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-08 06:00:28,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-08 06:00:28,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:00:28,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:00:28,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 06:00:28,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:00:29,547 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:29,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:00:30,285 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:00:30,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390369145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:00:30,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:00:30,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 30 [2025-03-08 06:00:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117276662] [2025-03-08 06:00:30,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:00:30,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-08 06:00:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:00:30,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-08 06:00:30,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2025-03-08 06:00:30,287 INFO L87 Difference]: Start difference. First operand 104030 states and 138483 transitions. Second operand has 30 states, 30 states have (on average 8.733333333333333) internal successors, (262), 30 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:00:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:00:36,931 INFO L93 Difference]: Finished difference Result 354390 states and 477778 transitions. [2025-03-08 06:00:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-08 06:00:36,931 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 8.733333333333333) internal successors, (262), 30 states have internal predecessors, (262), 0 states have call successors, (0), 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 99 [2025-03-08 06:00:36,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:00:37,333 INFO L225 Difference]: With dead ends: 354390 [2025-03-08 06:00:37,333 INFO L226 Difference]: Without dead ends: 254912 [2025-03-08 06:00:37,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3417 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2247, Invalid=9095, Unknown=0, NotChecked=0, Total=11342 [2025-03-08 06:00:37,432 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 7896 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7896 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 06:00:37,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7896 Valid, 2249 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 06:00:37,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254912 states. [2025-03-08 06:00:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254912 to 167188. [2025-03-08 06:00:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167188 states, 167187 states have (on average 1.3329445471238792) internal successors, (222851), 167187 states have internal predecessors, (222851), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)