./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.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 f7497e4203b86f15acb74ef94ae3bce6255aa8233294110bb99f24cde0725dc7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:51:22,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:51:22,250 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:51:22,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:51:22,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:51:22,275 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:51:22,275 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:51:22,275 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:51:22,275 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:51:22,275 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:51:22,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:51:22,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:51:22,276 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:51:22,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:51:22,277 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:51:22,277 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:51:22,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:51:22,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:51:22,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:51:22,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:51:22,279 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 -> f7497e4203b86f15acb74ef94ae3bce6255aa8233294110bb99f24cde0725dc7 [2025-03-03 14:51:22,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:51:22,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:51:22,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:51:22,510 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:51:22,511 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:51:22,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2025-03-03 14:51:23,614 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9cb187c/8eaa39158192473fb00711a93cd5f267/FLAG9bc7db0d6 [2025-03-03 14:51:23,917 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:51:23,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.ufo.BOUNDED-10.pals.c [2025-03-03 14:51:23,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9cb187c/8eaa39158192473fb00711a93cd5f267/FLAG9bc7db0d6 [2025-03-03 14:51:23,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f9cb187c/8eaa39158192473fb00711a93cd5f267 [2025-03-03 14:51:23,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:51:23,946 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:51:23,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:51:23,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:51:23,950 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:51:23,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:51:23" (1/1) ... [2025-03-03 14:51:23,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58174f60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:23, skipping insertion in model container [2025-03-03 14:51:23,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:51:23" (1/1) ... [2025-03-03 14:51:23,970 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:51:24,110 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.5.ufo.BOUNDED-10.pals.c[11233,11246] [2025-03-03 14:51:24,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:51:24,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:51:24,149 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.5.ufo.BOUNDED-10.pals.c[11233,11246] [2025-03-03 14:51:24,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:51:24,166 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:51:24,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24 WrapperNode [2025-03-03 14:51:24,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:51:24,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:51:24,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:51:24,167 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:51:24,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,196 INFO L138 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 335 [2025-03-03 14:51:24,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:51:24,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:51:24,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:51:24,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:51:24,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,213 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:51:24,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,214 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:51:24,222 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:51:24,223 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:51:24,223 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:51:24,223 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (1/1) ... [2025-03-03 14:51:24,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:51:24,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:24,249 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:51:24,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:51:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:51:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:51:24,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:51:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:51:24,339 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:51:24,340 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:51:24,681 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-03-03 14:51:24,681 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:51:24,687 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:51:24,689 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:51:24,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:51:24 BoogieIcfgContainer [2025-03-03 14:51:24,689 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:51:24,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:51:24,691 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:51:24,694 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:51:24,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:51:23" (1/3) ... [2025-03-03 14:51:24,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cede74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:51:24, skipping insertion in model container [2025-03-03 14:51:24,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:51:24" (2/3) ... [2025-03-03 14:51:24,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cede74f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:51:24, skipping insertion in model container [2025-03-03 14:51:24,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:51:24" (3/3) ... [2025-03-03 14:51:24,696 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c [2025-03-03 14:51:24,706 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:51:24,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.5.ufo.BOUNDED-10.pals.c that has 1 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:51:24,749 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:51:24,757 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;@46e2fffa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:51:24,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:51:24,760 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 80 states have (on average 1.75) internal successors, (140), 81 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:24,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-03 14:51:24,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:24,765 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] [2025-03-03 14:51:24,765 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:24,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:24,770 INFO L85 PathProgramCache]: Analyzing trace with hash -34054622, now seen corresponding path program 1 times [2025-03-03 14:51:24,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:24,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911680167] [2025-03-03 14:51:24,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:24,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-03 14:51:24,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-03 14:51:24,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:24,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:25,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-03 14:51:25,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:25,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911680167] [2025-03-03 14:51:25,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911680167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:25,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:25,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:51:25,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081156581] [2025-03-03 14:51:25,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:25,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:51:25,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:25,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:51:25,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:51:25,134 INFO L87 Difference]: Start difference. First operand has 82 states, 80 states have (on average 1.75) internal successors, (140), 81 states have internal predecessors, (140), 0 states have call successors, (0), 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 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:25,228 INFO L93 Difference]: Finished difference Result 131 states and 216 transitions. [2025-03-03 14:51:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:51:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2025-03-03 14:51:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:25,234 INFO L225 Difference]: With dead ends: 131 [2025-03-03 14:51:25,234 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 14:51:25,236 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-03 14:51:25,238 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:25,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 14:51:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 14:51:25,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 78 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2025-03-03 14:51:25,277 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 23 [2025-03-03 14:51:25,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:25,277 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2025-03-03 14:51:25,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2025-03-03 14:51:25,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-03 14:51:25,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:25,279 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] [2025-03-03 14:51:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:51:25,279 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:25,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:25,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1884841628, now seen corresponding path program 1 times [2025-03-03 14:51:25,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:25,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270498637] [2025-03-03 14:51:25,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:25,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-03 14:51:25,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-03 14:51:25,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:25,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270498637] [2025-03-03 14:51:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270498637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:25,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:25,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783926735] [2025-03-03 14:51:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:25,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:25,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:25,494 INFO L87 Difference]: Start difference. First operand 79 states and 104 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:25,733 INFO L93 Difference]: Finished difference Result 499 states and 774 transitions. [2025-03-03 14:51:25,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:51:25,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-03 14:51:25,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:25,736 INFO L225 Difference]: With dead ends: 499 [2025-03-03 14:51:25,736 INFO L226 Difference]: Without dead ends: 457 [2025-03-03 14:51:25,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:51:25,737 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 703 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:25,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 1560 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-03 14:51:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 119. [2025-03-03 14:51:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.423728813559322) internal successors, (168), 118 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-03 14:51:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 168 transitions. [2025-03-03 14:51:25,759 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 168 transitions. Word has length 53 [2025-03-03 14:51:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:25,759 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 168 transitions. [2025-03-03 14:51:25,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,760 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 168 transitions. [2025-03-03 14:51:25,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:51:25,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:25,760 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] [2025-03-03 14:51:25,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:51:25,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:25,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:25,761 INFO L85 PathProgramCache]: Analyzing trace with hash -2031219681, now seen corresponding path program 1 times [2025-03-03 14:51:25,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:25,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061168738] [2025-03-03 14:51:25,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:25,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:25,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:51:25,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:51:25,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:25,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:25,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:25,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:25,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061168738] [2025-03-03 14:51:25,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061168738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:25,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:25,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:25,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198097294] [2025-03-03 14:51:25,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:25,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:25,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:25,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:25,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:25,882 INFO L87 Difference]: Start difference. First operand 119 states and 168 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:25,901 INFO L93 Difference]: Finished difference Result 272 states and 411 transitions. [2025-03-03 14:51:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:25,902 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 14:51:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:25,903 INFO L225 Difference]: With dead ends: 272 [2025-03-03 14:51:25,903 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 14:51:25,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:25,904 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 43 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 164 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-03 14:51:25,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 164 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 14:51:25,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-03-03 14:51:25,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.4759358288770053) internal successors, (276), 187 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 276 transitions. [2025-03-03 14:51:25,913 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 276 transitions. Word has length 55 [2025-03-03 14:51:25,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:25,913 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 276 transitions. [2025-03-03 14:51:25,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:25,913 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 276 transitions. [2025-03-03 14:51:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 14:51:25,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:25,914 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] [2025-03-03 14:51:25,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:51:25,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:25,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1998896446, now seen corresponding path program 1 times [2025-03-03 14:51:25,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:25,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902334675] [2025-03-03 14:51:25,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:25,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 14:51:25,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 14:51:25,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:25,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,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-03 14:51:26,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902334675] [2025-03-03 14:51:26,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902334675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:26,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:26,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:26,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512613278] [2025-03-03 14:51:26,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:26,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:26,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:26,211 INFO L87 Difference]: Start difference. First operand 188 states and 276 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:26,365 INFO L93 Difference]: Finished difference Result 341 states and 516 transitions. [2025-03-03 14:51:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-03-03 14:51:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:26,366 INFO L225 Difference]: With dead ends: 341 [2025-03-03 14:51:26,366 INFO L226 Difference]: Without dead ends: 190 [2025-03-03 14:51:26,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:51:26,367 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 254 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:26,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 350 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-03 14:51:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2025-03-03 14:51:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 1.46524064171123) internal successors, (274), 187 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 274 transitions. [2025-03-03 14:51:26,377 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 274 transitions. Word has length 55 [2025-03-03 14:51:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:26,381 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 274 transitions. [2025-03-03 14:51:26,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,381 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 274 transitions. [2025-03-03 14:51:26,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:51:26,382 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:26,382 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] [2025-03-03 14:51:26,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:51:26,383 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:26,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:26,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1805709949, now seen corresponding path program 1 times [2025-03-03 14:51:26,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:26,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869199903] [2025-03-03 14:51:26,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:26,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:51:26,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:51:26,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:26,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869199903] [2025-03-03 14:51:26,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869199903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:26,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:26,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:51:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184093111] [2025-03-03 14:51:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:51:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:51:26,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:26,604 INFO L87 Difference]: Start difference. First operand 188 states and 274 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:26,637 INFO L93 Difference]: Finished difference Result 196 states and 283 transitions. [2025-03-03 14:51:26,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:51:26,638 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-03-03 14:51:26,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:26,639 INFO L225 Difference]: With dead ends: 196 [2025-03-03 14:51:26,639 INFO L226 Difference]: Without dead ends: 194 [2025-03-03 14:51:26,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:51:26,639 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:26,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:26,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-03 14:51:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-03 14:51:26,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4455958549222798) internal successors, (279), 193 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 279 transitions. [2025-03-03 14:51:26,653 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 279 transitions. Word has length 56 [2025-03-03 14:51:26,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:26,653 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 279 transitions. [2025-03-03 14:51:26,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,653 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 279 transitions. [2025-03-03 14:51:26,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:26,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:26,654 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] [2025-03-03 14:51:26,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:51:26,655 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:26,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:26,655 INFO L85 PathProgramCache]: Analyzing trace with hash -756987776, now seen corresponding path program 1 times [2025-03-03 14:51:26,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:26,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662390695] [2025-03-03 14:51:26,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:26,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:26,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:26,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:26,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662390695] [2025-03-03 14:51:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662390695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:26,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:26,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479042541] [2025-03-03 14:51:26,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:26,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:26,735 INFO L87 Difference]: Start difference. First operand 194 states and 279 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:26,750 INFO L93 Difference]: Finished difference Result 364 states and 540 transitions. [2025-03-03 14:51:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:26,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:26,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:26,752 INFO L225 Difference]: With dead ends: 364 [2025-03-03 14:51:26,752 INFO L226 Difference]: Without dead ends: 276 [2025-03-03 14:51:26,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:26,753 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 224 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-03 14:51:26,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-03-03 14:51:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2025-03-03 14:51:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 273 states have (on average 1.465201465201465) internal successors, (400), 273 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 400 transitions. [2025-03-03 14:51:26,766 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 400 transitions. Word has length 57 [2025-03-03 14:51:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:26,766 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 400 transitions. [2025-03-03 14:51:26,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 400 transitions. [2025-03-03 14:51:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:26,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:26,768 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] [2025-03-03 14:51:26,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:51:26,769 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:26,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:26,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1735918272, now seen corresponding path program 1 times [2025-03-03 14:51:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:26,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179757585] [2025-03-03 14:51:26,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:26,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:26,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:26,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:26,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179757585] [2025-03-03 14:51:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179757585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7984324] [2025-03-03 14:51:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:26,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:26,819 INFO L87 Difference]: Start difference. First operand 274 states and 400 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:26,840 INFO L93 Difference]: Finished difference Result 720 states and 1080 transitions. [2025-03-03 14:51:26,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:26,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:26,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:26,842 INFO L225 Difference]: With dead ends: 720 [2025-03-03 14:51:26,842 INFO L226 Difference]: Without dead ends: 485 [2025-03-03 14:51:26,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:26,843 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 230 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-03 14:51:26,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 230 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:26,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-03-03 14:51:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 483. [2025-03-03 14:51:26,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 482 states have (on average 1.4771784232365146) internal successors, (712), 482 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 712 transitions. [2025-03-03 14:51:26,857 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 712 transitions. Word has length 57 [2025-03-03 14:51:26,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:26,857 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 712 transitions. [2025-03-03 14:51:26,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 712 transitions. [2025-03-03 14:51:26,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:26,857 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:26,857 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] [2025-03-03 14:51:26,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:51:26,859 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:26,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:26,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2111103488, now seen corresponding path program 1 times [2025-03-03 14:51:26,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:26,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956632920] [2025-03-03 14:51:26,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:26,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:26,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:26,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:26,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:26,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-03 14:51:26,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:26,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956632920] [2025-03-03 14:51:26,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956632920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:26,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:26,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:26,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002642254] [2025-03-03 14:51:26,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:26,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:26,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:26,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:26,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:26,902 INFO L87 Difference]: Start difference. First operand 483 states and 712 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:26,925 INFO L93 Difference]: Finished difference Result 1323 states and 1974 transitions. [2025-03-03 14:51:26,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:26,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:26,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:26,928 INFO L225 Difference]: With dead ends: 1323 [2025-03-03 14:51:26,928 INFO L226 Difference]: Without dead ends: 879 [2025-03-03 14:51:26,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:26,929 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 53 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 232 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-03 14:51:26,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 232 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:26,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-03 14:51:26,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2025-03-03 14:51:26,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 876 states have (on average 1.4703196347031964) internal successors, (1288), 876 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1288 transitions. [2025-03-03 14:51:26,961 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1288 transitions. Word has length 57 [2025-03-03 14:51:26,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:26,962 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1288 transitions. [2025-03-03 14:51:26,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:26,962 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1288 transitions. [2025-03-03 14:51:26,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:26,962 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:26,962 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] [2025-03-03 14:51:26,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:51:26,963 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:26,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:26,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1768687936, now seen corresponding path program 1 times [2025-03-03 14:51:26,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:26,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023179861] [2025-03-03 14:51:26,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:26,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:26,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:26,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:26,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:26,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:27,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:27,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:27,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023179861] [2025-03-03 14:51:27,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023179861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:27,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:27,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:27,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769014124] [2025-03-03 14:51:27,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:27,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:27,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:27,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:27,013 INFO L87 Difference]: Start difference. First operand 877 states and 1288 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:27,043 INFO L93 Difference]: Finished difference Result 2457 states and 3618 transitions. [2025-03-03 14:51:27,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:27,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:27,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:27,049 INFO L225 Difference]: With dead ends: 2457 [2025-03-03 14:51:27,049 INFO L226 Difference]: Without dead ends: 1619 [2025-03-03 14:51:27,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:27,051 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 51 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 234 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-03 14:51:27,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 234 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-03-03 14:51:27,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1617. [2025-03-03 14:51:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1617 states, 1616 states have (on average 1.4504950495049505) internal successors, (2344), 1616 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 2344 transitions. [2025-03-03 14:51:27,105 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 2344 transitions. Word has length 57 [2025-03-03 14:51:27,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:27,105 INFO L471 AbstractCegarLoop]: Abstraction has 1617 states and 2344 transitions. [2025-03-03 14:51:27,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 2344 transitions. [2025-03-03 14:51:27,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 14:51:27,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:27,106 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] [2025-03-03 14:51:27,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:51:27,106 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:27,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:27,107 INFO L85 PathProgramCache]: Analyzing trace with hash 2039561088, now seen corresponding path program 1 times [2025-03-03 14:51:27,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:27,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279094048] [2025-03-03 14:51:27,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:27,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:27,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 14:51:27,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 14:51:27,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:27,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:27,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:27,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:27,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279094048] [2025-03-03 14:51:27,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279094048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:27,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:27,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964141358] [2025-03-03 14:51:27,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:27,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:27,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:27,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:27,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:27,158 INFO L87 Difference]: Start difference. First operand 1617 states and 2344 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:27,214 INFO L93 Difference]: Finished difference Result 4581 states and 6618 transitions. [2025-03-03 14:51:27,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:27,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 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 57 [2025-03-03 14:51:27,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:27,223 INFO L225 Difference]: With dead ends: 4581 [2025-03-03 14:51:27,223 INFO L226 Difference]: Without dead ends: 3003 [2025-03-03 14:51:27,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:27,228 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 49 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 236 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-03 14:51:27,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 236 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:27,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2025-03-03 14:51:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 3001. [2025-03-03 14:51:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3001 states, 3000 states have (on average 1.4213333333333333) internal successors, (4264), 3000 states have internal predecessors, (4264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3001 states to 3001 states and 4264 transitions. [2025-03-03 14:51:27,315 INFO L78 Accepts]: Start accepts. Automaton has 3001 states and 4264 transitions. Word has length 57 [2025-03-03 14:51:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:27,315 INFO L471 AbstractCegarLoop]: Abstraction has 3001 states and 4264 transitions. [2025-03-03 14:51:27,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,316 INFO L276 IsEmpty]: Start isEmpty. Operand 3001 states and 4264 transitions. [2025-03-03 14:51:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:27,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:27,318 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] [2025-03-03 14:51:27,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:51:27,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:27,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:27,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1854090898, now seen corresponding path program 1 times [2025-03-03 14:51:27,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:27,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843891502] [2025-03-03 14:51:27,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:27,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:27,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:27,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:27,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:27,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:27,467 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:27,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843891502] [2025-03-03 14:51:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843891502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:27,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:27,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:27,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323155136] [2025-03-03 14:51:27,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:27,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:27,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:27,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:27,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:27,468 INFO L87 Difference]: Start difference. First operand 3001 states and 4264 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:27,804 INFO L93 Difference]: Finished difference Result 17605 states and 25070 transitions. [2025-03-03 14:51:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:27,804 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 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 76 [2025-03-03 14:51:27,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:27,850 INFO L225 Difference]: With dead ends: 17605 [2025-03-03 14:51:27,850 INFO L226 Difference]: Without dead ends: 15491 [2025-03-03 14:51:27,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:27,857 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 551 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:27,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 816 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:27,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15491 states. [2025-03-03 14:51:28,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15491 to 5545. [2025-03-03 14:51:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5545 states, 5544 states have (on average 1.4155844155844155) internal successors, (7848), 5544 states have internal predecessors, (7848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5545 states to 5545 states and 7848 transitions. [2025-03-03 14:51:28,068 INFO L78 Accepts]: Start accepts. Automaton has 5545 states and 7848 transitions. Word has length 76 [2025-03-03 14:51:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:28,068 INFO L471 AbstractCegarLoop]: Abstraction has 5545 states and 7848 transitions. [2025-03-03 14:51:28,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5545 states and 7848 transitions. [2025-03-03 14:51:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:28,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:28,071 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] [2025-03-03 14:51:28,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:51:28,071 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:28,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash 875160402, now seen corresponding path program 1 times [2025-03-03 14:51:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510592523] [2025-03-03 14:51:28,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:28,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:28,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:28,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:28,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 14:51:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510592523] [2025-03-03 14:51:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510592523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:28,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354338136] [2025-03-03 14:51:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:28,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:28,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:28,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:28,208 INFO L87 Difference]: Start difference. First operand 5545 states and 7848 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:28,504 INFO L93 Difference]: Finished difference Result 20565 states and 29262 transitions. [2025-03-03 14:51:28,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:28,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 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 76 [2025-03-03 14:51:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:28,539 INFO L225 Difference]: With dead ends: 20565 [2025-03-03 14:51:28,540 INFO L226 Difference]: Without dead ends: 17603 [2025-03-03 14:51:28,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:28,550 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 553 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:28,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 787 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:28,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17603 states. [2025-03-03 14:51:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17603 to 9561. [2025-03-03 14:51:28,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9561 states, 9560 states have (on average 1.4117154811715482) internal successors, (13496), 9560 states have internal predecessors, (13496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9561 states to 9561 states and 13496 transitions. [2025-03-03 14:51:28,842 INFO L78 Accepts]: Start accepts. Automaton has 9561 states and 13496 transitions. Word has length 76 [2025-03-03 14:51:28,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:28,842 INFO L471 AbstractCegarLoop]: Abstraction has 9561 states and 13496 transitions. [2025-03-03 14:51:28,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:28,842 INFO L276 IsEmpty]: Start isEmpty. Operand 9561 states and 13496 transitions. [2025-03-03 14:51:28,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:28,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:28,846 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] [2025-03-03 14:51:28,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:51:28,847 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:28,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:28,847 INFO L85 PathProgramCache]: Analyzing trace with hash 427214866, now seen corresponding path program 1 times [2025-03-03 14:51:28,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:28,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156179207] [2025-03-03 14:51:28,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:28,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:28,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:28,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:28,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:28,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:28,995 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 14:51:28,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:28,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156179207] [2025-03-03 14:51:28,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156179207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:28,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:28,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130231478] [2025-03-03 14:51:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:28,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:28,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:28,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:28,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:28,997 INFO L87 Difference]: Start difference. First operand 9561 states and 13496 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:29,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:29,394 INFO L93 Difference]: Finished difference Result 23525 states and 33438 transitions. [2025-03-03 14:51:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:29,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 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 76 [2025-03-03 14:51:29,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:29,427 INFO L225 Difference]: With dead ends: 23525 [2025-03-03 14:51:29,427 INFO L226 Difference]: Without dead ends: 20563 [2025-03-03 14:51:29,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:29,437 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 575 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:29,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 755 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:29,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20563 states. [2025-03-03 14:51:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20563 to 12521. [2025-03-03 14:51:29,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12521 states, 12520 states have (on average 1.4115015974440894) internal successors, (17672), 12520 states have internal predecessors, (17672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12521 states to 12521 states and 17672 transitions. [2025-03-03 14:51:29,775 INFO L78 Accepts]: Start accepts. Automaton has 12521 states and 17672 transitions. Word has length 76 [2025-03-03 14:51:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:29,775 INFO L471 AbstractCegarLoop]: Abstraction has 12521 states and 17672 transitions. [2025-03-03 14:51:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12521 states and 17672 transitions. [2025-03-03 14:51:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:29,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:29,777 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] [2025-03-03 14:51:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:51:29,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:29,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash 842390738, now seen corresponding path program 1 times [2025-03-03 14:51:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:29,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577288141] [2025-03-03 14:51:29,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:29,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:29,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:29,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:29,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:29,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:51:29,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:29,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577288141] [2025-03-03 14:51:29,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577288141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:29,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:29,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:29,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450652390] [2025-03-03 14:51:29,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:29,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:29,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:29,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:29,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:29,892 INFO L87 Difference]: Start difference. First operand 12521 states and 17672 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:30,232 INFO L93 Difference]: Finished difference Result 26485 states and 37614 transitions. [2025-03-03 14:51:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:30,233 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 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 76 [2025-03-03 14:51:30,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:30,268 INFO L225 Difference]: With dead ends: 26485 [2025-03-03 14:51:30,268 INFO L226 Difference]: Without dead ends: 23523 [2025-03-03 14:51:30,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:30,278 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 613 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:30,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 748 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:30,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23523 states. [2025-03-03 14:51:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23523 to 15481. [2025-03-03 14:51:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15481 states, 15480 states have (on average 1.4113695090439276) internal successors, (21848), 15480 states have internal predecessors, (21848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15481 states to 15481 states and 21848 transitions. [2025-03-03 14:51:30,624 INFO L78 Accepts]: Start accepts. Automaton has 15481 states and 21848 transitions. Word has length 76 [2025-03-03 14:51:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:30,624 INFO L471 AbstractCegarLoop]: Abstraction has 15481 states and 21848 transitions. [2025-03-03 14:51:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15481 states and 21848 transitions. [2025-03-03 14:51:30,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:51:30,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:30,627 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] [2025-03-03 14:51:30,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:51:30,627 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:30,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:30,628 INFO L85 PathProgramCache]: Analyzing trace with hash 355672466, now seen corresponding path program 1 times [2025-03-03 14:51:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:30,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536031187] [2025-03-03 14:51:30,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:30,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-03 14:51:30,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:51:30,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:30,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-03 14:51:30,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:30,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536031187] [2025-03-03 14:51:30,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536031187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:30,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:30,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 14:51:30,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97078346] [2025-03-03 14:51:30,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:30,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:51:30,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:30,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:51:30,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:51:30,729 INFO L87 Difference]: Start difference. First operand 15481 states and 21848 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-03 14:51:31,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:31,287 INFO L93 Difference]: Finished difference Result 29445 states and 41790 transitions. [2025-03-03 14:51:31,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:51:31,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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 76 [2025-03-03 14:51:31,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:31,336 INFO L225 Difference]: With dead ends: 29445 [2025-03-03 14:51:31,337 INFO L226 Difference]: Without dead ends: 26483 [2025-03-03 14:51:31,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:51:31,350 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 571 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:31,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 797 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:51:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26483 states. [2025-03-03 14:51:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26483 to 18441. [2025-03-03 14:51:31,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18441 states, 18440 states have (on average 1.4112798264642084) internal successors, (26024), 18440 states have internal predecessors, (26024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18441 states to 18441 states and 26024 transitions. [2025-03-03 14:51:31,839 INFO L78 Accepts]: Start accepts. Automaton has 18441 states and 26024 transitions. Word has length 76 [2025-03-03 14:51:31,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:31,840 INFO L471 AbstractCegarLoop]: Abstraction has 18441 states and 26024 transitions. [2025-03-03 14:51:31,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 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-03 14:51:31,840 INFO L276 IsEmpty]: Start isEmpty. Operand 18441 states and 26024 transitions. [2025-03-03 14:51:31,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-03 14:51:31,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:31,842 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] [2025-03-03 14:51:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:51:31,843 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:31,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:31,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2049881883, now seen corresponding path program 1 times [2025-03-03 14:51:31,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774994260] [2025-03-03 14:51:31,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:31,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:31,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-03 14:51:31,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-03 14:51:31,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:31,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774994260] [2025-03-03 14:51:31,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774994260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:31,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:31,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:31,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382970719] [2025-03-03 14:51:31,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:31,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:31,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:31,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:31,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:31,910 INFO L87 Difference]: Start difference. First operand 18441 states and 26024 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:32,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:32,110 INFO L93 Difference]: Finished difference Result 36845 states and 52010 transitions. [2025-03-03 14:51:32,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:32,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2025-03-03 14:51:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:32,139 INFO L225 Difference]: With dead ends: 36845 [2025-03-03 14:51:32,139 INFO L226 Difference]: Without dead ends: 18443 [2025-03-03 14:51:32,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:32,156 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 45 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 230 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-03 14:51:32,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 230 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:32,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2025-03-03 14:51:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 18441. [2025-03-03 14:51:32,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18441 states, 18440 states have (on average 1.3952277657266812) internal successors, (25728), 18440 states have internal predecessors, (25728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18441 states to 18441 states and 25728 transitions. [2025-03-03 14:51:32,491 INFO L78 Accepts]: Start accepts. Automaton has 18441 states and 25728 transitions. Word has length 77 [2025-03-03 14:51:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:32,491 INFO L471 AbstractCegarLoop]: Abstraction has 18441 states and 25728 transitions. [2025-03-03 14:51:32,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 18441 states and 25728 transitions. [2025-03-03 14:51:32,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-03 14:51:32,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:32,493 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] [2025-03-03 14:51:32,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:51:32,493 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:32,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash 368232752, now seen corresponding path program 1 times [2025-03-03 14:51:32,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:32,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187054817] [2025-03-03 14:51:32,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:32,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:32,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-03 14:51:32,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-03 14:51:32,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:32,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:32,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:32,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187054817] [2025-03-03 14:51:32,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187054817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:32,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:32,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:32,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525476867] [2025-03-03 14:51:32,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:32,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:32,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:32,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:32,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:32,559 INFO L87 Difference]: Start difference. First operand 18441 states and 25728 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-03 14:51:32,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:32,658 INFO L93 Difference]: Finished difference Result 25328 states and 35422 transitions. [2025-03-03 14:51:32,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:32,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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 78 [2025-03-03 14:51:32,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:32,669 INFO L225 Difference]: With dead ends: 25328 [2025-03-03 14:51:32,669 INFO L226 Difference]: Without dead ends: 6926 [2025-03-03 14:51:32,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:32,683 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 39 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 227 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-03 14:51:32,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 227 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:32,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6926 states. [2025-03-03 14:51:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6926 to 6918. [2025-03-03 14:51:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6918 states, 6917 states have (on average 1.3909209194737604) internal successors, (9621), 6917 states have internal predecessors, (9621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:32,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6918 states to 6918 states and 9621 transitions. [2025-03-03 14:51:32,790 INFO L78 Accepts]: Start accepts. Automaton has 6918 states and 9621 transitions. Word has length 78 [2025-03-03 14:51:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:32,790 INFO L471 AbstractCegarLoop]: Abstraction has 6918 states and 9621 transitions. [2025-03-03 14:51:32,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 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-03 14:51:32,790 INFO L276 IsEmpty]: Start isEmpty. Operand 6918 states and 9621 transitions. [2025-03-03 14:51:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-03 14:51:32,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:32,792 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] [2025-03-03 14:51:32,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:51:32,792 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:32,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:32,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1244362846, now seen corresponding path program 1 times [2025-03-03 14:51:32,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:32,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936652895] [2025-03-03 14:51:32,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:32,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:32,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-03 14:51:32,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-03 14:51:32,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:32,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:32,871 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:32,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:32,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936652895] [2025-03-03 14:51:32,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936652895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:32,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:32,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:32,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509293865] [2025-03-03 14:51:32,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:32,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:32,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:32,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:32,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:32,872 INFO L87 Difference]: Start difference. First operand 6918 states and 9621 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:32,919 INFO L93 Difference]: Finished difference Result 10354 states and 14407 transitions. [2025-03-03 14:51:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:32,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 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 79 [2025-03-03 14:51:32,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:32,925 INFO L225 Difference]: With dead ends: 10354 [2025-03-03 14:51:32,926 INFO L226 Difference]: Without dead ends: 3488 [2025-03-03 14:51:32,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:32,931 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 206 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-03 14:51:32,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2025-03-03 14:51:32,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3486. [2025-03-03 14:51:32,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3486 states, 3485 states have (on average 1.3730272596843616) internal successors, (4785), 3485 states have internal predecessors, (4785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3486 states to 3486 states and 4785 transitions. [2025-03-03 14:51:32,983 INFO L78 Accepts]: Start accepts. Automaton has 3486 states and 4785 transitions. Word has length 79 [2025-03-03 14:51:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:32,983 INFO L471 AbstractCegarLoop]: Abstraction has 3486 states and 4785 transitions. [2025-03-03 14:51:32,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3486 states and 4785 transitions. [2025-03-03 14:51:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-03 14:51:32,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:32,984 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] [2025-03-03 14:51:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:51:32,984 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:32,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1002651977, now seen corresponding path program 1 times [2025-03-03 14:51:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778265917] [2025-03-03 14:51:32,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:32,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:32,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-03 14:51:33,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-03 14:51:33,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:33,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:33,050 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:33,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:33,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778265917] [2025-03-03 14:51:33,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778265917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:33,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668344894] [2025-03-03 14:51:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:33,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:33,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:33,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:33,052 INFO L87 Difference]: Start difference. First operand 3486 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:33,080 INFO L93 Difference]: Finished difference Result 5206 states and 7153 transitions. [2025-03-03 14:51:33,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:33,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2025-03-03 14:51:33,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:33,083 INFO L225 Difference]: With dead ends: 5206 [2025-03-03 14:51:33,084 INFO L226 Difference]: Without dead ends: 1772 [2025-03-03 14:51:33,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:33,087 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 38 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 191 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-03 14:51:33,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 191 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:33,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2025-03-03 14:51:33,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1770. [2025-03-03 14:51:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1770 states, 1769 states have (on average 1.3527416619559074) internal successors, (2393), 1769 states have internal predecessors, (2393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1770 states to 1770 states and 2393 transitions. [2025-03-03 14:51:33,113 INFO L78 Accepts]: Start accepts. Automaton has 1770 states and 2393 transitions. Word has length 81 [2025-03-03 14:51:33,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:33,114 INFO L471 AbstractCegarLoop]: Abstraction has 1770 states and 2393 transitions. [2025-03-03 14:51:33,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1770 states and 2393 transitions. [2025-03-03 14:51:33,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-03 14:51:33,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:33,115 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] [2025-03-03 14:51:33,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:51:33,115 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:33,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:33,115 INFO L85 PathProgramCache]: Analyzing trace with hash -2095885296, now seen corresponding path program 1 times [2025-03-03 14:51:33,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:33,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667066462] [2025-03-03 14:51:33,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:33,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:33,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-03 14:51:33,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-03 14:51:33,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:33,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:33,179 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:33,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:33,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667066462] [2025-03-03 14:51:33,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667066462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:51:33,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:51:33,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:51:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697598094] [2025-03-03 14:51:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:51:33,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:51:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:33,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:51:33,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:33,180 INFO L87 Difference]: Start difference. First operand 1770 states and 2393 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:33,198 INFO L93 Difference]: Finished difference Result 2632 states and 3565 transitions. [2025-03-03 14:51:33,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:51:33,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-03 14:51:33,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:33,201 INFO L225 Difference]: With dead ends: 2632 [2025-03-03 14:51:33,201 INFO L226 Difference]: Without dead ends: 914 [2025-03-03 14:51:33,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:51:33,203 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 176 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-03 14:51:33,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:51:33,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-03 14:51:33,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 912. [2025-03-03 14:51:33,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 911 states have (on average 1.3282107574094402) internal successors, (1210), 911 states have internal predecessors, (1210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1210 transitions. [2025-03-03 14:51:33,222 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1210 transitions. Word has length 83 [2025-03-03 14:51:33,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:33,222 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1210 transitions. [2025-03-03 14:51:33,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:33,222 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1210 transitions. [2025-03-03 14:51:33,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-03 14:51:33,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:33,223 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] [2025-03-03 14:51:33,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:51:33,223 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:33,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:33,224 INFO L85 PathProgramCache]: Analyzing trace with hash 615460855, now seen corresponding path program 1 times [2025-03-03 14:51:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:33,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080062178] [2025-03-03 14:51:33,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:33,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:33,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:51:33,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:51:33,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:33,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:34,113 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-03 14:51:34,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080062178] [2025-03-03 14:51:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080062178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135890763] [2025-03-03 14:51:34,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:34,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:34,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:34,116 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:34,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:51:34,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-03 14:51:34,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-03 14:51:34,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:34,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:34,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 14:51:34,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:34,405 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:51:34,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135890763] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:34,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:34,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 4] total 19 [2025-03-03 14:51:34,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492233509] [2025-03-03 14:51:34,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:34,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-03 14:51:34,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:34,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-03 14:51:34,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-03-03 14:51:34,761 INFO L87 Difference]: Start difference. First operand 912 states and 1210 transitions. Second operand has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:37,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:37,775 INFO L93 Difference]: Finished difference Result 7036 states and 9327 transitions. [2025-03-03 14:51:37,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-03 14:51:37,775 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 0 states have call successors, (0), 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 85 [2025-03-03 14:51:37,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:37,785 INFO L225 Difference]: With dead ends: 7036 [2025-03-03 14:51:37,786 INFO L226 Difference]: Without dead ends: 6176 [2025-03-03 14:51:37,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1042, Invalid=4658, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 14:51:37,790 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 2326 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:37,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 755 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:51:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2025-03-03 14:51:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 5914. [2025-03-03 14:51:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5914 states, 5913 states have (on average 1.2856418061897514) internal successors, (7602), 5913 states have internal predecessors, (7602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:37,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5914 states to 5914 states and 7602 transitions. [2025-03-03 14:51:37,898 INFO L78 Accepts]: Start accepts. Automaton has 5914 states and 7602 transitions. Word has length 85 [2025-03-03 14:51:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:37,898 INFO L471 AbstractCegarLoop]: Abstraction has 5914 states and 7602 transitions. [2025-03-03 14:51:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.578947368421053) internal successors, (239), 19 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 5914 states and 7602 transitions. [2025-03-03 14:51:37,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:51:37,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:37,899 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:37,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:38,100 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,SelfDestructingSolverStorable20 [2025-03-03 14:51:38,101 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:38,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash -269461831, now seen corresponding path program 1 times [2025-03-03 14:51:38,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:38,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367512417] [2025-03-03 14:51:38,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:38,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:51:38,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:51:38,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:38,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:38,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367512417] [2025-03-03 14:51:38,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367512417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:38,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005249987] [2025-03-03 14:51:38,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:38,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:38,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:38,361 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:38,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:51:38,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:51:38,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:51:38,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:38,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:38,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 14:51:38,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:39,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:39,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005249987] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:40,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:40,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 33 [2025-03-03 14:51:40,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531927315] [2025-03-03 14:51:40,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:40,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 14:51:40,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:40,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 14:51:40,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=904, Unknown=0, NotChecked=0, Total=1056 [2025-03-03 14:51:40,496 INFO L87 Difference]: Start difference. First operand 5914 states and 7602 transitions. Second operand has 33 states, 33 states have (on average 7.03030303030303) internal successors, (232), 33 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-03 14:51:43,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:43,445 INFO L93 Difference]: Finished difference Result 18136 states and 23429 transitions. [2025-03-03 14:51:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-03 14:51:43,446 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 7.03030303030303) internal successors, (232), 33 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 86 [2025-03-03 14:51:43,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:43,465 INFO L225 Difference]: With dead ends: 18136 [2025-03-03 14:51:43,465 INFO L226 Difference]: Without dead ends: 12367 [2025-03-03 14:51:43,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1482, Invalid=6000, Unknown=0, NotChecked=0, Total=7482 [2025-03-03 14:51:43,474 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 3464 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3464 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 915 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:43,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3464 Valid, 968 Invalid, 915 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:51:43,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12367 states. [2025-03-03 14:51:43,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12367 to 11749. [2025-03-03 14:51:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11749 states, 11748 states have (on average 1.2725570309839973) internal successors, (14950), 11748 states have internal predecessors, (14950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11749 states to 11749 states and 14950 transitions. [2025-03-03 14:51:43,756 INFO L78 Accepts]: Start accepts. Automaton has 11749 states and 14950 transitions. Word has length 86 [2025-03-03 14:51:43,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:43,756 INFO L471 AbstractCegarLoop]: Abstraction has 11749 states and 14950 transitions. [2025-03-03 14:51:43,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 7.03030303030303) internal successors, (232), 33 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-03 14:51:43,757 INFO L276 IsEmpty]: Start isEmpty. Operand 11749 states and 14950 transitions. [2025-03-03 14:51:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-03 14:51:43,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:43,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:43,764 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-03 14:51:43,962 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,SelfDestructingSolverStorable21 [2025-03-03 14:51:43,963 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:43,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:43,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2120871737, now seen corresponding path program 1 times [2025-03-03 14:51:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:43,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406009099] [2025-03-03 14:51:43,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:43,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:43,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:51:43,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:51:43,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:43,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:44,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:44,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406009099] [2025-03-03 14:51:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406009099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348020969] [2025-03-03 14:51:44,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:44,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:44,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:44,506 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:44,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:51:44,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-03 14:51:44,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-03 14:51:44,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:44,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:44,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:51:44,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:44,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:45,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348020969] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:45,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:45,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 25 [2025-03-03 14:51:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858862381] [2025-03-03 14:51:45,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:45,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 14:51:45,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:45,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 14:51:45,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:51:45,332 INFO L87 Difference]: Start difference. First operand 11749 states and 14950 transitions. Second operand has 26 states, 26 states have (on average 7.961538461538462) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:46,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:46,101 INFO L93 Difference]: Finished difference Result 33765 states and 43213 transitions. [2025-03-03 14:51:46,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-03 14:51:46,101 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 7.961538461538462) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 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 86 [2025-03-03 14:51:46,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:46,127 INFO L225 Difference]: With dead ends: 33765 [2025-03-03 14:51:46,127 INFO L226 Difference]: Without dead ends: 24151 [2025-03-03 14:51:46,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=295, Invalid=1111, Unknown=0, NotChecked=0, Total=1406 [2025-03-03 14:51:46,136 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 943 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:46,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 652 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:51:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24151 states. [2025-03-03 14:51:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24151 to 23851. [2025-03-03 14:51:46,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23851 states, 23850 states have (on average 1.260167714884696) internal successors, (30055), 23850 states have internal predecessors, (30055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:46,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23851 states to 23851 states and 30055 transitions. [2025-03-03 14:51:46,647 INFO L78 Accepts]: Start accepts. Automaton has 23851 states and 30055 transitions. Word has length 86 [2025-03-03 14:51:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:46,647 INFO L471 AbstractCegarLoop]: Abstraction has 23851 states and 30055 transitions. [2025-03-03 14:51:46,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 7.961538461538462) internal successors, (207), 25 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:46,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23851 states and 30055 transitions. [2025-03-03 14:51:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-03 14:51:46,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:46,648 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:46,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:51:46,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:46,849 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash -142516368, now seen corresponding path program 1 times [2025-03-03 14:51:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288949929] [2025-03-03 14:51:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:46,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:51:46,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:51:46,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:46,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:47,140 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:47,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288949929] [2025-03-03 14:51:47,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288949929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:47,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983942750] [2025-03-03 14:51:47,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:47,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:47,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:47,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:47,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:51:47,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-03 14:51:47,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-03 14:51:47,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:47,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:47,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:51:47,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:47,517 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:48,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983942750] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:48,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:48,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-03 14:51:48,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570479855] [2025-03-03 14:51:48,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:48,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:51:48,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:48,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:51:48,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:51:48,138 INFO L87 Difference]: Start difference. First operand 23851 states and 30055 transitions. Second operand has 22 states, 22 states have (on average 8.727272727272727) internal successors, (192), 21 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:49,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:51:49,201 INFO L93 Difference]: Finished difference Result 69076 states and 87056 transitions. [2025-03-03 14:51:49,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:51:49,202 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 8.727272727272727) internal successors, (192), 21 states have internal predecessors, (192), 0 states have call successors, (0), 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 87 [2025-03-03 14:51:49,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:51:49,250 INFO L225 Difference]: With dead ends: 69076 [2025-03-03 14:51:49,250 INFO L226 Difference]: Without dead ends: 46721 [2025-03-03 14:51:49,265 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:51:49,266 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 757 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:51:49,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 602 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:51:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46721 states. [2025-03-03 14:51:50,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46721 to 46717. [2025-03-03 14:51:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46717 states, 46716 states have (on average 1.2525901190170392) internal successors, (58516), 46716 states have internal predecessors, (58516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46717 states to 46717 states and 58516 transitions. [2025-03-03 14:51:50,335 INFO L78 Accepts]: Start accepts. Automaton has 46717 states and 58516 transitions. Word has length 87 [2025-03-03 14:51:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:51:50,335 INFO L471 AbstractCegarLoop]: Abstraction has 46717 states and 58516 transitions. [2025-03-03 14:51:50,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 8.727272727272727) internal successors, (192), 21 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:51:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 46717 states and 58516 transitions. [2025-03-03 14:51:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:51:50,336 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:51:50,337 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:51:50,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:51:50,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:50,537 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:51:50,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:51:50,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1226602882, now seen corresponding path program 1 times [2025-03-03 14:51:50,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:51:50,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121083303] [2025-03-03 14:51:50,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:50,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:51:50,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:51:50,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:51:50,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:50,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:50,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:51:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121083303] [2025-03-03 14:51:50,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121083303] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:51:50,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645401250] [2025-03-03 14:51:50,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:51:50,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:51:50,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:51:50,921 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:51:50,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:51:50,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-03 14:51:51,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:51:51,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:51:51,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:51:51,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-03-03 14:51:51,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:51:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:55,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:51:59,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:51:59,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645401250] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:51:59,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:51:59,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 29, 32] total 65 [2025-03-03 14:51:59,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420561141] [2025-03-03 14:51:59,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:51:59,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-03 14:51:59,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:51:59,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-03 14:51:59,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=3515, Unknown=0, NotChecked=0, Total=4160 [2025-03-03 14:51:59,668 INFO L87 Difference]: Start difference. First operand 46717 states and 58516 transitions. Second operand has 65 states, 65 states have (on average 3.769230769230769) internal successors, (245), 65 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:52:23,757 INFO L93 Difference]: Finished difference Result 299893 states and 374447 transitions. [2025-03-03 14:52:23,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2025-03-03 14:52:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.769230769230769) internal successors, (245), 65 states have internal predecessors, (245), 0 states have call successors, (0), 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 88 [2025-03-03 14:52:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:52:24,203 INFO L225 Difference]: With dead ends: 299893 [2025-03-03 14:52:24,204 INFO L226 Difference]: Without dead ends: 257956 [2025-03-03 14:52:24,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20476 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=11092, Invalid=41120, Unknown=0, NotChecked=0, Total=52212 [2025-03-03 14:52:24,281 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 5694 mSDsluCounter, 3211 mSDsCounter, 0 mSdLazyCounter, 4481 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5694 SdHoareTripleChecker+Valid, 3358 SdHoareTripleChecker+Invalid, 4695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 4481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-03 14:52:24,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5694 Valid, 3358 Invalid, 4695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 4481 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-03 14:52:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257956 states. [2025-03-03 14:52:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257956 to 105030. [2025-03-03 14:52:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105030 states, 105029 states have (on average 1.2388578392634415) internal successors, (130116), 105029 states have internal predecessors, (130116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105030 states to 105030 states and 130116 transitions. [2025-03-03 14:52:28,831 INFO L78 Accepts]: Start accepts. Automaton has 105030 states and 130116 transitions. Word has length 88 [2025-03-03 14:52:28,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:52:28,831 INFO L471 AbstractCegarLoop]: Abstraction has 105030 states and 130116 transitions. [2025-03-03 14:52:28,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.769230769230769) internal successors, (245), 65 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:52:28,832 INFO L276 IsEmpty]: Start isEmpty. Operand 105030 states and 130116 transitions. [2025-03-03 14:52:28,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-03 14:52:28,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:52:28,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:52:28,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:52:29,036 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,SelfDestructingSolverStorable24 [2025-03-03 14:52:29,036 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:52:29,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:52:29,037 INFO L85 PathProgramCache]: Analyzing trace with hash -564615024, now seen corresponding path program 1 times [2025-03-03 14:52:29,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:52:29,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655742501] [2025-03-03 14:52:29,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:29,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:52:29,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:29,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:29,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:29,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:31,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:31,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:52:31,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655742501] [2025-03-03 14:52:31,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655742501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:52:31,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4740300] [2025-03-03 14:52:31,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:52:31,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:52:31,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:52:31,108 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:52:31,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:52:31,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-03 14:52:31,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-03 14:52:31,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:52:31,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:52:31,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-03-03 14:52:31,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:52:32,445 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:32,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:52:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:52:34,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4740300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:52:34,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:52:34,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 21, 22] total 69 [2025-03-03 14:52:34,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486133336] [2025-03-03 14:52:34,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:52:34,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2025-03-03 14:52:34,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:52:34,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2025-03-03 14:52:34,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=4372, Unknown=0, NotChecked=0, Total=4692 [2025-03-03 14:52:34,869 INFO L87 Difference]: Start difference. First operand 105030 states and 130116 transitions. Second operand has 69 states, 69 states have (on average 3.652173913043478) internal successors, (252), 69 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)