./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash 65758d30abe63111d5fe7d6f3755a15e393bf1c256a01ab73d247ce5927c073a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 18:18:34,871 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 18:18:34,914 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 18:18:34,921 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 18:18:34,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 18:18:34,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 18:18:34,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 18:18:34,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 18:18:34,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 18:18:34,947 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 18:18:34,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 18:18:34,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 18:18:34,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 18:18:34,948 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 18:18:34,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 18:18:34,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 18:18:34,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 18:18:34,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 18:18:34,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 18:18:34,949 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 18:18:34,949 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:18:34,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 18:18:34,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 18:18:34,950 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65758d30abe63111d5fe7d6f3755a15e393bf1c256a01ab73d247ce5927c073a [2025-03-03 18:18:35,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 18:18:35,171 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 18:18:35,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 18:18:35,173 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 18:18:35,174 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 18:18:35,176 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c [2025-03-03 18:18:36,305 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecad62fb/da8ea04e79814f73a5a54437be3426c5/FLAG1fc04e1ef [2025-03-03 18:18:36,568 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 18:18:36,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c [2025-03-03 18:18:36,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecad62fb/da8ea04e79814f73a5a54437be3426c5/FLAG1fc04e1ef [2025-03-03 18:18:36,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ecad62fb/da8ea04e79814f73a5a54437be3426c5 [2025-03-03 18:18:36,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 18:18:36,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 18:18:36,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 18:18:36,893 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 18:18:36,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 18:18:36,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:18:36" (1/1) ... [2025-03-03 18:18:36,896 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cf2b30e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:36, skipping insertion in model container [2025-03-03 18:18:36,896 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 06:18:36" (1/1) ... [2025-03-03 18:18:36,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 18:18:37,038 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c[1251,1264] [2025-03-03 18:18:37,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:18:37,208 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 18:18:37,215 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/hardware-verification-bv/btor2c-lazyMod.sw_ball2001.c[1251,1264] [2025-03-03 18:18:37,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 18:18:37,309 INFO L204 MainTranslator]: Completed translation [2025-03-03 18:18:37,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37 WrapperNode [2025-03-03 18:18:37,310 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 18:18:37,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 18:18:37,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 18:18:37,311 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 18:18:37,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,346 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,483 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1563 [2025-03-03 18:18:37,483 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 18:18:37,484 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 18:18:37,484 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 18:18:37,484 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 18:18:37,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,642 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 18:18:37,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,680 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,713 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 18:18:37,736 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 18:18:37,736 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 18:18:37,736 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 18:18:37,737 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (1/1) ... [2025-03-03 18:18:37,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 18:18:37,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:18:37,764 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 18:18:37,773 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 18:18:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 18:18:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 18:18:37,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 18:18:37,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 18:18:37,961 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 18:18:37,963 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 18:18:39,258 INFO L? ?]: Removed 994 outVars from TransFormulas that were not future-live. [2025-03-03 18:18:39,259 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 18:18:39,343 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 18:18:39,346 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 18:18:39,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:18:39 BoogieIcfgContainer [2025-03-03 18:18:39,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 18:18:39,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 18:18:39,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 18:18:39,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 18:18:39,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 06:18:36" (1/3) ... [2025-03-03 18:18:39,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cc0142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:18:39, skipping insertion in model container [2025-03-03 18:18:39,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 06:18:37" (2/3) ... [2025-03-03 18:18:39,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cc0142 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 06:18:39, skipping insertion in model container [2025-03-03 18:18:39,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 06:18:39" (3/3) ... [2025-03-03 18:18:39,354 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_ball2001.c [2025-03-03 18:18:39,364 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 18:18:39,366 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_ball2001.c that has 1 procedures, 466 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 18:18:39,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 18:18:39,430 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;@24c410b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 18:18:39,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 18:18:39,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 466 states, 464 states have (on average 1.4978448275862069) internal successors, (695), 465 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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 18:18:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-03 18:18:39,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:39,442 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] [2025-03-03 18:18:39,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:39,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash -509967409, now seen corresponding path program 1 times [2025-03-03 18:18:39,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:39,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482349617] [2025-03-03 18:18:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:39,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:39,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-03 18:18:39,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-03 18:18:39,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:39,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:39,931 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 18:18:39,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:39,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482349617] [2025-03-03 18:18:39,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482349617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:39,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:39,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:18:39,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102290794] [2025-03-03 18:18:39,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:39,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:18:39,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:39,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:18:39,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:18:39,953 INFO L87 Difference]: Start difference. First operand has 466 states, 464 states have (on average 1.4978448275862069) internal successors, (695), 465 states have internal predecessors, (695), 0 states have call successors, (0), 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 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 18:18:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:40,205 INFO L93 Difference]: Finished difference Result 873 states and 1305 transitions. [2025-03-03 18:18:40,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:18:40,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-03 18:18:40,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:40,214 INFO L225 Difference]: With dead ends: 873 [2025-03-03 18:18:40,214 INFO L226 Difference]: Without dead ends: 465 [2025-03-03 18:18:40,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:18:40,218 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1720 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:40,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1720 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:18:40,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-03-03 18:18:40,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2025-03-03 18:18:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 464 states have (on average 1.4935344827586208) internal successors, (693), 464 states have internal predecessors, (693), 0 states have call successors, (0), 0 states 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 18:18:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 693 transitions. [2025-03-03 18:18:40,280 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 693 transitions. Word has length 37 [2025-03-03 18:18:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:40,280 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 693 transitions. [2025-03-03 18:18:40,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states 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 18:18:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 693 transitions. [2025-03-03 18:18:40,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 18:18:40,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:40,281 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] [2025-03-03 18:18:40,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 18:18:40,282 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:40,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:40,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1375559336, now seen corresponding path program 1 times [2025-03-03 18:18:40,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:40,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224171] [2025-03-03 18:18:40,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:40,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:40,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-03 18:18:40,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-03 18:18:40,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:40,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:40,428 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 18:18:40,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:40,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224171] [2025-03-03 18:18:40,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:40,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:40,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 18:18:40,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915553055] [2025-03-03 18:18:40,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:40,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 18:18:40,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:40,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 18:18:40,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:18:40,431 INFO L87 Difference]: Start difference. First operand 465 states and 693 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 18:18:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:40,636 INFO L93 Difference]: Finished difference Result 874 states and 1303 transitions. [2025-03-03 18:18:40,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 18:18:40,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-03-03 18:18:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:40,638 INFO L225 Difference]: With dead ends: 874 [2025-03-03 18:18:40,638 INFO L226 Difference]: Without dead ends: 467 [2025-03-03 18:18:40,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 18:18:40,639 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 1142 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:40,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1717 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:18:40,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2025-03-03 18:18:40,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 467. [2025-03-03 18:18:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.4914163090128756) internal successors, (695), 466 states have internal predecessors, (695), 0 states have call successors, (0), 0 states 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 18:18:40,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 695 transitions. [2025-03-03 18:18:40,662 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 695 transitions. Word has length 38 [2025-03-03 18:18:40,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:40,663 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 695 transitions. [2025-03-03 18:18:40,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 0 states have call successors, (0), 0 states 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 18:18:40,663 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 695 transitions. [2025-03-03 18:18:40,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 18:18:40,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:40,665 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] [2025-03-03 18:18:40,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 18:18:40,665 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:40,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:40,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1624176362, now seen corresponding path program 1 times [2025-03-03 18:18:40,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:40,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913890400] [2025-03-03 18:18:40,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:40,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:40,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-03 18:18:40,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-03 18:18:40,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:40,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:40,857 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 18:18:40,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:40,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913890400] [2025-03-03 18:18:40,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913890400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:40,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:40,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:40,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804629893] [2025-03-03 18:18:40,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:40,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:40,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:40,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:40,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:40,860 INFO L87 Difference]: Start difference. First operand 467 states and 695 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 18:18:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:41,180 INFO L93 Difference]: Finished difference Result 1251 states and 1864 transitions. [2025-03-03 18:18:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:41,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 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 39 [2025-03-03 18:18:41,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:41,183 INFO L225 Difference]: With dead ends: 1251 [2025-03-03 18:18:41,183 INFO L226 Difference]: Without dead ends: 842 [2025-03-03 18:18:41,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:41,184 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1779 mSDsluCounter, 1121 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:41,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 1684 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:41,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-03 18:18:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 469. [2025-03-03 18:18:41,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 1.4893162393162394) internal successors, (697), 468 states have internal predecessors, (697), 0 states have call successors, (0), 0 states 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 18:18:41,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 697 transitions. [2025-03-03 18:18:41,203 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 697 transitions. Word has length 39 [2025-03-03 18:18:41,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:41,203 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 697 transitions. [2025-03-03 18:18:41,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 18:18:41,203 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 697 transitions. [2025-03-03 18:18:41,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-03 18:18:41,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:41,212 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:41,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 18:18:41,212 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:41,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:41,214 INFO L85 PathProgramCache]: Analyzing trace with hash 468234706, now seen corresponding path program 1 times [2025-03-03 18:18:41,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:41,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030952710] [2025-03-03 18:18:41,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:41,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:41,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-03 18:18:41,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-03 18:18:41,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:41,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:42,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:42,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030952710] [2025-03-03 18:18:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030952710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:42,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:42,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:18:42,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970264013] [2025-03-03 18:18:42,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:42,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:18:42,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:42,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:18:42,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:18:42,543 INFO L87 Difference]: Start difference. First operand 469 states and 697 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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 18:18:42,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:42,904 INFO L93 Difference]: Finished difference Result 1274 states and 1898 transitions. [2025-03-03 18:18:42,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 18:18:42,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 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 242 [2025-03-03 18:18:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:42,909 INFO L225 Difference]: With dead ends: 1274 [2025-03-03 18:18:42,909 INFO L226 Difference]: Without dead ends: 865 [2025-03-03 18:18:42,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-03 18:18:42,910 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 1832 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1832 SdHoareTripleChecker+Valid, 2155 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:42,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1832 Valid, 2155 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-03 18:18:42,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 490. [2025-03-03 18:18:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.4826175869120655) internal successors, (725), 489 states have internal predecessors, (725), 0 states have call successors, (0), 0 states 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 18:18:42,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 725 transitions. [2025-03-03 18:18:42,923 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 725 transitions. Word has length 242 [2025-03-03 18:18:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:42,924 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 725 transitions. [2025-03-03 18:18:42,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 0 states have call successors, (0), 0 states 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 18:18:42,924 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 725 transitions. [2025-03-03 18:18:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-03 18:18:42,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:42,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:42,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 18:18:42,927 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:42,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:42,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1261394033, now seen corresponding path program 1 times [2025-03-03 18:18:42,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:42,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800248127] [2025-03-03 18:18:42,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:42,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:42,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-03 18:18:43,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-03 18:18:43,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:43,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:44,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:44,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800248127] [2025-03-03 18:18:44,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800248127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:44,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:44,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:44,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968880311] [2025-03-03 18:18:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:44,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:44,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:44,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:44,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:44,451 INFO L87 Difference]: Start difference. First operand 490 states and 725 transitions. Second operand has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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 18:18:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:44,801 INFO L93 Difference]: Finished difference Result 1270 states and 1890 transitions. [2025-03-03 18:18:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:44,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 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 243 [2025-03-03 18:18:44,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:44,804 INFO L225 Difference]: With dead ends: 1270 [2025-03-03 18:18:44,804 INFO L226 Difference]: Without dead ends: 861 [2025-03-03 18:18:44,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:44,805 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1788 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1788 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:44,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1788 Valid, 1673 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:44,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-03 18:18:44,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 539. [2025-03-03 18:18:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 538 states have (on average 1.4814126394052045) internal successors, (797), 538 states have internal predecessors, (797), 0 states have call successors, (0), 0 states 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 18:18:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 797 transitions. [2025-03-03 18:18:44,825 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 797 transitions. Word has length 243 [2025-03-03 18:18:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:44,825 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 797 transitions. [2025-03-03 18:18:44,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states 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 18:18:44,828 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 797 transitions. [2025-03-03 18:18:44,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-03 18:18:44,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:44,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:44,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 18:18:44,831 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:44,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:44,831 INFO L85 PathProgramCache]: Analyzing trace with hash 251963473, now seen corresponding path program 1 times [2025-03-03 18:18:44,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:44,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794372946] [2025-03-03 18:18:44,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:44,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:44,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-03 18:18:45,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-03 18:18:45,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:45,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:46,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:46,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:46,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794372946] [2025-03-03 18:18:46,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794372946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:46,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:46,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:46,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999572779] [2025-03-03 18:18:46,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:46,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:46,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:46,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:46,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:46,096 INFO L87 Difference]: Start difference. First operand 539 states and 797 transitions. Second operand has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 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 18:18:46,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:46,428 INFO L93 Difference]: Finished difference Result 1270 states and 1888 transitions. [2025-03-03 18:18:46,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:46,429 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 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 245 [2025-03-03 18:18:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:46,432 INFO L225 Difference]: With dead ends: 1270 [2025-03-03 18:18:46,432 INFO L226 Difference]: Without dead ends: 861 [2025-03-03 18:18:46,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:46,433 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1750 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1750 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:46,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1750 Valid, 1672 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-03 18:18:46,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 606. [2025-03-03 18:18:46,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 605 states have (on average 1.48099173553719) internal successors, (896), 605 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 18:18:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 896 transitions. [2025-03-03 18:18:46,450 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 896 transitions. Word has length 245 [2025-03-03 18:18:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:46,450 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 896 transitions. [2025-03-03 18:18:46,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.0) internal successors, (245), 5 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 18:18:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 896 transitions. [2025-03-03 18:18:46,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-03 18:18:46,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:46,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:46,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 18:18:46,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash -2001681156, now seen corresponding path program 1 times [2025-03-03 18:18:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559461822] [2025-03-03 18:18:46,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:46,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-03 18:18:46,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-03 18:18:46,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:46,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:47,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:47,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:47,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559461822] [2025-03-03 18:18:47,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559461822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:47,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:47,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:47,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871044984] [2025-03-03 18:18:47,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:47,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:47,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:47,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:47,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:47,363 INFO L87 Difference]: Start difference. First operand 606 states and 896 transitions. Second operand has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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 18:18:47,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:47,700 INFO L93 Difference]: Finished difference Result 1270 states and 1887 transitions. [2025-03-03 18:18:47,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:47,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2025-03-03 18:18:47,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:47,703 INFO L225 Difference]: With dead ends: 1270 [2025-03-03 18:18:47,703 INFO L226 Difference]: Without dead ends: 861 [2025-03-03 18:18:47,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:47,705 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1729 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:47,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 1672 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2025-03-03 18:18:47,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 642. [2025-03-03 18:18:47,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.4804992199687987) internal successors, (949), 641 states have internal predecessors, (949), 0 states have call successors, (0), 0 states 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 18:18:47,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 949 transitions. [2025-03-03 18:18:47,720 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 949 transitions. Word has length 246 [2025-03-03 18:18:47,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:47,720 INFO L471 AbstractCegarLoop]: Abstraction has 642 states and 949 transitions. [2025-03-03 18:18:47,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 0 states have call successors, (0), 0 states 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 18:18:47,721 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 949 transitions. [2025-03-03 18:18:47,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-03 18:18:47,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:47,724 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:47,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 18:18:47,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:47,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:47,725 INFO L85 PathProgramCache]: Analyzing trace with hash -49930978, now seen corresponding path program 1 times [2025-03-03 18:18:47,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:47,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894774756] [2025-03-03 18:18:47,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:47,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:47,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-03 18:18:48,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-03 18:18:48,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:48,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:48,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:48,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:48,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894774756] [2025-03-03 18:18:48,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894774756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:48,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:48,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:18:48,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567659816] [2025-03-03 18:18:48,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:48,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:18:48,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:48,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:18:48,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:48,693 INFO L87 Difference]: Start difference. First operand 642 states and 949 transitions. Second operand has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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 18:18:49,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:49,144 INFO L93 Difference]: Finished difference Result 1274 states and 1892 transitions. [2025-03-03 18:18:49,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:18:49,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 0 states have call successors, (0), 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 247 [2025-03-03 18:18:49,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:49,147 INFO L225 Difference]: With dead ends: 1274 [2025-03-03 18:18:49,147 INFO L226 Difference]: Without dead ends: 865 [2025-03-03 18:18:49,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:18:49,149 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1736 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2778 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:49,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2778 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:18:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-03 18:18:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 645. [2025-03-03 18:18:49,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4798136645962734) internal successors, (953), 644 states have internal predecessors, (953), 0 states have call successors, (0), 0 states 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 18:18:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 953 transitions. [2025-03-03 18:18:49,164 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 953 transitions. Word has length 247 [2025-03-03 18:18:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:49,165 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 953 transitions. [2025-03-03 18:18:49,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.285714285714285) internal successors, (247), 7 states have internal predecessors, (247), 0 states have call successors, (0), 0 states 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 18:18:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 953 transitions. [2025-03-03 18:18:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-03 18:18:49,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:49,170 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:49,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 18:18:49,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:49,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:49,173 INFO L85 PathProgramCache]: Analyzing trace with hash 504496297, now seen corresponding path program 1 times [2025-03-03 18:18:49,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:49,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695947140] [2025-03-03 18:18:49,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:49,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:49,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-03 18:18:49,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-03 18:18:49,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:49,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:50,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:50,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695947140] [2025-03-03 18:18:50,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695947140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:50,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:50,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:50,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912707870] [2025-03-03 18:18:50,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:50,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:50,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:50,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:50,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:50,183 INFO L87 Difference]: Start difference. First operand 645 states and 953 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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 18:18:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:50,519 INFO L93 Difference]: Finished difference Result 1272 states and 1888 transitions. [2025-03-03 18:18:50,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:50,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-03-03 18:18:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:50,523 INFO L225 Difference]: With dead ends: 1272 [2025-03-03 18:18:50,523 INFO L226 Difference]: Without dead ends: 863 [2025-03-03 18:18:50,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:50,524 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1689 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1689 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:50,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1689 Valid, 1672 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:50,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-03 18:18:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 716. [2025-03-03 18:18:50,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4797202797202798) internal successors, (1058), 715 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states 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 18:18:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1058 transitions. [2025-03-03 18:18:50,537 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1058 transitions. Word has length 248 [2025-03-03 18:18:50,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:50,537 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1058 transitions. [2025-03-03 18:18:50,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 0 states have call successors, (0), 0 states 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 18:18:50,537 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1058 transitions. [2025-03-03 18:18:50,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2025-03-03 18:18:50,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:50,539 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:50,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 18:18:50,539 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:50,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:50,540 INFO L85 PathProgramCache]: Analyzing trace with hash -691160661, now seen corresponding path program 1 times [2025-03-03 18:18:50,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:50,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114921660] [2025-03-03 18:18:50,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:50,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:50,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes. [2025-03-03 18:18:50,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements. [2025-03-03 18:18:50,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:50,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:51,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:51,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114921660] [2025-03-03 18:18:51,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114921660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:51,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:51,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:51,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654609212] [2025-03-03 18:18:51,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:51,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:51,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:51,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:51,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:51,427 INFO L87 Difference]: Start difference. First operand 716 states and 1058 transitions. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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 18:18:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:51,756 INFO L93 Difference]: Finished difference Result 1306 states and 1937 transitions. [2025-03-03 18:18:51,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:51,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 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 249 [2025-03-03 18:18:51,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:51,760 INFO L225 Difference]: With dead ends: 1306 [2025-03-03 18:18:51,760 INFO L226 Difference]: Without dead ends: 863 [2025-03-03 18:18:51,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:51,761 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1705 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:51,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 1672 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-03 18:18:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 716. [2025-03-03 18:18:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.4783216783216784) internal successors, (1057), 715 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states 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 18:18:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1057 transitions. [2025-03-03 18:18:51,787 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1057 transitions. Word has length 249 [2025-03-03 18:18:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:51,787 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1057 transitions. [2025-03-03 18:18:51,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states 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 18:18:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1057 transitions. [2025-03-03 18:18:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2025-03-03 18:18:51,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:51,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:51,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 18:18:51,790 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:51,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:51,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1075153610, now seen corresponding path program 1 times [2025-03-03 18:18:51,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:51,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243873047] [2025-03-03 18:18:51,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:51,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:51,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-03-03 18:18:52,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-03-03 18:18:52,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:52,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:52,759 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:52,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:52,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243873047] [2025-03-03 18:18:52,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243873047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:52,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:52,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:18:52,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925855765] [2025-03-03 18:18:52,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:52,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:18:52,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:52,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:18:52,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:52,762 INFO L87 Difference]: Start difference. First operand 716 states and 1057 transitions. Second operand has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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 18:18:53,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:53,164 INFO L93 Difference]: Finished difference Result 1306 states and 1936 transitions. [2025-03-03 18:18:53,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:18:53,164 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2025-03-03 18:18:53,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:53,167 INFO L225 Difference]: With dead ends: 1306 [2025-03-03 18:18:53,167 INFO L226 Difference]: Without dead ends: 867 [2025-03-03 18:18:53,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:18:53,169 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1713 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:53,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 2594 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2025-03-03 18:18:53,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 718. [2025-03-03 18:18:53,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4769874476987448) internal successors, (1059), 717 states have internal predecessors, (1059), 0 states have call successors, (0), 0 states 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 18:18:53,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1059 transitions. [2025-03-03 18:18:53,182 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1059 transitions. Word has length 250 [2025-03-03 18:18:53,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:53,182 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1059 transitions. [2025-03-03 18:18:53,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.714285714285715) internal successors, (250), 7 states have internal predecessors, (250), 0 states have call successors, (0), 0 states 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 18:18:53,183 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1059 transitions. [2025-03-03 18:18:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-03 18:18:53,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:53,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:53,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 18:18:53,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:53,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash -185055617, now seen corresponding path program 1 times [2025-03-03 18:18:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170391258] [2025-03-03 18:18:53,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:53,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:53,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-03 18:18:53,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-03 18:18:53,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:53,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:54,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:54,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170391258] [2025-03-03 18:18:54,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170391258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:54,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:54,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:54,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237114809] [2025-03-03 18:18:54,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:54,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:54,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:54,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:54,103 INFO L87 Difference]: Start difference. First operand 718 states and 1059 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 18:18:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:54,411 INFO L93 Difference]: Finished difference Result 1274 states and 1888 transitions. [2025-03-03 18:18:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 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 251 [2025-03-03 18:18:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:54,415 INFO L225 Difference]: With dead ends: 1274 [2025-03-03 18:18:54,415 INFO L226 Difference]: Without dead ends: 865 [2025-03-03 18:18:54,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:54,416 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1628 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1628 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:54,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1628 Valid, 1672 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-03 18:18:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 826. [2025-03-03 18:18:54,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.4787878787878788) internal successors, (1220), 825 states have internal predecessors, (1220), 0 states have call successors, (0), 0 states 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 18:18:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1220 transitions. [2025-03-03 18:18:54,430 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1220 transitions. Word has length 251 [2025-03-03 18:18:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:54,431 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1220 transitions. [2025-03-03 18:18:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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 18:18:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1220 transitions. [2025-03-03 18:18:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 18:18:54,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:54,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:54,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 18:18:54,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:54,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash -955020324, now seen corresponding path program 1 times [2025-03-03 18:18:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:54,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643889779] [2025-03-03 18:18:54,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:54,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 18:18:54,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 18:18:54,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:54,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:55,313 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:55,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:55,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643889779] [2025-03-03 18:18:55,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643889779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:55,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:55,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:18:55,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133134728] [2025-03-03 18:18:55,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:55,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:18:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:55,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:18:55,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:18:55,314 INFO L87 Difference]: Start difference. First operand 826 states and 1220 transitions. Second operand has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 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) [2025-03-03 18:18:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:55,630 INFO L93 Difference]: Finished difference Result 1344 states and 1991 transitions. [2025-03-03 18:18:55,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:18:55,631 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 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) Word has length 252 [2025-03-03 18:18:55,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:55,634 INFO L225 Difference]: With dead ends: 1344 [2025-03-03 18:18:55,634 INFO L226 Difference]: Without dead ends: 865 [2025-03-03 18:18:55,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:55,636 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1662 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:55,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 1672 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:55,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-03-03 18:18:55,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 826. [2025-03-03 18:18:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 1.4775757575757575) internal successors, (1219), 825 states have internal predecessors, (1219), 0 states have call successors, (0), 0 states 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 18:18:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1219 transitions. [2025-03-03 18:18:55,652 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1219 transitions. Word has length 252 [2025-03-03 18:18:55,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:55,652 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1219 transitions. [2025-03-03 18:18:55,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.4) internal successors, (252), 5 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) [2025-03-03 18:18:55,652 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1219 transitions. [2025-03-03 18:18:55,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2025-03-03 18:18:55,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:55,655 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:55,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 18:18:55,655 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:55,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:55,655 INFO L85 PathProgramCache]: Analyzing trace with hash 561637625, now seen corresponding path program 1 times [2025-03-03 18:18:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532093217] [2025-03-03 18:18:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:55,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes. [2025-03-03 18:18:56,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements. [2025-03-03 18:18:56,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:56,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:56,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:56,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532093217] [2025-03-03 18:18:56,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532093217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:56,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:56,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:18:56,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082449028] [2025-03-03 18:18:56,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:56,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:18:56,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:56,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:18:56,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:56,491 INFO L87 Difference]: Start difference. First operand 826 states and 1219 transitions. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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 18:18:56,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:56,898 INFO L93 Difference]: Finished difference Result 1344 states and 1990 transitions. [2025-03-03 18:18:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:18:56,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 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 253 [2025-03-03 18:18:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:56,901 INFO L225 Difference]: With dead ends: 1344 [2025-03-03 18:18:56,901 INFO L226 Difference]: Without dead ends: 869 [2025-03-03 18:18:56,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:18:56,902 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1670 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:56,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 2684 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 18:18:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-03-03 18:18:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 828. [2025-03-03 18:18:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 827 states have (on average 1.4764207980652964) internal successors, (1221), 827 states have internal predecessors, (1221), 0 states have call successors, (0), 0 states 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 18:18:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1221 transitions. [2025-03-03 18:18:56,919 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1221 transitions. Word has length 253 [2025-03-03 18:18:56,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:56,919 INFO L471 AbstractCegarLoop]: Abstraction has 828 states and 1221 transitions. [2025-03-03 18:18:56,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states 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 18:18:56,920 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1221 transitions. [2025-03-03 18:18:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-03 18:18:56,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:56,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:56,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 18:18:56,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:56,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash -580887849, now seen corresponding path program 1 times [2025-03-03 18:18:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:56,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427728905] [2025-03-03 18:18:56,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:56,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:56,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-03 18:18:57,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-03 18:18:57,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:57,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:57,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:57,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427728905] [2025-03-03 18:18:57,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427728905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:57,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:18:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479584052] [2025-03-03 18:18:57,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:57,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:18:57,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:57,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:18:57,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:57,726 INFO L87 Difference]: Start difference. First operand 828 states and 1221 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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 18:18:58,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:58,102 INFO L93 Difference]: Finished difference Result 1384 states and 2047 transitions. [2025-03-03 18:18:58,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:18:58,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2025-03-03 18:18:58,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:58,105 INFO L225 Difference]: With dead ends: 1384 [2025-03-03 18:18:58,105 INFO L226 Difference]: Without dead ends: 871 [2025-03-03 18:18:58,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:18:58,106 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1688 mSDsluCounter, 2221 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 2778 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:58,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 2778 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2025-03-03 18:18:58,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 830. [2025-03-03 18:18:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 1.4752714113389627) internal successors, (1223), 829 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states 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 18:18:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1223 transitions. [2025-03-03 18:18:58,117 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1223 transitions. Word has length 254 [2025-03-03 18:18:58,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:58,117 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1223 transitions. [2025-03-03 18:18:58,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 0 states have call successors, (0), 0 states 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 18:18:58,118 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1223 transitions. [2025-03-03 18:18:58,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 18:18:58,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:58,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 18:18:58,119 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:58,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1042641337, now seen corresponding path program 1 times [2025-03-03 18:18:58,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:58,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345977421] [2025-03-03 18:18:58,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:58,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:58,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 18:18:58,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 18:18:58,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:58,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:18:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:18:59,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:18:59,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345977421] [2025-03-03 18:18:59,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345977421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:18:59,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:18:59,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:18:59,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875606930] [2025-03-03 18:18:59,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:18:59,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:18:59,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:18:59,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:18:59,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:18:59,113 INFO L87 Difference]: Start difference. First operand 830 states and 1223 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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 18:18:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:18:59,466 INFO L93 Difference]: Finished difference Result 1348 states and 1994 transitions. [2025-03-03 18:18:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:18:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-03-03 18:18:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:18:59,471 INFO L225 Difference]: With dead ends: 1348 [2025-03-03 18:18:59,471 INFO L226 Difference]: Without dead ends: 877 [2025-03-03 18:18:59,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:18:59,472 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1677 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 2783 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:18:59,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 2783 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:18:59,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-03 18:18:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 832. [2025-03-03 18:18:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 832 states, 831 states have (on average 1.474127557160048) internal successors, (1225), 831 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states 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 18:18:59,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1225 transitions. [2025-03-03 18:18:59,482 INFO L78 Accepts]: Start accepts. Automaton has 832 states and 1225 transitions. Word has length 255 [2025-03-03 18:18:59,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:18:59,483 INFO L471 AbstractCegarLoop]: Abstraction has 832 states and 1225 transitions. [2025-03-03 18:18:59,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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 18:18:59,483 INFO L276 IsEmpty]: Start isEmpty. Operand 832 states and 1225 transitions. [2025-03-03 18:18:59,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-03-03 18:18:59,484 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:18:59,484 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:18:59,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 18:18:59,484 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:18:59,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:18:59,486 INFO L85 PathProgramCache]: Analyzing trace with hash -732005395, now seen corresponding path program 1 times [2025-03-03 18:18:59,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:18:59,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891742559] [2025-03-03 18:18:59,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:18:59,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:18:59,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-03 18:18:59,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-03 18:18:59,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:18:59,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:00,353 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:00,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:00,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891742559] [2025-03-03 18:19:00,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891742559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:00,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:00,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:00,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310240208] [2025-03-03 18:19:00,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:00,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:00,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:00,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:00,355 INFO L87 Difference]: Start difference. First operand 832 states and 1225 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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 18:19:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:00,662 INFO L93 Difference]: Finished difference Result 1284 states and 1898 transitions. [2025-03-03 18:19:00,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:00,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 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 255 [2025-03-03 18:19:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:00,665 INFO L225 Difference]: With dead ends: 1284 [2025-03-03 18:19:00,665 INFO L226 Difference]: Without dead ends: 875 [2025-03-03 18:19:00,666 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:00,666 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1631 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 2590 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:00,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 2590 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:00,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-03 18:19:00,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 835. [2025-03-03 18:19:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 835 states, 834 states have (on average 1.473621103117506) internal successors, (1229), 834 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states 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 18:19:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 1229 transitions. [2025-03-03 18:19:00,675 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 1229 transitions. Word has length 255 [2025-03-03 18:19:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:00,676 INFO L471 AbstractCegarLoop]: Abstraction has 835 states and 1229 transitions. [2025-03-03 18:19:00,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states 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 18:19:00,676 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 1229 transitions. [2025-03-03 18:19:00,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 18:19:00,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:00,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:00,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 18:19:00,677 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:00,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:00,678 INFO L85 PathProgramCache]: Analyzing trace with hash 870203379, now seen corresponding path program 1 times [2025-03-03 18:19:00,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:00,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688194061] [2025-03-03 18:19:00,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:00,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:00,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 18:19:01,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 18:19:01,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:01,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:01,509 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:01,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:01,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688194061] [2025-03-03 18:19:01,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688194061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:01,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:01,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962260902] [2025-03-03 18:19:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:01,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:01,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:01,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:01,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:01,511 INFO L87 Difference]: Start difference. First operand 835 states and 1229 transitions. Second operand has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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 18:19:01,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:01,801 INFO L93 Difference]: Finished difference Result 1290 states and 1906 transitions. [2025-03-03 18:19:01,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:01,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-03 18:19:01,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:01,804 INFO L225 Difference]: With dead ends: 1290 [2025-03-03 18:19:01,804 INFO L226 Difference]: Without dead ends: 881 [2025-03-03 18:19:01,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:01,805 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1640 mSDsluCounter, 2045 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1640 SdHoareTripleChecker+Valid, 2603 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:01,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1640 Valid, 2603 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 881 states. [2025-03-03 18:19:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 881 to 841. [2025-03-03 18:19:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.4726190476190477) internal successors, (1237), 840 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states 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 18:19:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1237 transitions. [2025-03-03 18:19:01,814 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1237 transitions. Word has length 256 [2025-03-03 18:19:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:01,814 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1237 transitions. [2025-03-03 18:19:01,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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 18:19:01,814 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1237 transitions. [2025-03-03 18:19:01,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-03 18:19:01,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:01,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:01,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 18:19:01,816 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:01,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:01,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1755897129, now seen corresponding path program 1 times [2025-03-03 18:19:01,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:01,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541154603] [2025-03-03 18:19:01,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:01,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:01,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-03 18:19:02,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-03 18:19:02,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:02,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:02,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:02,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:02,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541154603] [2025-03-03 18:19:02,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541154603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:02,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:02,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:02,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894498055] [2025-03-03 18:19:02,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:02,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:02,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:02,872 INFO L87 Difference]: Start difference. First operand 841 states and 1237 transitions. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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 18:19:03,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:03,187 INFO L93 Difference]: Finished difference Result 1327 states and 1958 transitions. [2025-03-03 18:19:03,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 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 256 [2025-03-03 18:19:03,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:03,190 INFO L225 Difference]: With dead ends: 1327 [2025-03-03 18:19:03,190 INFO L226 Difference]: Without dead ends: 875 [2025-03-03 18:19:03,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:03,190 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1639 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1639 SdHoareTripleChecker+Valid, 1672 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:03,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1639 Valid, 1672 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:03,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-03 18:19:03,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 841. [2025-03-03 18:19:03,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 1.4714285714285715) internal successors, (1236), 840 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states 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 18:19:03,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1236 transitions. [2025-03-03 18:19:03,199 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1236 transitions. Word has length 256 [2025-03-03 18:19:03,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:03,199 INFO L471 AbstractCegarLoop]: Abstraction has 841 states and 1236 transitions. [2025-03-03 18:19:03,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 0 states have call successors, (0), 0 states 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 18:19:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1236 transitions. [2025-03-03 18:19:03,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-03-03 18:19:03,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:03,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:03,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 18:19:03,201 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:03,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:03,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1731830857, now seen corresponding path program 1 times [2025-03-03 18:19:03,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:03,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723861959] [2025-03-03 18:19:03,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:03,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:03,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-03-03 18:19:03,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-03-03 18:19:03,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:03,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:04,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:04,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723861959] [2025-03-03 18:19:04,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723861959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:04,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:04,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:04,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210559482] [2025-03-03 18:19:04,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:04,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:04,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:04,188 INFO L87 Difference]: Start difference. First operand 841 states and 1236 transitions. Second operand has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 18:19:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:04,484 INFO L93 Difference]: Finished difference Result 1327 states and 1957 transitions. [2025-03-03 18:19:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 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 257 [2025-03-03 18:19:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:04,487 INFO L225 Difference]: With dead ends: 1327 [2025-03-03 18:19:04,487 INFO L226 Difference]: Without dead ends: 879 [2025-03-03 18:19:04,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:04,487 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 1647 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1647 SdHoareTripleChecker+Valid, 2588 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:04,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1647 Valid, 2588 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-03-03 18:19:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 843. [2025-03-03 18:19:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 843 states, 842 states have (on average 1.4703087885985748) internal successors, (1238), 842 states have internal predecessors, (1238), 0 states have call successors, (0), 0 states 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 18:19:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1238 transitions. [2025-03-03 18:19:04,497 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1238 transitions. Word has length 257 [2025-03-03 18:19:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:04,497 INFO L471 AbstractCegarLoop]: Abstraction has 843 states and 1238 transitions. [2025-03-03 18:19:04,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.714285714285715) internal successors, (257), 7 states have internal predecessors, (257), 0 states have call successors, (0), 0 states 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 18:19:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1238 transitions. [2025-03-03 18:19:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 18:19:04,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:04,498 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:04,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 18:19:04,499 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:04,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:04,499 INFO L85 PathProgramCache]: Analyzing trace with hash 207288412, now seen corresponding path program 1 times [2025-03-03 18:19:04,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:04,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456630479] [2025-03-03 18:19:04,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:04,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:04,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 18:19:05,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 18:19:05,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:05,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456630479] [2025-03-03 18:19:05,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456630479] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:05,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:05,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 18:19:05,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440195815] [2025-03-03 18:19:05,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:05,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 18:19:05,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:05,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 18:19:05,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:05,437 INFO L87 Difference]: Start difference. First operand 843 states and 1238 transitions. Second operand has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 18:19:05,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:05,771 INFO L93 Difference]: Finished difference Result 1329 states and 1959 transitions. [2025-03-03 18:19:05,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 18:19:05,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-03 18:19:05,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:05,774 INFO L225 Difference]: With dead ends: 1329 [2025-03-03 18:19:05,774 INFO L226 Difference]: Without dead ends: 885 [2025-03-03 18:19:05,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 18:19:05,775 INFO L435 NwaCegarLoop]: 558 mSDtfsCounter, 1656 mSDsluCounter, 2043 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2601 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:05,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2601 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:05,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-03-03 18:19:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 845. [2025-03-03 18:19:05,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 844 states have (on average 1.4691943127962086) internal successors, (1240), 844 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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 18:19:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1240 transitions. [2025-03-03 18:19:05,784 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1240 transitions. Word has length 258 [2025-03-03 18:19:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:05,785 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1240 transitions. [2025-03-03 18:19:05,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 18:19:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1240 transitions. [2025-03-03 18:19:05,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-03-03 18:19:05,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:05,786 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:05,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 18:19:05,786 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:05,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1298095956, now seen corresponding path program 1 times [2025-03-03 18:19:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:05,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966022386] [2025-03-03 18:19:05,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:05,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 18:19:06,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 18:19:06,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:06,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:06,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966022386] [2025-03-03 18:19:06,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966022386] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:06,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168876894] [2025-03-03 18:19:06,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:06,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:06,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:06,830 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 18:19:06,831 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 18:19:07,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-03-03 18:19:07,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-03-03 18:19:07,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:07,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:07,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-03 18:19:07,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:07,913 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:07,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 18:19:07,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168876894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:07,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 18:19:07,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-03 18:19:07,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880072557] [2025-03-03 18:19:07,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:07,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 18:19:07,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:07,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 18:19:07,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2025-03-03 18:19:07,915 INFO L87 Difference]: Start difference. First operand 845 states and 1240 transitions. Second operand has 8 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 18:19:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:08,464 INFO L93 Difference]: Finished difference Result 1641 states and 2411 transitions. [2025-03-03 18:19:08,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 18:19:08,467 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2025-03-03 18:19:08,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:08,469 INFO L225 Difference]: With dead ends: 1641 [2025-03-03 18:19:08,470 INFO L226 Difference]: Without dead ends: 886 [2025-03-03 18:19:08,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-03 18:19:08,473 INFO L435 NwaCegarLoop]: 484 mSDtfsCounter, 1228 mSDsluCounter, 2316 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1228 SdHoareTripleChecker+Valid, 2800 SdHoareTripleChecker+Invalid, 1122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:08,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1228 Valid, 2800 Invalid, 1122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1120 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 18:19:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-03 18:19:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 848. [2025-03-03 18:19:08,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4675324675324675) internal successors, (1243), 847 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states 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 18:19:08,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1243 transitions. [2025-03-03 18:19:08,486 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1243 transitions. Word has length 258 [2025-03-03 18:19:08,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:08,486 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1243 transitions. [2025-03-03 18:19:08,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 0 states have call successors, (0), 0 states 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 18:19:08,486 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1243 transitions. [2025-03-03 18:19:08,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 18:19:08,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:08,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:08,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 18:19:08,688 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,SelfDestructingSolverStorable21 [2025-03-03 18:19:08,689 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:08,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:08,689 INFO L85 PathProgramCache]: Analyzing trace with hash -2132657364, now seen corresponding path program 1 times [2025-03-03 18:19:08,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:08,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818632161] [2025-03-03 18:19:08,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:08,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:08,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 18:19:09,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 18:19:09,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:09,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818632161] [2025-03-03 18:19:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818632161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10705329] [2025-03-03 18:19:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:09,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:09,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:09,682 INFO L87 Difference]: Start difference. First operand 848 states and 1243 transitions. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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 18:19:09,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:09,936 INFO L93 Difference]: Finished difference Result 1528 states and 2243 transitions. [2025-03-03 18:19:09,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:09,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 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 259 [2025-03-03 18:19:09,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:09,938 INFO L225 Difference]: With dead ends: 1528 [2025-03-03 18:19:09,938 INFO L226 Difference]: Without dead ends: 882 [2025-03-03 18:19:09,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:09,939 INFO L435 NwaCegarLoop]: 559 mSDtfsCounter, 1734 mSDsluCounter, 1114 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1734 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:09,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1734 Valid, 1673 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-03-03 18:19:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 848. [2025-03-03 18:19:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 847 states have (on average 1.4663518299881937) internal successors, (1242), 847 states have internal predecessors, (1242), 0 states have call successors, (0), 0 states 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 18:19:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1242 transitions. [2025-03-03 18:19:09,947 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1242 transitions. Word has length 259 [2025-03-03 18:19:09,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1242 transitions. [2025-03-03 18:19:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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 18:19:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1242 transitions. [2025-03-03 18:19:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-03 18:19:09,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:09,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:09,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 18:19:09,948 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:09,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:09,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1300476667, now seen corresponding path program 1 times [2025-03-03 18:19:09,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:09,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246546444] [2025-03-03 18:19:09,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:09,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:09,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 18:19:10,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 18:19:10,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:10,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:11,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246546444] [2025-03-03 18:19:11,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246546444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:11,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465055691] [2025-03-03 18:19:11,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:11,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:11,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:11,667 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 18:19:11,668 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 18:19:12,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-03-03 18:19:12,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-03-03 18:19:12,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:12,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 1639 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-03-03 18:19:12,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:13,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:19:14,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:14,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465055691] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:19:14,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:19:14,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 16, 12] total 34 [2025-03-03 18:19:14,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20275870] [2025-03-03 18:19:14,186 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:19:14,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-03 18:19:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:14,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-03 18:19:14,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-03-03 18:19:14,188 INFO L87 Difference]: Start difference. First operand 848 states and 1242 transitions. Second operand has 34 states, 34 states have (on average 22.529411764705884) internal successors, (766), 34 states have internal predecessors, (766), 0 states have call successors, (0), 0 states 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 18:19:16,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:16,427 INFO L93 Difference]: Finished difference Result 2865 states and 4215 transitions. [2025-03-03 18:19:16,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 18:19:16,428 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 22.529411764705884) internal successors, (766), 34 states have internal predecessors, (766), 0 states have call successors, (0), 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 260 [2025-03-03 18:19:16,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:16,433 INFO L225 Difference]: With dead ends: 2865 [2025-03-03 18:19:16,433 INFO L226 Difference]: Without dead ends: 2088 [2025-03-03 18:19:16,434 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=504, Invalid=2576, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 18:19:16,434 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 11110 mSDsluCounter, 11708 mSDsCounter, 0 mSdLazyCounter, 5690 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11110 SdHoareTripleChecker+Valid, 12169 SdHoareTripleChecker+Invalid, 5697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 5690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:16,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11110 Valid, 12169 Invalid, 5697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 5690 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 18:19:16,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2025-03-03 18:19:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 1612. [2025-03-03 18:19:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1612 states, 1611 states have (on average 1.4655493482309125) internal successors, (2361), 1611 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states 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 18:19:16,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1612 states to 1612 states and 2361 transitions. [2025-03-03 18:19:16,449 INFO L78 Accepts]: Start accepts. Automaton has 1612 states and 2361 transitions. Word has length 260 [2025-03-03 18:19:16,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:16,449 INFO L471 AbstractCegarLoop]: Abstraction has 1612 states and 2361 transitions. [2025-03-03 18:19:16,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 22.529411764705884) internal successors, (766), 34 states have internal predecessors, (766), 0 states have call successors, (0), 0 states 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 18:19:16,450 INFO L276 IsEmpty]: Start isEmpty. Operand 1612 states and 2361 transitions. [2025-03-03 18:19:16,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 18:19:16,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:16,451 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:16,463 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 18:19:16,652 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,SelfDestructingSolverStorable23 [2025-03-03 18:19:16,652 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:16,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:16,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1638178788, now seen corresponding path program 1 times [2025-03-03 18:19:16,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:16,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110493347] [2025-03-03 18:19:16,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:16,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:16,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 18:19:16,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 18:19:16,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:16,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:17,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:17,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110493347] [2025-03-03 18:19:17,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110493347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:17,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:17,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 18:19:17,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366318564] [2025-03-03 18:19:17,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:17,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 18:19:17,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:17,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 18:19:17,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 18:19:17,035 INFO L87 Difference]: Start difference. First operand 1612 states and 2361 transitions. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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 18:19:17,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:17,324 INFO L93 Difference]: Finished difference Result 2416 states and 3539 transitions. [2025-03-03 18:19:17,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:17,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2025-03-03 18:19:17,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:17,327 INFO L225 Difference]: With dead ends: 2416 [2025-03-03 18:19:17,327 INFO L226 Difference]: Without dead ends: 1634 [2025-03-03 18:19:17,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-03 18:19:17,328 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1729 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 2242 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:17,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 2242 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 18:19:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2025-03-03 18:19:17,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1606. [2025-03-03 18:19:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.464797507788162) internal successors, (2351), 1605 states have internal predecessors, (2351), 0 states have call successors, (0), 0 states 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 18:19:17,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 2351 transitions. [2025-03-03 18:19:17,341 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 2351 transitions. Word has length 261 [2025-03-03 18:19:17,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:17,341 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 2351 transitions. [2025-03-03 18:19:17,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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 18:19:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 2351 transitions. [2025-03-03 18:19:17,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-03 18:19:17,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:17,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:17,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 18:19:17,343 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:17,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:17,343 INFO L85 PathProgramCache]: Analyzing trace with hash -635105047, now seen corresponding path program 1 times [2025-03-03 18:19:17,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:17,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686389830] [2025-03-03 18:19:17,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:17,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:17,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-03 18:19:17,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-03 18:19:17,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:17,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:17,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686389830] [2025-03-03 18:19:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686389830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 18:19:17,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 18:19:17,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 18:19:17,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790694225] [2025-03-03 18:19:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:17,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:17,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 18:19:17,689 INFO L87 Difference]: Start difference. First operand 1606 states and 2351 transitions. Second operand has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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 18:19:17,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:17,897 INFO L93 Difference]: Finished difference Result 2033 states and 2986 transitions. [2025-03-03 18:19:17,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:17,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 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 261 [2025-03-03 18:19:17,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:17,899 INFO L225 Difference]: With dead ends: 2033 [2025-03-03 18:19:17,899 INFO L226 Difference]: Without dead ends: 1256 [2025-03-03 18:19:17,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 18:19:17,900 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 1727 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1727 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:17,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1727 Valid, 1685 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2025-03-03 18:19:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1238. [2025-03-03 18:19:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 1237 states have (on average 1.471301535974131) internal successors, (1820), 1237 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states 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 18:19:17,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1820 transitions. [2025-03-03 18:19:17,911 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1820 transitions. Word has length 261 [2025-03-03 18:19:17,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:17,911 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1820 transitions. [2025-03-03 18:19:17,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.2) internal successors, (261), 5 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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 18:19:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1820 transitions. [2025-03-03 18:19:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2025-03-03 18:19:17,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:17,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:17,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 18:19:17,913 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:17,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:17,914 INFO L85 PathProgramCache]: Analyzing trace with hash -556906100, now seen corresponding path program 1 times [2025-03-03 18:19:17,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:17,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510948986] [2025-03-03 18:19:17,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:17,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:17,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-03 18:19:21,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-03 18:19:21,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:21,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 173 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510948986] [2025-03-03 18:19:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510948986] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465172284] [2025-03-03 18:19:22,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:22,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:22,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:22,135 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 18:19:22,135 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 18:19:22,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 464 statements into 1 equivalence classes. [2025-03-03 18:19:23,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 464 of 464 statements. [2025-03-03 18:19:23,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:23,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:23,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-03 18:19:23,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 35 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:25,383 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:19:28,722 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 29 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:28,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465172284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 18:19:28,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 18:19:28,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 17] total 36 [2025-03-03 18:19:28,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618339875] [2025-03-03 18:19:28,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 18:19:28,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 18:19:28,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:28,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 18:19:28,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1066, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 18:19:28,726 INFO L87 Difference]: Start difference. First operand 1238 states and 1820 transitions. Second operand has 36 states, 36 states have (on average 36.861111111111114) internal successors, (1327), 36 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states 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 18:19:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:36,230 INFO L93 Difference]: Finished difference Result 17402 states and 25947 transitions. [2025-03-03 18:19:36,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2025-03-03 18:19:36,231 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 36.861111111111114) internal successors, (1327), 36 states have internal predecessors, (1327), 0 states have call successors, (0), 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 464 [2025-03-03 18:19:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:36,256 INFO L225 Difference]: With dead ends: 17402 [2025-03-03 18:19:36,256 INFO L226 Difference]: Without dead ends: 16322 [2025-03-03 18:19:36,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1060 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7874 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2875, Invalid=19475, Unknown=0, NotChecked=0, Total=22350 [2025-03-03 18:19:36,263 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 30298 mSDsluCounter, 26934 mSDsCounter, 0 mSdLazyCounter, 9952 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30298 SdHoareTripleChecker+Valid, 28277 SdHoareTripleChecker+Invalid, 9999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 9952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:36,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30298 Valid, 28277 Invalid, 9999 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [47 Valid, 9952 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-03 18:19:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16322 states. [2025-03-03 18:19:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16322 to 8058. [2025-03-03 18:19:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8058 states, 8057 states have (on average 1.48715402755368) internal successors, (11982), 8057 states have internal predecessors, (11982), 0 states have call successors, (0), 0 states 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 18:19:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8058 states to 8058 states and 11982 transitions. [2025-03-03 18:19:36,358 INFO L78 Accepts]: Start accepts. Automaton has 8058 states and 11982 transitions. Word has length 464 [2025-03-03 18:19:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:36,358 INFO L471 AbstractCegarLoop]: Abstraction has 8058 states and 11982 transitions. [2025-03-03 18:19:36,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 36.861111111111114) internal successors, (1327), 36 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states 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 18:19:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8058 states and 11982 transitions. [2025-03-03 18:19:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-03-03 18:19:36,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:36,364 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:36,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 18:19:36,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:36,564 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:36,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash 578851100, now seen corresponding path program 1 times [2025-03-03 18:19:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:36,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601748940] [2025-03-03 18:19:36,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:36,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 18:19:39,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 18:19:39,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:39,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 53 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:40,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:40,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601748940] [2025-03-03 18:19:40,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601748940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:40,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30921916] [2025-03-03 18:19:40,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:40,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:40,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:40,586 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 18:19:40,588 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 18:19:41,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-03-03 18:19:41,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-03-03 18:19:41,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:41,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:41,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 3065 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-03-03 18:19:41,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 48 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:43,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:19:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-03-03 18:19:43,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30921916] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:43,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:19:43,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 12] total 21 [2025-03-03 18:19:43,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116376853] [2025-03-03 18:19:43,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:43,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:43,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:43,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2025-03-03 18:19:43,543 INFO L87 Difference]: Start difference. First operand 8058 states and 11982 transitions. Second operand has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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 18:19:43,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:43,829 INFO L93 Difference]: Finished difference Result 14752 states and 21967 transitions. [2025-03-03 18:19:43,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:43,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 states have internal predecessors, (316), 0 states have call successors, (0), 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 466 [2025-03-03 18:19:43,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:43,842 INFO L225 Difference]: With dead ends: 14752 [2025-03-03 18:19:43,842 INFO L226 Difference]: Without dead ends: 8478 [2025-03-03 18:19:43,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 939 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-03-03 18:19:43,848 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 90 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 2418 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:43,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 2418 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:43,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8478 states. [2025-03-03 18:19:43,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8478 to 8194. [2025-03-03 18:19:43,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8194 states, 8193 states have (on average 1.4854143781276699) internal successors, (12170), 8193 states have internal predecessors, (12170), 0 states have call successors, (0), 0 states 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 18:19:43,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 12170 transitions. [2025-03-03 18:19:43,921 INFO L78 Accepts]: Start accepts. Automaton has 8194 states and 12170 transitions. Word has length 466 [2025-03-03 18:19:43,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:43,921 INFO L471 AbstractCegarLoop]: Abstraction has 8194 states and 12170 transitions. [2025-03-03 18:19:43,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.2) internal successors, (316), 5 states have internal predecessors, (316), 0 states have call successors, (0), 0 states 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 18:19:43,922 INFO L276 IsEmpty]: Start isEmpty. Operand 8194 states and 12170 transitions. [2025-03-03 18:19:43,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-03-03 18:19:43,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:43,928 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:43,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 18:19:44,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-03 18:19:44,128 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:44,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:44,129 INFO L85 PathProgramCache]: Analyzing trace with hash 946705644, now seen corresponding path program 1 times [2025-03-03 18:19:44,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:44,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985316103] [2025-03-03 18:19:44,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:44,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:44,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-03 18:19:46,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-03 18:19:46,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:46,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:47,923 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 53 proven. 164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:47,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:47,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985316103] [2025-03-03 18:19:47,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985316103] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:47,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869375317] [2025-03-03 18:19:47,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:47,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:47,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:47,926 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 18:19:47,927 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 18:19:48,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-03-03 18:19:48,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-03-03 18:19:48,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:48,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:48,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 3068 conjuncts, 67 conjuncts are in the unsatisfiable core [2025-03-03 18:19:48,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 18:19:51,147 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 48 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:51,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 18:19:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2025-03-03 18:19:51,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869375317] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:51,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 18:19:51,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8, 14] total 23 [2025-03-03 18:19:51,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619912704] [2025-03-03 18:19:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 18:19:51,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 18:19:51,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 18:19:51,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 18:19:51,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2025-03-03 18:19:51,298 INFO L87 Difference]: Start difference. First operand 8194 states and 12170 transitions. Second operand has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 18:19:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 18:19:51,581 INFO L93 Difference]: Finished difference Result 15880 states and 23615 transitions. [2025-03-03 18:19:51,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 18:19:51,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 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 467 [2025-03-03 18:19:51,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 18:19:51,591 INFO L225 Difference]: With dead ends: 15880 [2025-03-03 18:19:51,592 INFO L226 Difference]: Without dead ends: 9038 [2025-03-03 18:19:51,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 941 GetRequests, 919 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-03-03 18:19:51,598 INFO L435 NwaCegarLoop]: 700 mSDtfsCounter, 125 mSDsluCounter, 1804 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 18:19:51,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 2504 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 18:19:51,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9038 states. [2025-03-03 18:19:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9038 to 8338. [2025-03-03 18:19:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8338 states, 8337 states have (on average 1.4842269401463357) internal successors, (12374), 8337 states have internal predecessors, (12374), 0 states have call successors, (0), 0 states 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 18:19:51,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8338 states to 8338 states and 12374 transitions. [2025-03-03 18:19:51,678 INFO L78 Accepts]: Start accepts. Automaton has 8338 states and 12374 transitions. Word has length 467 [2025-03-03 18:19:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 18:19:51,678 INFO L471 AbstractCegarLoop]: Abstraction has 8338 states and 12374 transitions. [2025-03-03 18:19:51,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 66.8) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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 18:19:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 8338 states and 12374 transitions. [2025-03-03 18:19:51,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2025-03-03 18:19:51,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 18:19:51,684 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 18:19:51,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 18:19:51,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-03 18:19:51,885 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 18:19:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 18:19:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1289743855, now seen corresponding path program 1 times [2025-03-03 18:19:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 18:19:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517632833] [2025-03-03 18:19:51,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 18:19:51,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes. [2025-03-03 18:19:54,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 468 of 468 statements. [2025-03-03 18:19:54,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 18:19:54,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 18:19:55,491 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 91 proven. 127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 18:19:55,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 18:19:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517632833] [2025-03-03 18:19:55,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517632833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 18:19:55,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374908189] [2025-03-03 18:19:55,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 18:19:55,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 18:19:55,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 18:19:55,495 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 18:19:55,495 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 18:19:56,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 468 statements into 1 equivalence classes.