./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.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.6.ufo.BOUNDED-12.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 65159196aa732cf84d788dcb31500c216d665703806e14a7c6f7047ab62d591b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:02:31,966 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:02:32,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:02:32,027 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:02:32,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:02:32,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:02:32,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:02:32,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:02:32,042 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:02:32,042 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:02:32,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:02:32,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:02:32,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:02:32,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:02:32,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:02:32,044 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:02:32,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:02:32,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:02:32,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:02:32,045 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 -> 65159196aa732cf84d788dcb31500c216d665703806e14a7c6f7047ab62d591b [2025-03-08 06:02:32,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:02:32,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:02:32,266 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:02:32,267 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:02:32,267 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:02:32,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2025-03-08 06:02:33,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c816cfbe7/41f68eef5d3646cf94c6925f08ffeca9/FLAGa2e9480e0 [2025-03-08 06:02:33,671 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:02:33,671 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.ufo.BOUNDED-12.pals.c [2025-03-08 06:02:33,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c816cfbe7/41f68eef5d3646cf94c6925f08ffeca9/FLAGa2e9480e0 [2025-03-08 06:02:33,694 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c816cfbe7/41f68eef5d3646cf94c6925f08ffeca9 [2025-03-08 06:02:33,696 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:02:33,699 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:02:33,700 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:02:33,700 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:02:33,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:02:33,704 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:02:33" (1/1) ... [2025-03-08 06:02:33,707 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432374a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:33, skipping insertion in model container [2025-03-08 06:02:33,707 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:02:33" (1/1) ... [2025-03-08 06:02:33,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:02:33,956 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.6.ufo.BOUNDED-12.pals.c[15075,15088] [2025-03-08 06:02:33,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:02:33,975 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:02:34,013 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.6.ufo.BOUNDED-12.pals.c[15075,15088] [2025-03-08 06:02:34,014 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:02:34,026 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:02:34,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34 WrapperNode [2025-03-08 06:02:34,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:02:34,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:02:34,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:02:34,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:02:34,034 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,041 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,062 INFO L138 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 395 [2025-03-08 06:02:34,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:02:34,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:02:34,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:02:34,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:02:34,074 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,076 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,087 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 06:02:34,088 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,088 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,093 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,095 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,096 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,099 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:02:34,099 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:02:34,099 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:02:34,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:02:34,100 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (1/1) ... [2025-03-08 06:02:34,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:02:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:02:34,131 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 06:02:34,138 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 06:02:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:02:34,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:02:34,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:02:34,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:02:34,236 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:02:34,237 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:02:34,603 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-08 06:02:34,604 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:02:34,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:02:34,612 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:02:34,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:02:34 BoogieIcfgContainer [2025-03-08 06:02:34,613 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:02:34,615 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:02:34,615 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:02:34,619 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:02:34,619 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:02:33" (1/3) ... [2025-03-08 06:02:34,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdaac3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:02:34, skipping insertion in model container [2025-03-08 06:02:34,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:02:34" (2/3) ... [2025-03-08 06:02:34,620 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bdaac3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:02:34, skipping insertion in model container [2025-03-08 06:02:34,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:02:34" (3/3) ... [2025-03-08 06:02:34,621 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c [2025-03-08 06:02:34,633 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:02:34,634 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.6.ufo.BOUNDED-12.pals.c that has 1 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 06:02:34,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:02:34,683 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;@7043441a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:02:34,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 06:02:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 95 states have (on average 1.768421052631579) internal successors, (168), 96 states have internal predecessors, (168), 0 states have call successors, (0), 0 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:02:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 06:02:34,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:34,692 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] [2025-03-08 06:02:34,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:34,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1909763777, now seen corresponding path program 1 times [2025-03-08 06:02:34,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:34,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520233543] [2025-03-08 06:02:34,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:34,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:34,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 06:02:34,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 06:02:34,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:34,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:34,910 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 06:02:34,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:34,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520233543] [2025-03-08 06:02:34,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520233543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:34,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 06:02:34,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007723269] [2025-03-08 06:02:34,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:34,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 06:02:34,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:34,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 06:02:34,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 06:02:34,936 INFO L87 Difference]: Start difference. First operand has 97 states, 95 states have (on average 1.768421052631579) internal successors, (168), 96 states have internal predecessors, (168), 0 states have call successors, (0), 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 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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:02:34,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:34,950 INFO L93 Difference]: Finished difference Result 149 states and 250 transitions. [2025-03-08 06:02:34,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 06:02:34,952 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-08 06:02:34,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:34,958 INFO L225 Difference]: With dead ends: 149 [2025-03-08 06:02:34,958 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 06:02:34,960 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 06:02:34,962 INFO L435 NwaCegarLoop]: 166 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, 166 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 06:02:34,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 06:02:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 06:02:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7526881720430108) internal successors, (163), 93 states have internal predecessors, (163), 0 states have call successors, (0), 0 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:02:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 163 transitions. [2025-03-08 06:02:34,989 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 163 transitions. Word has length 25 [2025-03-08 06:02:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:34,989 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 163 transitions. [2025-03-08 06:02:34,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 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:02:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 163 transitions. [2025-03-08 06:02:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 06:02:34,990 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:34,990 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] [2025-03-08 06:02:34,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:02:34,991 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:34,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:34,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1976379294, now seen corresponding path program 1 times [2025-03-08 06:02:34,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:34,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627891787] [2025-03-08 06:02:34,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:34,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:35,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 06:02:35,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 06:02:35,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:35,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:35,208 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 06:02:35,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:35,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627891787] [2025-03-08 06:02:35,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627891787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:35,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:02:35,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133233722] [2025-03-08 06:02:35,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:35,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:02:35,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:35,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:02:35,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:02:35,211 INFO L87 Difference]: Start difference. First operand 94 states and 163 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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:02:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:35,300 INFO L93 Difference]: Finished difference Result 146 states and 244 transitions. [2025-03-08 06:02:35,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:02:35,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-03-08 06:02:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:35,301 INFO L225 Difference]: With dead ends: 146 [2025-03-08 06:02:35,301 INFO L226 Difference]: Without dead ends: 94 [2025-03-08 06:02:35,301 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 06:02:35,302 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:35,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 599 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:35,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-03-08 06:02:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-03-08 06:02:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 93 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:02:35,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 123 transitions. [2025-03-08 06:02:35,313 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 123 transitions. Word has length 25 [2025-03-08 06:02:35,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:35,313 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 123 transitions. [2025-03-08 06:02:35,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 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:02:35,313 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2025-03-08 06:02:35,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 06:02:35,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:35,314 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 06:02:35,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:02:35,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:35,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1401550392, now seen corresponding path program 1 times [2025-03-08 06:02:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712589863] [2025-03-08 06:02:35,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:35,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 06:02:35,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 06:02:35,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:35,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:35,585 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 06:02:35,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:35,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712589863] [2025-03-08 06:02:35,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712589863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:35,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:35,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:35,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153237256] [2025-03-08 06:02:35,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:35,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:35,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:35,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:35,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:35,588 INFO L87 Difference]: Start difference. First operand 94 states and 123 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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 06:02:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:35,952 INFO L93 Difference]: Finished difference Result 670 states and 1047 transitions. [2025-03-08 06:02:35,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:02:35,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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 06:02:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:35,956 INFO L225 Difference]: With dead ends: 670 [2025-03-08 06:02:35,958 INFO L226 Difference]: Without dead ends: 622 [2025-03-08 06:02:35,958 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2025-03-08 06:02:35,960 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 1001 mSDsluCounter, 2432 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1001 SdHoareTripleChecker+Valid, 2551 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:35,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1001 Valid, 2551 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:02:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2025-03-08 06:02:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 140. [2025-03-08 06:02:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.4172661870503598) internal successors, (197), 139 states have internal predecessors, (197), 0 states have call successors, (0), 0 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:02:35,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 197 transitions. [2025-03-08 06:02:35,980 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 197 transitions. Word has length 64 [2025-03-08 06:02:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:35,982 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 197 transitions. [2025-03-08 06:02:35,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 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 06:02:35,982 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2025-03-08 06:02:35,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:02:35,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:35,983 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 06:02:35,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:02:35,984 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:35,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1444809853, now seen corresponding path program 1 times [2025-03-08 06:02:35,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:35,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477455407] [2025-03-08 06:02:35,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:35,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:36,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:02:36,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:02:36,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:36,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:36,097 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 06:02:36,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:36,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477455407] [2025-03-08 06:02:36,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477455407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:36,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:36,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:36,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089007966] [2025-03-08 06:02:36,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:36,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:36,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:36,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:36,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:36,100 INFO L87 Difference]: Start difference. First operand 140 states and 197 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 06:02:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:36,124 INFO L93 Difference]: Finished difference Result 317 states and 480 transitions. [2025-03-08 06:02:36,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:36,124 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 06:02:36,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:36,125 INFO L225 Difference]: With dead ends: 317 [2025-03-08 06:02:36,125 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 06:02:36,126 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:02:36,126 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 51 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 193 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 06:02:36,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 193 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 06:02:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-03-08 06:02:36,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4772727272727273) internal successors, (325), 220 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:02:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 325 transitions. [2025-03-08 06:02:36,140 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 325 transitions. Word has length 66 [2025-03-08 06:02:36,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:36,141 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 325 transitions. [2025-03-08 06:02:36,141 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 06:02:36,141 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 325 transitions. [2025-03-08 06:02:36,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-08 06:02:36,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:36,142 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 06:02:36,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:02:36,142 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:36,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1412486618, now seen corresponding path program 1 times [2025-03-08 06:02:36,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:36,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104683641] [2025-03-08 06:02:36,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:36,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:36,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-08 06:02:36,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-08 06:02:36,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:36,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:36,486 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 06:02:36,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:36,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104683641] [2025-03-08 06:02:36,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104683641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:36,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:36,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:36,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122147245] [2025-03-08 06:02:36,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:36,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:36,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:36,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:36,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:36,488 INFO L87 Difference]: Start difference. First operand 221 states and 325 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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 06:02:36,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:36,696 INFO L93 Difference]: Finished difference Result 398 states and 605 transitions. [2025-03-08 06:02:36,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:02:36,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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 06:02:36,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:36,697 INFO L225 Difference]: With dead ends: 398 [2025-03-08 06:02:36,697 INFO L226 Difference]: Without dead ends: 223 [2025-03-08 06:02:36,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2025-03-08 06:02:36,698 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 146 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:36,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 483 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-08 06:02:36,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2025-03-08 06:02:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 220 states have (on average 1.4681818181818183) internal successors, (323), 220 states have internal predecessors, (323), 0 states have call successors, (0), 0 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:02:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 323 transitions. [2025-03-08 06:02:36,706 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 323 transitions. Word has length 66 [2025-03-08 06:02:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:36,707 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 323 transitions. [2025-03-08 06:02:36,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 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 06:02:36,707 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 323 transitions. [2025-03-08 06:02:36,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-03-08 06:02:36,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:36,708 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 06:02:36,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:02:36,708 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:36,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:36,709 INFO L85 PathProgramCache]: Analyzing trace with hash -806874465, now seen corresponding path program 1 times [2025-03-08 06:02:36,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:36,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613220947] [2025-03-08 06:02:36,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:36,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:36,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 06:02:36,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 06:02:36,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:36,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:36,901 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 06:02:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613220947] [2025-03-08 06:02:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613220947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:36,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:36,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:02:36,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37065446] [2025-03-08 06:02:36,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:36,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:02:36,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:36,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:02:36,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:02:36,904 INFO L87 Difference]: Start difference. First operand 221 states and 323 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 06:02:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:36,925 INFO L93 Difference]: Finished difference Result 229 states and 332 transitions. [2025-03-08 06:02:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 06:02:36,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 06:02:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:36,926 INFO L225 Difference]: With dead ends: 229 [2025-03-08 06:02:36,926 INFO L226 Difference]: Without dead ends: 227 [2025-03-08 06:02:36,927 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 06:02:36,927 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:36,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 471 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-08 06:02:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2025-03-08 06:02:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4513274336283186) internal successors, (328), 226 states have internal predecessors, (328), 0 states have call successors, (0), 0 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:02:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 328 transitions. [2025-03-08 06:02:36,939 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 328 transitions. Word has length 67 [2025-03-08 06:02:36,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:36,939 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 328 transitions. [2025-03-08 06:02:36,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 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 06:02:36,939 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 328 transitions. [2025-03-08 06:02:36,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:02:36,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:36,945 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 06:02:36,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:02:36,945 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:36,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:36,945 INFO L85 PathProgramCache]: Analyzing trace with hash 296509988, now seen corresponding path program 1 times [2025-03-08 06:02:36,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:36,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890890127] [2025-03-08 06:02:36,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:36,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:36,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:02:36,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:02:36,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:36,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:37,004 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 06:02:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890890127] [2025-03-08 06:02:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890890127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108288613] [2025-03-08 06:02:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:37,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:37,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:37,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:37,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:37,007 INFO L87 Difference]: Start difference. First operand 227 states and 328 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 06:02:37,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:37,026 INFO L93 Difference]: Finished difference Result 421 states and 629 transitions. [2025-03-08 06:02:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:37,027 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 06:02:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:37,028 INFO L225 Difference]: With dead ends: 421 [2025-03-08 06:02:37,029 INFO L226 Difference]: Without dead ends: 321 [2025-03-08 06:02:37,029 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:02:37,030 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:37,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 263 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:37,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-08 06:02:37,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2025-03-08 06:02:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 318 states have (on average 1.4748427672955975) internal successors, (469), 318 states have internal predecessors, (469), 0 states have call successors, (0), 0 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:02:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 469 transitions. [2025-03-08 06:02:37,041 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 469 transitions. Word has length 68 [2025-03-08 06:02:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:37,043 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 469 transitions. [2025-03-08 06:02:37,043 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 06:02:37,043 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 469 transitions. [2025-03-08 06:02:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:02:37,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:37,044 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 06:02:37,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:02:37,044 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:37,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:37,044 INFO L85 PathProgramCache]: Analyzing trace with hash 142141156, now seen corresponding path program 1 times [2025-03-08 06:02:37,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:37,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278135520] [2025-03-08 06:02:37,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:37,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:37,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:02:37,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:02:37,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:37,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:37,112 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 06:02:37,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:37,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278135520] [2025-03-08 06:02:37,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278135520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:37,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:37,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:37,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077464588] [2025-03-08 06:02:37,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:37,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:37,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:37,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:37,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:37,114 INFO L87 Difference]: Start difference. First operand 319 states and 469 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 06:02:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:37,135 INFO L93 Difference]: Finished difference Result 837 states and 1269 transitions. [2025-03-08 06:02:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:37,136 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 06:02:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:37,138 INFO L225 Difference]: With dead ends: 837 [2025-03-08 06:02:37,138 INFO L226 Difference]: Without dead ends: 566 [2025-03-08 06:02:37,139 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:02:37,139 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 65 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:37,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 269 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-08 06:02:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2025-03-08 06:02:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 563 states have (on average 1.4937833037300177) internal successors, (841), 563 states have internal predecessors, (841), 0 states have call successors, (0), 0 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:02:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 841 transitions. [2025-03-08 06:02:37,156 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 841 transitions. Word has length 68 [2025-03-08 06:02:37,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:37,157 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 841 transitions. [2025-03-08 06:02:37,157 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 06:02:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 841 transitions. [2025-03-08 06:02:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:02:37,157 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:37,157 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 06:02:37,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:02:37,158 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:37,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:37,158 INFO L85 PathProgramCache]: Analyzing trace with hash -836789340, now seen corresponding path program 1 times [2025-03-08 06:02:37,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:37,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461883440] [2025-03-08 06:02:37,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:37,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:02:37,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:02:37,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:37,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:37,225 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 06:02:37,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:37,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461883440] [2025-03-08 06:02:37,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461883440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:37,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:37,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:37,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093407932] [2025-03-08 06:02:37,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:37,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:37,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:37,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:37,228 INFO L87 Difference]: Start difference. First operand 564 states and 841 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 06:02:37,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:37,249 INFO L93 Difference]: Finished difference Result 1548 states and 2343 transitions. [2025-03-08 06:02:37,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:37,250 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 06:02:37,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:37,254 INFO L225 Difference]: With dead ends: 1548 [2025-03-08 06:02:37,254 INFO L226 Difference]: Without dead ends: 1032 [2025-03-08 06:02:37,255 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:02:37,257 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 63 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:37,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 271 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:37,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-08 06:02:37,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1030. [2025-03-08 06:02:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4936831875607386) internal successors, (1537), 1029 states have internal predecessors, (1537), 0 states have call successors, (0), 0 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:02:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1537 transitions. [2025-03-08 06:02:37,293 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1537 transitions. Word has length 68 [2025-03-08 06:02:37,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:37,293 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1537 transitions. [2025-03-08 06:02:37,293 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 06:02:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1537 transitions. [2025-03-08 06:02:37,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:02:37,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:37,293 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 06:02:37,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:02:37,293 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:37,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:37,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1284734876, now seen corresponding path program 1 times [2025-03-08 06:02:37,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431993586] [2025-03-08 06:02:37,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:37,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:02:37,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:02:37,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:37,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:37,345 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 06:02:37,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:37,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431993586] [2025-03-08 06:02:37,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431993586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:37,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:37,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:37,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415010888] [2025-03-08 06:02:37,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:37,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:37,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:37,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:37,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:37,346 INFO L87 Difference]: Start difference. First operand 1030 states and 1537 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 06:02:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:37,381 INFO L93 Difference]: Finished difference Result 2898 states and 4347 transitions. [2025-03-08 06:02:37,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:37,383 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 06:02:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:37,389 INFO L225 Difference]: With dead ends: 2898 [2025-03-08 06:02:37,389 INFO L226 Difference]: Without dead ends: 1916 [2025-03-08 06:02:37,390 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:02:37,390 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:37,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 273 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-08 06:02:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1914. [2025-03-08 06:02:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.480920020909566) internal successors, (2833), 1913 states have internal predecessors, (2833), 0 states have call successors, (0), 0 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:02:37,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2833 transitions. [2025-03-08 06:02:37,452 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2833 transitions. Word has length 68 [2025-03-08 06:02:37,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:37,452 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2833 transitions. [2025-03-08 06:02:37,452 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 06:02:37,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2833 transitions. [2025-03-08 06:02:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:02:37,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:37,452 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 06:02:37,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:02:37,453 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:37,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:37,453 INFO L85 PathProgramCache]: Analyzing trace with hash -869559004, now seen corresponding path program 1 times [2025-03-08 06:02:37,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:37,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676787964] [2025-03-08 06:02:37,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:37,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:37,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:02:37,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:02:37,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:37,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:37,495 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 06:02:37,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:37,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676787964] [2025-03-08 06:02:37,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676787964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:37,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:37,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:37,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748025113] [2025-03-08 06:02:37,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:37,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:37,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:37,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:37,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:37,497 INFO L87 Difference]: Start difference. First operand 1914 states and 2833 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 06:02:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:37,549 INFO L93 Difference]: Finished difference Result 5454 states and 8067 transitions. [2025-03-08 06:02:37,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:37,549 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 06:02:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:37,560 INFO L225 Difference]: With dead ends: 5454 [2025-03-08 06:02:37,560 INFO L226 Difference]: Without dead ends: 3588 [2025-03-08 06:02:37,563 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:02:37,564 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 59 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:37,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 275 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:37,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3588 states. [2025-03-08 06:02:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3588 to 3586. [2025-03-08 06:02:37,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 3585 states have (on average 1.4596931659693166) internal successors, (5233), 3585 states have internal predecessors, (5233), 0 states have call successors, (0), 0 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:02:37,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 5233 transitions. [2025-03-08 06:02:37,673 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 5233 transitions. Word has length 68 [2025-03-08 06:02:37,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:37,674 INFO L471 AbstractCegarLoop]: Abstraction has 3586 states and 5233 transitions. [2025-03-08 06:02:37,674 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 06:02:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 5233 transitions. [2025-03-08 06:02:37,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-08 06:02:37,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:37,676 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 06:02:37,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:02:37,677 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:37,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1356277276, now seen corresponding path program 1 times [2025-03-08 06:02:37,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:37,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092898641] [2025-03-08 06:02:37,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:37,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:37,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-08 06:02:37,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-08 06:02:37,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:37,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:37,732 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 06:02:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092898641] [2025-03-08 06:02:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092898641] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:37,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:37,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:37,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286554401] [2025-03-08 06:02:37,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:37,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:37,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:37,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:37,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:37,735 INFO L87 Difference]: Start difference. First operand 3586 states and 5233 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 06:02:37,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:37,834 INFO L93 Difference]: Finished difference Result 10278 states and 14931 transitions. [2025-03-08 06:02:37,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:37,834 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 06:02:37,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:37,858 INFO L225 Difference]: With dead ends: 10278 [2025-03-08 06:02:37,859 INFO L226 Difference]: Without dead ends: 6740 [2025-03-08 06:02:37,864 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:02:37,865 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 57 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:37,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 277 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2025-03-08 06:02:38,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6738. [2025-03-08 06:02:38,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6738 states, 6737 states have (on average 1.4322398693780614) internal successors, (9649), 6737 states have internal predecessors, (9649), 0 states have call successors, (0), 0 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:02:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6738 states to 6738 states and 9649 transitions. [2025-03-08 06:02:38,112 INFO L78 Accepts]: Start accepts. Automaton has 6738 states and 9649 transitions. Word has length 68 [2025-03-08 06:02:38,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:38,113 INFO L471 AbstractCegarLoop]: Abstraction has 6738 states and 9649 transitions. [2025-03-08 06:02:38,113 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 06:02:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6738 states and 9649 transitions. [2025-03-08 06:02:38,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:02:38,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:38,117 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] [2025-03-08 06:02:38,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:02:38,118 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:38,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:38,118 INFO L85 PathProgramCache]: Analyzing trace with hash 366305133, now seen corresponding path program 1 times [2025-03-08 06:02:38,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:38,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296857292] [2025-03-08 06:02:38,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:38,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:38,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:02:38,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:02:38,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:38,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:38,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:02:38,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:38,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296857292] [2025-03-08 06:02:38,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296857292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:38,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:38,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:38,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438608151] [2025-03-08 06:02:38,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:38,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:38,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:38,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:38,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:38,325 INFO L87 Difference]: Start difference. First operand 6738 states and 9649 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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 06:02:38,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:38,940 INFO L93 Difference]: Finished difference Result 46336 states and 66424 transitions. [2025-03-08 06:02:38,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:02:38,941 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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 89 [2025-03-08 06:02:38,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:39,033 INFO L225 Difference]: With dead ends: 46336 [2025-03-08 06:02:39,033 INFO L226 Difference]: Without dead ends: 41598 [2025-03-08 06:02:39,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:02:39,044 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 827 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:39,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 1275 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:39,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41598 states. [2025-03-08 06:02:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41598 to 12466. [2025-03-08 06:02:39,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12466 states, 12465 states have (on average 1.4261532290413157) internal successors, (17777), 12465 states have internal predecessors, (17777), 0 states have call successors, (0), 0 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:02:39,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12466 states to 12466 states and 17777 transitions. [2025-03-08 06:02:39,598 INFO L78 Accepts]: Start accepts. Automaton has 12466 states and 17777 transitions. Word has length 89 [2025-03-08 06:02:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:39,599 INFO L471 AbstractCegarLoop]: Abstraction has 12466 states and 17777 transitions. [2025-03-08 06:02:39,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 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 06:02:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 12466 states and 17777 transitions. [2025-03-08 06:02:39,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:02:39,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:39,607 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] [2025-03-08 06:02:39,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:02:39,607 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:39,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:39,607 INFO L85 PathProgramCache]: Analyzing trace with hash 211936301, now seen corresponding path program 1 times [2025-03-08 06:02:39,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:39,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240100179] [2025-03-08 06:02:39,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:39,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:02:39,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:02:39,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:39,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 06:02:39,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:39,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240100179] [2025-03-08 06:02:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240100179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220451660] [2025-03-08 06:02:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:39,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:39,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:39,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:39,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:39,771 INFO L87 Difference]: Start difference. First operand 12466 states and 17777 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:02:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:40,473 INFO L93 Difference]: Finished difference Result 53024 states and 75960 transitions. [2025-03-08 06:02:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:02:40,474 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 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 89 [2025-03-08 06:02:40,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:40,557 INFO L225 Difference]: With dead ends: 53024 [2025-03-08 06:02:40,557 INFO L226 Difference]: Without dead ends: 46334 [2025-03-08 06:02:40,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:02:40,573 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 829 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:40,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 1238 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46334 states. [2025-03-08 06:02:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46334 to 21522. [2025-03-08 06:02:41,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21522 states, 21521 states have (on average 1.4222852097950838) internal successors, (30609), 21521 states have internal predecessors, (30609), 0 states have call successors, (0), 0 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:02:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21522 states to 21522 states and 30609 transitions. [2025-03-08 06:02:41,169 INFO L78 Accepts]: Start accepts. Automaton has 21522 states and 30609 transitions. Word has length 89 [2025-03-08 06:02:41,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:41,170 INFO L471 AbstractCegarLoop]: Abstraction has 21522 states and 30609 transitions. [2025-03-08 06:02:41,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 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:02:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 21522 states and 30609 transitions. [2025-03-08 06:02:41,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:02:41,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:41,173 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] [2025-03-08 06:02:41,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:02:41,173 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:41,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:41,174 INFO L85 PathProgramCache]: Analyzing trace with hash -766994195, now seen corresponding path program 1 times [2025-03-08 06:02:41,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:41,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090141374] [2025-03-08 06:02:41,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:41,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:02:41,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:02:41,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:41,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:41,385 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 06:02:41,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:41,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090141374] [2025-03-08 06:02:41,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090141374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:41,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:41,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:41,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136422854] [2025-03-08 06:02:41,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:41,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:41,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:41,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:41,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:41,386 INFO L87 Difference]: Start difference. First operand 21522 states and 30609 transitions. Second operand has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:02:42,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:42,411 INFO L93 Difference]: Finished difference Result 59712 states and 85464 transitions. [2025-03-08 06:02:42,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:02:42,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 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 89 [2025-03-08 06:02:42,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:42,493 INFO L225 Difference]: With dead ends: 59712 [2025-03-08 06:02:42,493 INFO L226 Difference]: Without dead ends: 53022 [2025-03-08 06:02:42,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:02:42,506 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 851 mSDsluCounter, 993 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1189 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:42,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1189 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:42,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53022 states. [2025-03-08 06:02:43,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53022 to 28210. [2025-03-08 06:02:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28210 states, 28209 states have (on average 1.4219929809635223) internal successors, (40113), 28209 states have internal predecessors, (40113), 0 states have call successors, (0), 0 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:02:43,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28210 states to 28210 states and 40113 transitions. [2025-03-08 06:02:43,204 INFO L78 Accepts]: Start accepts. Automaton has 28210 states and 40113 transitions. Word has length 89 [2025-03-08 06:02:43,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:43,204 INFO L471 AbstractCegarLoop]: Abstraction has 28210 states and 40113 transitions. [2025-03-08 06:02:43,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.5) internal successors, (84), 8 states have internal predecessors, (84), 0 states have call successors, (0), 0 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:02:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 28210 states and 40113 transitions. [2025-03-08 06:02:43,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:02:43,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:43,208 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] [2025-03-08 06:02:43,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 06:02:43,209 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:43,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1214939731, now seen corresponding path program 1 times [2025-03-08 06:02:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:43,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134259309] [2025-03-08 06:02:43,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:43,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:02:43,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:02:43,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:43,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 06:02:43,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:43,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134259309] [2025-03-08 06:02:43,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134259309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:43,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:43,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:43,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749970809] [2025-03-08 06:02:43,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:43,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:43,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:43,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:43,344 INFO L87 Difference]: Start difference. First operand 28210 states and 40113 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:02:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:44,253 INFO L93 Difference]: Finished difference Result 66400 states and 94968 transitions. [2025-03-08 06:02:44,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:02:44,253 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 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 89 [2025-03-08 06:02:44,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:44,370 INFO L225 Difference]: With dead ends: 66400 [2025-03-08 06:02:44,370 INFO L226 Difference]: Without dead ends: 59710 [2025-03-08 06:02:44,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:02:44,386 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 887 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 1177 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:44,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 1177 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59710 states. [2025-03-08 06:02:45,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59710 to 34898. [2025-03-08 06:02:45,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34898 states, 34897 states have (on average 1.4218127632747801) internal successors, (49617), 34897 states have internal predecessors, (49617), 0 states have call successors, (0), 0 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:02:45,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34898 states to 34898 states and 49617 transitions. [2025-03-08 06:02:45,442 INFO L78 Accepts]: Start accepts. Automaton has 34898 states and 49617 transitions. Word has length 89 [2025-03-08 06:02:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:45,442 INFO L471 AbstractCegarLoop]: Abstraction has 34898 states and 49617 transitions. [2025-03-08 06:02:45,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 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:02:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 34898 states and 49617 transitions. [2025-03-08 06:02:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:02:45,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:45,447 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] [2025-03-08 06:02:45,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 06:02:45,447 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:45,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:45,448 INFO L85 PathProgramCache]: Analyzing trace with hash -799763859, now seen corresponding path program 1 times [2025-03-08 06:02:45,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516919296] [2025-03-08 06:02:45,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:45,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:02:45,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:02:45,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:45,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:45,601 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 06:02:45,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:45,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516919296] [2025-03-08 06:02:45,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516919296] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:45,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:45,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:45,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263202746] [2025-03-08 06:02:45,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:45,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:45,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:45,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:45,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:45,603 INFO L87 Difference]: Start difference. First operand 34898 states and 49617 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:02:46,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:46,872 INFO L93 Difference]: Finished difference Result 73088 states and 104472 transitions. [2025-03-08 06:02:46,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:02:46,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 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 89 [2025-03-08 06:02:46,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:46,986 INFO L225 Difference]: With dead ends: 73088 [2025-03-08 06:02:46,987 INFO L226 Difference]: Without dead ends: 66398 [2025-03-08 06:02:47,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:02:47,003 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 936 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:47,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1166 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:47,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66398 states. [2025-03-08 06:02:47,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66398 to 41586. [2025-03-08 06:02:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41586 states, 41585 states have (on average 1.4216905134062763) internal successors, (59121), 41585 states have internal predecessors, (59121), 0 states have call successors, (0), 0 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:02:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41586 states to 41586 states and 59121 transitions. [2025-03-08 06:02:47,957 INFO L78 Accepts]: Start accepts. Automaton has 41586 states and 59121 transitions. Word has length 89 [2025-03-08 06:02:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:47,957 INFO L471 AbstractCegarLoop]: Abstraction has 41586 states and 59121 transitions. [2025-03-08 06:02:47,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 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:02:47,958 INFO L276 IsEmpty]: Start isEmpty. Operand 41586 states and 59121 transitions. [2025-03-08 06:02:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 06:02:47,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:47,962 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] [2025-03-08 06:02:47,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 06:02:47,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:47,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:47,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1286482131, now seen corresponding path program 1 times [2025-03-08 06:02:47,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:47,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665754587] [2025-03-08 06:02:47,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:47,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:47,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 06:02:47,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 06:02:47,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:47,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 06:02:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665754587] [2025-03-08 06:02:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665754587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 06:02:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606998209] [2025-03-08 06:02:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:48,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 06:02:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:48,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 06:02:48,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-08 06:02:48,087 INFO L87 Difference]: Start difference. First operand 41586 states and 59121 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:49,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:49,196 INFO L93 Difference]: Finished difference Result 79776 states and 113976 transitions. [2025-03-08 06:02:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 06:02:49,197 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 06:02:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:49,289 INFO L225 Difference]: With dead ends: 79776 [2025-03-08 06:02:49,289 INFO L226 Difference]: Without dead ends: 73086 [2025-03-08 06:02:49,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-08 06:02:49,308 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 851 mSDsluCounter, 1073 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1264 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:49,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1264 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:02:49,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73086 states. [2025-03-08 06:02:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73086 to 48274. [2025-03-08 06:02:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48274 states, 48273 states have (on average 1.421602137841029) internal successors, (68625), 48273 states have internal predecessors, (68625), 0 states have call successors, (0), 0 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:02:50,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48274 states to 48274 states and 68625 transitions. [2025-03-08 06:02:50,880 INFO L78 Accepts]: Start accepts. Automaton has 48274 states and 68625 transitions. Word has length 89 [2025-03-08 06:02:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:50,880 INFO L471 AbstractCegarLoop]: Abstraction has 48274 states and 68625 transitions. [2025-03-08 06:02:50,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 48274 states and 68625 transitions. [2025-03-08 06:02:50,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-08 06:02:50,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:50,885 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] [2025-03-08 06:02:50,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 06:02:50,885 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:50,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:50,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1438763520, now seen corresponding path program 1 times [2025-03-08 06:02:50,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:50,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004915382] [2025-03-08 06:02:50,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:50,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:50,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-08 06:02:50,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-08 06:02:50,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:50,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:50,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:50,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004915382] [2025-03-08 06:02:50,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004915382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:50,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:50,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:50,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516421871] [2025-03-08 06:02:50,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:50,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:50,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:50,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:50,987 INFO L87 Difference]: Start difference. First operand 48274 states and 68625 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:02:52,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:52,266 INFO L93 Difference]: Finished difference Result 96502 states and 137203 transitions. [2025-03-08 06:02:52,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:52,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 90 [2025-03-08 06:02:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:52,336 INFO L225 Difference]: With dead ends: 96502 [2025-03-08 06:02:52,336 INFO L226 Difference]: Without dead ends: 48276 [2025-03-08 06:02:52,363 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:02:52,363 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 53 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:52,364 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 276 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:52,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48276 states. [2025-03-08 06:02:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48276 to 48274. [2025-03-08 06:02:53,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48274 states, 48273 states have (on average 1.4073498643133844) internal successors, (67937), 48273 states have internal predecessors, (67937), 0 states have call successors, (0), 0 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:02:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48274 states to 48274 states and 67937 transitions. [2025-03-08 06:02:53,439 INFO L78 Accepts]: Start accepts. Automaton has 48274 states and 67937 transitions. Word has length 90 [2025-03-08 06:02:53,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:53,440 INFO L471 AbstractCegarLoop]: Abstraction has 48274 states and 67937 transitions. [2025-03-08 06:02:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 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:02:53,440 INFO L276 IsEmpty]: Start isEmpty. Operand 48274 states and 67937 transitions. [2025-03-08 06:02:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-08 06:02:53,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:53,442 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 06:02:53,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 06:02:53,442 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:53,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:53,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1334968501, now seen corresponding path program 1 times [2025-03-08 06:02:53,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:53,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185796262] [2025-03-08 06:02:53,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:53,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-08 06:02:53,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-08 06:02:53,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:53,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:53,500 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:53,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:53,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185796262] [2025-03-08 06:02:53,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185796262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:53,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:53,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:53,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813808445] [2025-03-08 06:02:53,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:53,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:53,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:53,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:53,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:53,501 INFO L87 Difference]: Start difference. First operand 48274 states and 67937 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:02:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:53,803 INFO L93 Difference]: Finished difference Result 66059 states and 93161 transitions. [2025-03-08 06:02:53,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:53,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-03-08 06:02:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:53,827 INFO L225 Difference]: With dead ends: 66059 [2025-03-08 06:02:53,827 INFO L226 Difference]: Without dead ends: 17833 [2025-03-08 06:02:53,854 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:02:53,856 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 47 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:53,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 273 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:53,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17833 states. [2025-03-08 06:02:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17833 to 17825. [2025-03-08 06:02:54,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17825 states, 17824 states have (on average 1.4039497307001796) internal successors, (25024), 17824 states have internal predecessors, (25024), 0 states have call successors, (0), 0 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:02:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17825 states to 17825 states and 25024 transitions. [2025-03-08 06:02:54,169 INFO L78 Accepts]: Start accepts. Automaton has 17825 states and 25024 transitions. Word has length 91 [2025-03-08 06:02:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:54,169 INFO L471 AbstractCegarLoop]: Abstraction has 17825 states and 25024 transitions. [2025-03-08 06:02:54,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:02:54,169 INFO L276 IsEmpty]: Start isEmpty. Operand 17825 states and 25024 transitions. [2025-03-08 06:02:54,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-08 06:02:54,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:54,171 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] [2025-03-08 06:02:54,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 06:02:54,171 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:54,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:54,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1232786841, now seen corresponding path program 1 times [2025-03-08 06:02:54,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:54,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014142551] [2025-03-08 06:02:54,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:54,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:54,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-08 06:02:54,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-08 06:02:54,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:54,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:54,243 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:54,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:54,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014142551] [2025-03-08 06:02:54,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014142551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:54,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:54,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389238282] [2025-03-08 06:02:54,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:54,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:54,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:54,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:54,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:54,245 INFO L87 Difference]: Start difference. First operand 17825 states and 25024 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:54,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:54,423 INFO L93 Difference]: Finished difference Result 26709 states and 37506 transitions. [2025-03-08 06:02:54,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:54,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 92 [2025-03-08 06:02:54,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:54,434 INFO L225 Difference]: With dead ends: 26709 [2025-03-08 06:02:54,434 INFO L226 Difference]: Without dead ends: 8947 [2025-03-08 06:02:54,445 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:02:54,446 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 49 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:54,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 252 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8947 states. [2025-03-08 06:02:54,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8947 to 8945. [2025-03-08 06:02:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8945 states, 8944 states have (on average 1.389087656529517) internal successors, (12424), 8944 states have internal predecessors, (12424), 0 states have call successors, (0), 0 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:02:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8945 states to 8945 states and 12424 transitions. [2025-03-08 06:02:54,607 INFO L78 Accepts]: Start accepts. Automaton has 8945 states and 12424 transitions. Word has length 92 [2025-03-08 06:02:54,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:54,608 INFO L471 AbstractCegarLoop]: Abstraction has 8945 states and 12424 transitions. [2025-03-08 06:02:54,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:54,608 INFO L276 IsEmpty]: Start isEmpty. Operand 8945 states and 12424 transitions. [2025-03-08 06:02:54,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-08 06:02:54,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:54,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:02:54,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 06:02:54,609 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:54,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:54,609 INFO L85 PathProgramCache]: Analyzing trace with hash 911955950, now seen corresponding path program 1 times [2025-03-08 06:02:54,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:54,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862797709] [2025-03-08 06:02:54,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:54,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:54,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-08 06:02:54,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-08 06:02:54,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:54,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:54,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862797709] [2025-03-08 06:02:54,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862797709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:54,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:54,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:54,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977618671] [2025-03-08 06:02:54,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:54,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:54,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:54,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:54,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:54,666 INFO L87 Difference]: Start difference. First operand 8945 states and 12424 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:02:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:54,736 INFO L93 Difference]: Finished difference Result 13389 states and 18606 transitions. [2025-03-08 06:02:54,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:54,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 06:02:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:54,742 INFO L225 Difference]: With dead ends: 13389 [2025-03-08 06:02:54,742 INFO L226 Difference]: Without dead ends: 4507 [2025-03-08 06:02:54,746 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:02:54,748 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 46 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:54,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 237 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2025-03-08 06:02:54,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 4505. [2025-03-08 06:02:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4505 states, 4504 states have (on average 1.3730017761989344) internal successors, (6184), 4504 states have internal predecessors, (6184), 0 states have call successors, (0), 0 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:02:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4505 states to 4505 states and 6184 transitions. [2025-03-08 06:02:54,825 INFO L78 Accepts]: Start accepts. Automaton has 4505 states and 6184 transitions. Word has length 94 [2025-03-08 06:02:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:54,826 INFO L471 AbstractCegarLoop]: Abstraction has 4505 states and 6184 transitions. [2025-03-08 06:02:54,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:02:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 4505 states and 6184 transitions. [2025-03-08 06:02:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-08 06:02:54,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:54,827 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, 1] [2025-03-08 06:02:54,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 06:02:54,827 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:54,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:54,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1244189035, now seen corresponding path program 1 times [2025-03-08 06:02:54,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:54,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282828677] [2025-03-08 06:02:54,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:54,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:54,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-08 06:02:54,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-08 06:02:54,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:54,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:54,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:54,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282828677] [2025-03-08 06:02:54,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282828677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:54,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:54,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:54,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712685677] [2025-03-08 06:02:54,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:54,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:54,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:54,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:54,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:54,895 INFO L87 Difference]: Start difference. First operand 4505 states and 6184 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:02:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:54,932 INFO L93 Difference]: Finished difference Result 6729 states and 9246 transitions. [2025-03-08 06:02:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:54,932 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:02:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:54,936 INFO L225 Difference]: With dead ends: 6729 [2025-03-08 06:02:54,936 INFO L226 Difference]: Without dead ends: 2287 [2025-03-08 06:02:54,939 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:02:54,940 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 43 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:54,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 222 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:54,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2025-03-08 06:02:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2285. [2025-03-08 06:02:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2285 states, 2284 states have (on average 1.3546409807355517) internal successors, (3094), 2284 states have internal predecessors, (3094), 0 states have call successors, (0), 0 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:02:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2285 states to 2285 states and 3094 transitions. [2025-03-08 06:02:54,979 INFO L78 Accepts]: Start accepts. Automaton has 2285 states and 3094 transitions. Word has length 96 [2025-03-08 06:02:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:54,980 INFO L471 AbstractCegarLoop]: Abstraction has 2285 states and 3094 transitions. [2025-03-08 06:02:54,980 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:02:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2285 states and 3094 transitions. [2025-03-08 06:02:54,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-08 06:02:54,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:54,981 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, 1] [2025-03-08 06:02:54,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 06:02:54,981 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash -941547940, now seen corresponding path program 1 times [2025-03-08 06:02:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544672401] [2025-03-08 06:02:54,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:54,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:54,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-08 06:02:54,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-08 06:02:54,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:54,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:55,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544672401] [2025-03-08 06:02:55,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544672401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:02:55,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:02:55,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 06:02:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619630860] [2025-03-08 06:02:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:02:55,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:02:55,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:55,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:02:55,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 06:02:55,049 INFO L87 Difference]: Start difference. First operand 2285 states and 3094 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:55,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:55,071 INFO L93 Difference]: Finished difference Result 3399 states and 4611 transitions. [2025-03-08 06:02:55,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:02:55,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2025-03-08 06:02:55,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:55,074 INFO L225 Difference]: With dead ends: 3399 [2025-03-08 06:02:55,074 INFO L226 Difference]: Without dead ends: 1177 [2025-03-08 06:02:55,075 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:02:55,076 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:55,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 207 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:02:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2025-03-08 06:02:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 1175. [2025-03-08 06:02:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 1174 states have (on average 1.332197614991482) internal successors, (1564), 1174 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1564 transitions. [2025-03-08 06:02:55,095 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1564 transitions. Word has length 98 [2025-03-08 06:02:55,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:55,095 INFO L471 AbstractCegarLoop]: Abstraction has 1175 states and 1564 transitions. [2025-03-08 06:02:55,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 06:02:55,096 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1564 transitions. [2025-03-08 06:02:55,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-08 06:02:55,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:55,096 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:02:55,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 06:02:55,097 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:55,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:55,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1832097603, now seen corresponding path program 1 times [2025-03-08 06:02:55,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:55,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448894489] [2025-03-08 06:02:55,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:55,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:55,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:02:55,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:02:55,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:55,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:55,967 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:02:55,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:02:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448894489] [2025-03-08 06:02:55,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448894489] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:02:55,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638900253] [2025-03-08 06:02:55,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:55,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:02:55,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:02:55,970 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 06:02:55,971 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 06:02:56,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-08 06:02:56,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-08 06:02:56,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:56,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:02:56,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 06:02:56,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:02:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:02:56,316 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:02:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 06:02:56,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [638900253] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:02:56,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:02:56,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-03-08 06:02:56,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669542318] [2025-03-08 06:02:56,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:02:56,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 06:02:56,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:02:56,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 06:02:56,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-03-08 06:02:56,716 INFO L87 Difference]: Start difference. First operand 1175 states and 1564 transitions. Second operand has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:02:59,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:02:59,392 INFO L93 Difference]: Finished difference Result 6579 states and 8686 transitions. [2025-03-08 06:02:59,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 06:02:59,392 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 0 states have call successors, (0), 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 100 [2025-03-08 06:02:59,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:02:59,399 INFO L225 Difference]: With dead ends: 6579 [2025-03-08 06:02:59,399 INFO L226 Difference]: Without dead ends: 5467 [2025-03-08 06:02:59,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1115 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=802, Invalid=2980, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 06:02:59,403 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 1511 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 06:02:59,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1511 Valid, 1138 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 06:02:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2025-03-08 06:02:59,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 5203. [2025-03-08 06:02:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5203 states, 5202 states have (on average 1.2916186082276047) internal successors, (6719), 5202 states have internal predecessors, (6719), 0 states have call successors, (0), 0 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:02:59,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5203 states to 5203 states and 6719 transitions. [2025-03-08 06:02:59,584 INFO L78 Accepts]: Start accepts. Automaton has 5203 states and 6719 transitions. Word has length 100 [2025-03-08 06:02:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:02:59,585 INFO L471 AbstractCegarLoop]: Abstraction has 5203 states and 6719 transitions. [2025-03-08 06:02:59,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 14.947368421052632) internal successors, (284), 19 states have internal predecessors, (284), 0 states have call successors, (0), 0 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:02:59,585 INFO L276 IsEmpty]: Start isEmpty. Operand 5203 states and 6719 transitions. [2025-03-08 06:02:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-08 06:02:59,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:02:59,587 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, 1, 1, 1, 1, 1] [2025-03-08 06:02:59,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 06:02:59,792 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,SelfDestructingSolverStorable24 [2025-03-08 06:02:59,792 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:02:59,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:02:59,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1474806611, now seen corresponding path program 1 times [2025-03-08 06:02:59,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:02:59,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896511872] [2025-03-08 06:02:59,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:02:59,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:02:59,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:02:59,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:02:59,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:02:59,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:00,172 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:00,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:00,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896511872] [2025-03-08 06:03:00,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896511872] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:03:00,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353549686] [2025-03-08 06:03:00,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:00,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:00,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:03:00,176 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:03:00,176 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:03:00,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-08 06:03:00,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-08 06:03:00,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:00,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:00,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:03:00,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:03:00,687 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:00,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:03:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:01,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353549686] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:03:01,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:03:01,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2025-03-08 06:03:01,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038758725] [2025-03-08 06:03:01,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:03:01,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-08 06:03:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:01,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-08 06:03:01,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-08 06:03:01,446 INFO L87 Difference]: Start difference. First operand 5203 states and 6719 transitions. Second operand has 26 states, 26 states have (on average 10.961538461538462) internal successors, (285), 25 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:03:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:02,361 INFO L93 Difference]: Finished difference Result 18559 states and 23969 transitions. [2025-03-08 06:03:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-08 06:03:02,361 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 10.961538461538462) internal successors, (285), 25 states have internal predecessors, (285), 0 states have call successors, (0), 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 101 [2025-03-08 06:03:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:02,376 INFO L225 Difference]: With dead ends: 18559 [2025-03-08 06:03:02,376 INFO L226 Difference]: Without dead ends: 13618 [2025-03-08 06:03:02,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2025-03-08 06:03:02,382 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 1656 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:02,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 953 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:03:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13618 states. [2025-03-08 06:03:02,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13618 to 13552. [2025-03-08 06:03:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13552 states, 13551 states have (on average 1.2652940742380636) internal successors, (17146), 13551 states have internal predecessors, (17146), 0 states have call successors, (0), 0 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:03:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13552 states to 13552 states and 17146 transitions. [2025-03-08 06:03:02,673 INFO L78 Accepts]: Start accepts. Automaton has 13552 states and 17146 transitions. Word has length 101 [2025-03-08 06:03:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:02,673 INFO L471 AbstractCegarLoop]: Abstraction has 13552 states and 17146 transitions. [2025-03-08 06:03:02,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.961538461538462) internal successors, (285), 25 states have internal predecessors, (285), 0 states have call successors, (0), 0 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:03:02,674 INFO L276 IsEmpty]: Start isEmpty. Operand 13552 states and 17146 transitions. [2025-03-08 06:03:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:03:02,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:02,675 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, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:02,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:03:02,877 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,SelfDestructingSolverStorable25 [2025-03-08 06:03:02,877 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:02,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1740163186, now seen corresponding path program 1 times [2025-03-08 06:03:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:02,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813999092] [2025-03-08 06:03:02,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:02,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:03:02,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:03:02,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:02,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:03,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813999092] [2025-03-08 06:03:03,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813999092] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:03:03,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955199875] [2025-03-08 06:03:03,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:03,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:03,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:03:03,110 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:03:03,112 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:03:03,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:03:03,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:03:03,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:03,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:03,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 06:03:03,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:03:03,590 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:03,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:03:04,163 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:04,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955199875] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:03:04,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:03:04,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-08 06:03:04,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91917449] [2025-03-08 06:03:04,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:03:04,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-08 06:03:04,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:04,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-08 06:03:04,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2025-03-08 06:03:04,164 INFO L87 Difference]: Start difference. First operand 13552 states and 17146 transitions. Second operand has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 21 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 06:03:04,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:04,787 INFO L93 Difference]: Finished difference Result 27026 states and 34313 transitions. [2025-03-08 06:03:04,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:03:04,787 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 21 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) Word has length 102 [2025-03-08 06:03:04,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:04,805 INFO L225 Difference]: With dead ends: 27026 [2025-03-08 06:03:04,805 INFO L226 Difference]: Without dead ends: 13982 [2025-03-08 06:03:04,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=798, Unknown=0, NotChecked=0, Total=1056 [2025-03-08 06:03:04,816 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1300 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1300 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:04,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1300 Valid, 623 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:03:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13982 states. [2025-03-08 06:03:05,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13982 to 13540. [2025-03-08 06:03:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13540 states, 13539 states have (on average 1.2597680774060123) internal successors, (17056), 13539 states have internal predecessors, (17056), 0 states have call successors, (0), 0 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:03:05,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13540 states to 13540 states and 17056 transitions. [2025-03-08 06:03:05,120 INFO L78 Accepts]: Start accepts. Automaton has 13540 states and 17056 transitions. Word has length 102 [2025-03-08 06:03:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:05,120 INFO L471 AbstractCegarLoop]: Abstraction has 13540 states and 17056 transitions. [2025-03-08 06:03:05,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 10.181818181818182) internal successors, (224), 21 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 06:03:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13540 states and 17056 transitions. [2025-03-08 06:03:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 06:03:05,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:05,122 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, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:05,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:03:05,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:05,323 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:05,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash 729837303, now seen corresponding path program 1 times [2025-03-08 06:03:05,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:05,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043448576] [2025-03-08 06:03:05,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:05,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:05,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:03:05,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:03:05,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:05,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:06,019 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043448576] [2025-03-08 06:03:06,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043448576] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:03:06,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574091674] [2025-03-08 06:03:06,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:06,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:06,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:03:06,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:03:06,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:03:06,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 06:03:06,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 06:03:06,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:06,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:06,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:03:06,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:03:06,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:06,492 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:03:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:07,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574091674] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:03:07,041 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:03:07,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 28 [2025-03-08 06:03:07,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041621252] [2025-03-08 06:03:07,041 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:03:07,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 06:03:07,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:07,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 06:03:07,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-03-08 06:03:07,042 INFO L87 Difference]: Start difference. First operand 13540 states and 17056 transitions. Second operand has 29 states, 29 states have (on average 9.10344827586207) internal successors, (264), 28 states have internal predecessors, (264), 0 states have call successors, (0), 0 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:03:09,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:09,028 INFO L93 Difference]: Finished difference Result 56949 states and 72875 transitions. [2025-03-08 06:03:09,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-08 06:03:09,029 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 9.10344827586207) internal successors, (264), 28 states have internal predecessors, (264), 0 states have call successors, (0), 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 102 [2025-03-08 06:03:09,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:09,074 INFO L225 Difference]: With dead ends: 56949 [2025-03-08 06:03:09,074 INFO L226 Difference]: Without dead ends: 43854 [2025-03-08 06:03:09,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=751, Invalid=3031, Unknown=0, NotChecked=0, Total=3782 [2025-03-08 06:03:09,092 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1939 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1235 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1939 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:09,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1939 Valid, 1271 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1235 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:03:09,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43854 states. [2025-03-08 06:03:10,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43854 to 43566. [2025-03-08 06:03:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43566 states, 43565 states have (on average 1.257615057959371) internal successors, (54788), 43565 states have internal predecessors, (54788), 0 states have call successors, (0), 0 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:03:10,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43566 states to 43566 states and 54788 transitions. [2025-03-08 06:03:10,146 INFO L78 Accepts]: Start accepts. Automaton has 43566 states and 54788 transitions. Word has length 102 [2025-03-08 06:03:10,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:10,146 INFO L471 AbstractCegarLoop]: Abstraction has 43566 states and 54788 transitions. [2025-03-08 06:03:10,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 9.10344827586207) internal successors, (264), 28 states have internal predecessors, (264), 0 states have call successors, (0), 0 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:03:10,147 INFO L276 IsEmpty]: Start isEmpty. Operand 43566 states and 54788 transitions. [2025-03-08 06:03:10,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:03:10,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:10,148 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:10,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 06:03:10,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 06:03:10,349 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:10,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:10,349 INFO L85 PathProgramCache]: Analyzing trace with hash -768670345, now seen corresponding path program 1 times [2025-03-08 06:03:10,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:10,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065242582] [2025-03-08 06:03:10,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:10,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:10,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:03:10,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:03:10,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:10,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:10,639 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:10,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065242582] [2025-03-08 06:03:10,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065242582] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:03:10,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561349792] [2025-03-08 06:03:10,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:10,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:10,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:03:10,642 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:03:10,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:03:10,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:03:10,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:03:10,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:10,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:10,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:03:10,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:03:11,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:11,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:03:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561349792] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:03:11,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:03:11,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-08 06:03:11,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202511018] [2025-03-08 06:03:11,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:03:11,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-08 06:03:11,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:11,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-08 06:03:11,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-08 06:03:11,577 INFO L87 Difference]: Start difference. First operand 43566 states and 54788 transitions. Second operand has 21 states, 21 states have (on average 11.142857142857142) internal successors, (234), 20 states have internal predecessors, (234), 0 states have call successors, (0), 0 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:03:13,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:13,122 INFO L93 Difference]: Finished difference Result 117326 states and 147753 transitions. [2025-03-08 06:03:13,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 06:03:13,123 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 11.142857142857142) internal successors, (234), 20 states have internal predecessors, (234), 0 states have call successors, (0), 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 104 [2025-03-08 06:03:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:13,215 INFO L225 Difference]: With dead ends: 117326 [2025-03-08 06:03:13,215 INFO L226 Difference]: Without dead ends: 78866 [2025-03-08 06:03:13,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=749, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:03:13,246 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 1014 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:13,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 685 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:03:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78866 states. [2025-03-08 06:03:14,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78866 to 69468. [2025-03-08 06:03:14,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69468 states, 69467 states have (on average 1.251255992053781) internal successors, (86921), 69467 states have internal predecessors, (86921), 0 states have call successors, (0), 0 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:03:15,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69468 states to 69468 states and 86921 transitions. [2025-03-08 06:03:15,082 INFO L78 Accepts]: Start accepts. Automaton has 69468 states and 86921 transitions. Word has length 104 [2025-03-08 06:03:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:15,083 INFO L471 AbstractCegarLoop]: Abstraction has 69468 states and 86921 transitions. [2025-03-08 06:03:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.142857142857142) internal successors, (234), 20 states have internal predecessors, (234), 0 states have call successors, (0), 0 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:03:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 69468 states and 86921 transitions. [2025-03-08 06:03:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-08 06:03:15,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:15,085 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:15,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 06:03:15,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-08 06:03:15,286 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:15,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1403802341, now seen corresponding path program 1 times [2025-03-08 06:03:15,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:15,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196039145] [2025-03-08 06:03:15,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:15,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:15,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:03:15,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:03:15,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:15,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:15,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196039145] [2025-03-08 06:03:15,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196039145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:03:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581004785] [2025-03-08 06:03:15,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:15,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:15,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:03:15,498 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:03:15,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:03:15,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-08 06:03:15,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-08 06:03:15,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:15,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:15,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-08 06:03:15,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:03:15,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:15,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:03:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:16,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581004785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:03:16,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:03:16,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2025-03-08 06:03:16,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656422722] [2025-03-08 06:03:16,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:03:16,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 06:03:16,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:16,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 06:03:16,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-03-08 06:03:16,526 INFO L87 Difference]: Start difference. First operand 69468 states and 86921 transitions. Second operand has 23 states, 23 states have (on average 10.08695652173913) internal successors, (232), 22 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:03:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:03:20,170 INFO L93 Difference]: Finished difference Result 195590 states and 244357 transitions. [2025-03-08 06:03:20,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 06:03:20,174 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 10.08695652173913) internal successors, (232), 22 states have internal predecessors, (232), 0 states have call successors, (0), 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 104 [2025-03-08 06:03:20,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:03:20,325 INFO L225 Difference]: With dead ends: 195590 [2025-03-08 06:03:20,325 INFO L226 Difference]: Without dead ends: 131082 [2025-03-08 06:03:20,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=739, Unknown=0, NotChecked=0, Total=992 [2025-03-08 06:03:20,362 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 1097 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:03:20,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 592 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 421 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:03:20,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131082 states. [2025-03-08 06:03:23,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131082 to 131078. [2025-03-08 06:03:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131078 states, 131077 states have (on average 1.2418349519747935) internal successors, (162776), 131077 states have internal predecessors, (162776), 0 states have call successors, (0), 0 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:03:23,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131078 states to 131078 states and 162776 transitions. [2025-03-08 06:03:23,897 INFO L78 Accepts]: Start accepts. Automaton has 131078 states and 162776 transitions. Word has length 104 [2025-03-08 06:03:23,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:03:23,897 INFO L471 AbstractCegarLoop]: Abstraction has 131078 states and 162776 transitions. [2025-03-08 06:03:23,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.08695652173913) internal successors, (232), 22 states have internal predecessors, (232), 0 states have call successors, (0), 0 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:03:23,898 INFO L276 IsEmpty]: Start isEmpty. Operand 131078 states and 162776 transitions. [2025-03-08 06:03:23,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-08 06:03:23,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:03:23,901 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:03:23,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 06:03:24,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:24,102 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:03:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:03:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1779851210, now seen corresponding path program 1 times [2025-03-08 06:03:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:03:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321991763] [2025-03-08 06:03:24,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:03:24,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:03:24,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:03:24,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:24,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:24,647 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:03:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321991763] [2025-03-08 06:03:24,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321991763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:03:24,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672590606] [2025-03-08 06:03:24,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:03:24,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:03:24,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:03:24,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:03:24,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:03:24,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-08 06:03:24,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-08 06:03:24,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:03:24,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:03:24,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-08 06:03:24,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:03:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:26,220 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 06:03:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:03:27,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672590606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 06:03:27,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 06:03:27,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 15] total 42 [2025-03-08 06:03:27,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266344584] [2025-03-08 06:03:27,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 06:03:27,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-08 06:03:27,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:03:27,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-08 06:03:27,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1554, Unknown=0, NotChecked=0, Total=1722 [2025-03-08 06:03:27,475 INFO L87 Difference]: Start difference. First operand 131078 states and 162776 transitions. Second operand has 42 states, 42 states have (on average 6.904761904761905) internal successors, (290), 42 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)