./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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.cal9.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 21ba1e2aac39d30ab80cebcc5810c00ee6372583f3d8403b849f6ba17231dc2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 21:31:58,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 21:31:58,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-16 21:31:58,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 21:31:58,466 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 21:31:58,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 21:31:58,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 21:31:58,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 21:31:58,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 21:31:58,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 21:31:58,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 21:31:58,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 21:31:58,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 21:31:58,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 21:31:58,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 21:31:58,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 21:31:58,491 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 21:31:58,491 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 21:31:58,491 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 21:31:58,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 21:31:58,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 21:31:58,491 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 21:31:58,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:31:58,491 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 21:31:58,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 21:31:58,492 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 -> 21ba1e2aac39d30ab80cebcc5810c00ee6372583f3d8403b849f6ba17231dc2d [2025-03-16 21:31:58,681 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 21:31:58,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 21:31:58,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 21:31:58,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 21:31:58,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 21:31:58,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c [2025-03-16 21:31:59,807 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9d29cf2/1c26cf8159fa472884c8432e667bc9f1/FLAGd337ace59 [2025-03-16 21:32:00,132 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 21:32:00,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal9.c [2025-03-16 21:32:00,149 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9d29cf2/1c26cf8159fa472884c8432e667bc9f1/FLAGd337ace59 [2025-03-16 21:32:00,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb9d29cf2/1c26cf8159fa472884c8432e667bc9f1 [2025-03-16 21:32:00,389 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 21:32:00,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 21:32:00,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 21:32:00,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 21:32:00,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 21:32:00,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:00,398 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215d5655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00, skipping insertion in model container [2025-03-16 21:32:00,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:00,437 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 21:32:00,560 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.cal9.c[1244,1257] [2025-03-16 21:32:00,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:32:00,805 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 21:32:00,813 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.cal9.c[1244,1257] [2025-03-16 21:32:00,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 21:32:00,940 INFO L204 MainTranslator]: Completed translation [2025-03-16 21:32:00,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00 WrapperNode [2025-03-16 21:32:00,941 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 21:32:00,942 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 21:32:00,942 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 21:32:00,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 21:32:00,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:00,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,298 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3628 [2025-03-16 21:32:01,299 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 21:32:01,299 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 21:32:01,300 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 21:32:01,300 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 21:32:01,309 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,406 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,488 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-16 21:32:01,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 21:32:01,694 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 21:32:01,694 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 21:32:01,694 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 21:32:01,695 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (1/1) ... [2025-03-16 21:32:01,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 21:32:01,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 21:32:01,742 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-16 21:32:01,747 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-16 21:32:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 21:32:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 21:32:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 21:32:01,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 21:32:01,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 21:32:02,034 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 21:32:02,035 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 21:32:05,224 INFO L? ?]: Removed 2032 outVars from TransFormulas that were not future-live. [2025-03-16 21:32:05,225 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 21:32:05,342 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 21:32:05,342 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 21:32:05,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:32:05 BoogieIcfgContainer [2025-03-16 21:32:05,342 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 21:32:05,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 21:32:05,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 21:32:05,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 21:32:05,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:32:00" (1/3) ... [2025-03-16 21:32:05,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b7d428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:32:05, skipping insertion in model container [2025-03-16 21:32:05,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:32:00" (2/3) ... [2025-03-16 21:32:05,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39b7d428 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:32:05, skipping insertion in model container [2025-03-16 21:32:05,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:32:05" (3/3) ... [2025-03-16 21:32:05,354 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal9.c [2025-03-16 21:32:05,367 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 21:32:05,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal9.c that has 1 procedures, 1083 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 21:32:05,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 21:32:05,448 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;@219bab0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 21:32:05,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 21:32:05,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 1083 states, 1081 states have (on average 1.5013876040703054) internal successors, (1623), 1082 states have internal predecessors, (1623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2025-03-16 21:32:05,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:05,478 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:05,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:05,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1271760434, now seen corresponding path program 1 times [2025-03-16 21:32:05,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:05,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748610462] [2025-03-16 21:32:05,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:05,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes. [2025-03-16 21:32:06,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements. [2025-03-16 21:32:06,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:06,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:07,586 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-16 21:32:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748610462] [2025-03-16 21:32:07,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748610462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:07,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:07,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209980973] [2025-03-16 21:32:07,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:07,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:32:07,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:07,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:32:07,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:07,619 INFO L87 Difference]: Start difference. First operand has 1083 states, 1081 states have (on average 1.5013876040703054) internal successors, (1623), 1082 states have internal predecessors, (1623), 0 states have call successors, (0), 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 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:08,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:08,173 INFO L93 Difference]: Finished difference Result 2137 states and 3205 transitions. [2025-03-16 21:32:08,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:32:08,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2025-03-16 21:32:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:08,196 INFO L225 Difference]: With dead ends: 2137 [2025-03-16 21:32:08,196 INFO L226 Difference]: Without dead ends: 1083 [2025-03-16 21:32:08,201 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-16 21:32:08,204 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 0 mSDsluCounter, 2695 mSDsCounter, 0 mSdLazyCounter, 814 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:08,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4045 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 814 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:32:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2025-03-16 21:32:08,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1083. [2025-03-16 21:32:08,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1082 states have (on average 1.4990757855822552) internal successors, (1622), 1082 states have internal predecessors, (1622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1622 transitions. [2025-03-16 21:32:08,256 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1622 transitions. Word has length 344 [2025-03-16 21:32:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:08,257 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1622 transitions. [2025-03-16 21:32:08,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:08,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1622 transitions. [2025-03-16 21:32:08,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2025-03-16 21:32:08,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:08,260 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:08,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 21:32:08,261 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:08,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:08,261 INFO L85 PathProgramCache]: Analyzing trace with hash 774547619, now seen corresponding path program 1 times [2025-03-16 21:32:08,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:08,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276778489] [2025-03-16 21:32:08,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:08,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:08,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes. [2025-03-16 21:32:08,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements. [2025-03-16 21:32:08,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:08,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:09,052 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-16 21:32:09,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276778489] [2025-03-16 21:32:09,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276778489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:09,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574314292] [2025-03-16 21:32:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:09,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:32:09,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:09,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:32:09,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:09,056 INFO L87 Difference]: Start difference. First operand 1083 states and 1622 transitions. Second operand has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:09,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:09,502 INFO L93 Difference]: Finished difference Result 2139 states and 3204 transitions. [2025-03-16 21:32:09,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:32:09,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 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 345 [2025-03-16 21:32:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:09,507 INFO L225 Difference]: With dead ends: 2139 [2025-03-16 21:32:09,507 INFO L226 Difference]: Without dead ends: 1085 [2025-03-16 21:32:09,509 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-16 21:32:09,510 INFO L435 NwaCegarLoop]: 1350 mSDtfsCounter, 0 mSDsluCounter, 2692 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:09,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4042 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:32:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2025-03-16 21:32:09,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 1085. [2025-03-16 21:32:09,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1085 states, 1084 states have (on average 1.4981549815498154) internal successors, (1624), 1084 states have internal predecessors, (1624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1085 states to 1085 states and 1624 transitions. [2025-03-16 21:32:09,535 INFO L78 Accepts]: Start accepts. Automaton has 1085 states and 1624 transitions. Word has length 345 [2025-03-16 21:32:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:09,536 INFO L471 AbstractCegarLoop]: Abstraction has 1085 states and 1624 transitions. [2025-03-16 21:32:09,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 1085 states and 1624 transitions. [2025-03-16 21:32:09,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-16 21:32:09,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:09,539 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:09,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 21:32:09,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:09,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:09,540 INFO L85 PathProgramCache]: Analyzing trace with hash 172682317, now seen corresponding path program 1 times [2025-03-16 21:32:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294256781] [2025-03-16 21:32:09,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:09,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:09,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-16 21:32:11,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-16 21:32:11,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:11,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:12,671 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-16 21:32:12,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:12,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294256781] [2025-03-16 21:32:12,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294256781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:12,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:12,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:32:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578006224] [2025-03-16 21:32:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:12,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:32:12,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:12,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:32:12,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:32:12,674 INFO L87 Difference]: Start difference. First operand 1085 states and 1624 transitions. Second operand has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:13,531 INFO L93 Difference]: Finished difference Result 2805 states and 4198 transitions. [2025-03-16 21:32:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:32:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 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 346 [2025-03-16 21:32:13,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:13,538 INFO L225 Difference]: With dead ends: 2805 [2025-03-16 21:32:13,538 INFO L226 Difference]: Without dead ends: 1749 [2025-03-16 21:32:13,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:32:13,540 INFO L435 NwaCegarLoop]: 1331 mSDtfsCounter, 4181 mSDsluCounter, 3993 mSDsCounter, 0 mSdLazyCounter, 1155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4181 SdHoareTripleChecker+Valid, 5324 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:13,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4181 Valid, 5324 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1155 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:32:13,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1749 states. [2025-03-16 21:32:13,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1749 to 1730. [2025-03-16 21:32:13,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1729 states have (on average 1.4991324465008675) internal successors, (2592), 1729 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2592 transitions. [2025-03-16 21:32:13,578 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2592 transitions. Word has length 346 [2025-03-16 21:32:13,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:13,578 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2592 transitions. [2025-03-16 21:32:13,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.666666666666664) internal successors, (346), 5 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:13,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2592 transitions. [2025-03-16 21:32:13,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2025-03-16 21:32:13,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:13,582 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 21:32:13,582 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:13,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1348419576, now seen corresponding path program 1 times [2025-03-16 21:32:13,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:13,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699197674] [2025-03-16 21:32:13,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:13,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:13,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes. [2025-03-16 21:32:14,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements. [2025-03-16 21:32:14,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:14,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:14,823 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-16 21:32:14,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:14,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699197674] [2025-03-16 21:32:14,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699197674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:14,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:14,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:14,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99204206] [2025-03-16 21:32:14,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:14,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:32:14,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:14,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:32:14,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:14,825 INFO L87 Difference]: Start difference. First operand 1730 states and 2592 transitions. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:15,674 INFO L93 Difference]: Finished difference Result 3806 states and 5700 transitions. [2025-03-16 21:32:15,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:32:15,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 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 347 [2025-03-16 21:32:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:15,680 INFO L225 Difference]: With dead ends: 3806 [2025-03-16 21:32:15,680 INFO L226 Difference]: Without dead ends: 1730 [2025-03-16 21:32:15,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:15,683 INFO L435 NwaCegarLoop]: 2030 mSDtfsCounter, 1421 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1421 SdHoareTripleChecker+Valid, 5259 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:15,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1421 Valid, 5259 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:32:15,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-16 21:32:15,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1730. [2025-03-16 21:32:15,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1729 states have (on average 1.4979757085020242) internal successors, (2590), 1729 states have internal predecessors, (2590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2590 transitions. [2025-03-16 21:32:15,710 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2590 transitions. Word has length 347 [2025-03-16 21:32:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:15,710 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2590 transitions. [2025-03-16 21:32:15,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:15,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2590 transitions. [2025-03-16 21:32:15,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-16 21:32:15,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:15,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:15,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 21:32:15,714 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:15,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:15,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1544632310, now seen corresponding path program 1 times [2025-03-16 21:32:15,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:15,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872137708] [2025-03-16 21:32:15,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:15,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:15,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-16 21:32:16,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-16 21:32:16,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:16,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:16,731 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-16 21:32:16,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:16,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872137708] [2025-03-16 21:32:16,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872137708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:16,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:16,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:16,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677000379] [2025-03-16 21:32:16,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:16,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:32:16,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:16,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:32:16,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:16,733 INFO L87 Difference]: Start difference. First operand 1730 states and 2590 transitions. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:17,199 INFO L93 Difference]: Finished difference Result 2808 states and 4202 transitions. [2025-03-16 21:32:17,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:32:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 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 348 [2025-03-16 21:32:17,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:17,205 INFO L225 Difference]: With dead ends: 2808 [2025-03-16 21:32:17,205 INFO L226 Difference]: Without dead ends: 1730 [2025-03-16 21:32:17,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:17,207 INFO L435 NwaCegarLoop]: 1346 mSDtfsCounter, 27 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 4013 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:17,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 4013 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:32:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2025-03-16 21:32:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1730. [2025-03-16 21:32:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1729 states have (on average 1.4968189705031811) internal successors, (2588), 1729 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:17,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2588 transitions. [2025-03-16 21:32:17,234 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2588 transitions. Word has length 348 [2025-03-16 21:32:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2588 transitions. [2025-03-16 21:32:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2588 transitions. [2025-03-16 21:32:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-16 21:32:17,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:17,237 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:17,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 21:32:17,238 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1978831117, now seen corresponding path program 1 times [2025-03-16 21:32:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678488126] [2025-03-16 21:32:17,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:17,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:17,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-16 21:32:17,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-16 21:32:17,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:17,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:18,129 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-16 21:32:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678488126] [2025-03-16 21:32:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678488126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:18,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:32:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70346108] [2025-03-16 21:32:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:32:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:18,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:32:18,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:18,133 INFO L87 Difference]: Start difference. First operand 1730 states and 2588 transitions. Second operand has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:18,874 INFO L93 Difference]: Finished difference Result 2816 states and 4209 transitions. [2025-03-16 21:32:18,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:32:18,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 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 349 [2025-03-16 21:32:18,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:18,880 INFO L225 Difference]: With dead ends: 2816 [2025-03-16 21:32:18,880 INFO L226 Difference]: Without dead ends: 1738 [2025-03-16 21:32:18,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:18,883 INFO L435 NwaCegarLoop]: 1200 mSDtfsCounter, 1617 mSDsluCounter, 2396 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1617 SdHoareTripleChecker+Valid, 3596 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:18,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1617 Valid, 3596 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:32:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2025-03-16 21:32:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1736. [2025-03-16 21:32:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1735 states have (on average 1.4951008645533141) internal successors, (2594), 1735 states have internal predecessors, (2594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2594 transitions. [2025-03-16 21:32:18,912 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2594 transitions. Word has length 349 [2025-03-16 21:32:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:18,913 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2594 transitions. [2025-03-16 21:32:18,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 69.8) internal successors, (349), 5 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2594 transitions. [2025-03-16 21:32:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-03-16 21:32:18,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:18,916 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:18,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 21:32:18,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:18,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -26012894, now seen corresponding path program 1 times [2025-03-16 21:32:18,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:18,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313624272] [2025-03-16 21:32:18,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:18,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-03-16 21:32:19,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-03-16 21:32:19,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:19,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:20,579 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-16 21:32:20,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:20,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313624272] [2025-03-16 21:32:20,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313624272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:20,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:20,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:32:20,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126911846] [2025-03-16 21:32:20,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:20,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:32:20,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:20,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:32:20,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:32:20,580 INFO L87 Difference]: Start difference. First operand 1736 states and 2594 transitions. Second operand has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:21,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:21,282 INFO L93 Difference]: Finished difference Result 2813 states and 4202 transitions. [2025-03-16 21:32:21,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:32:21,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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 350 [2025-03-16 21:32:21,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:21,288 INFO L225 Difference]: With dead ends: 2813 [2025-03-16 21:32:21,288 INFO L226 Difference]: Without dead ends: 1744 [2025-03-16 21:32:21,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:21,290 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 1614 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1614 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:21,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1614 Valid, 3598 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:32:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2025-03-16 21:32:21,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1740. [2025-03-16 21:32:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1740 states, 1739 states have (on average 1.4939620471535364) internal successors, (2598), 1739 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:21,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1740 states to 1740 states and 2598 transitions. [2025-03-16 21:32:21,319 INFO L78 Accepts]: Start accepts. Automaton has 1740 states and 2598 transitions. Word has length 350 [2025-03-16 21:32:21,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:21,320 INFO L471 AbstractCegarLoop]: Abstraction has 1740 states and 2598 transitions. [2025-03-16 21:32:21,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.333333333333336) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:21,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1740 states and 2598 transitions. [2025-03-16 21:32:21,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-16 21:32:21,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:21,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:21,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 21:32:21,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:21,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:21,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1646665153, now seen corresponding path program 1 times [2025-03-16 21:32:21,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:21,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76925781] [2025-03-16 21:32:21,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:21,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:21,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-16 21:32:22,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-16 21:32:22,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:22,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:23,173 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-16 21:32:23,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:23,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76925781] [2025-03-16 21:32:23,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76925781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:23,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:23,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:32:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023951797] [2025-03-16 21:32:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:23,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:32:23,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:23,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:32:23,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:32:23,175 INFO L87 Difference]: Start difference. First operand 1740 states and 2598 transitions. Second operand has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:24,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:24,072 INFO L93 Difference]: Finished difference Result 2822 states and 4209 transitions. [2025-03-16 21:32:24,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:32:24,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 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 351 [2025-03-16 21:32:24,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:24,077 INFO L225 Difference]: With dead ends: 2822 [2025-03-16 21:32:24,078 INFO L226 Difference]: Without dead ends: 1761 [2025-03-16 21:32:24,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-16 21:32:24,080 INFO L435 NwaCegarLoop]: 1328 mSDtfsCounter, 4172 mSDsluCounter, 6635 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4172 SdHoareTripleChecker+Valid, 7963 SdHoareTripleChecker+Invalid, 1744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:24,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4172 Valid, 7963 Invalid, 1744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:32:24,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2025-03-16 21:32:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1743. [2025-03-16 21:32:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1743 states, 1742 states have (on average 1.4936854190585533) internal successors, (2602), 1742 states have internal predecessors, (2602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:24,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2602 transitions. [2025-03-16 21:32:24,107 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2602 transitions. Word has length 351 [2025-03-16 21:32:24,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:24,107 INFO L471 AbstractCegarLoop]: Abstraction has 1743 states and 2602 transitions. [2025-03-16 21:32:24,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 43.875) internal successors, (351), 7 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:24,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2602 transitions. [2025-03-16 21:32:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 21:32:24,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:24,109 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:24,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 21:32:24,111 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:24,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:24,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1890768195, now seen corresponding path program 1 times [2025-03-16 21:32:24,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:24,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54671590] [2025-03-16 21:32:24,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:24,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:24,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 21:32:24,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 21:32:24,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:24,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:25,037 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-16 21:32:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:25,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54671590] [2025-03-16 21:32:25,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54671590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:25,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:25,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:25,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906183022] [2025-03-16 21:32:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:25,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:32:25,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:25,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:32:25,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:25,039 INFO L87 Difference]: Start difference. First operand 1743 states and 2602 transitions. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:25,439 INFO L93 Difference]: Finished difference Result 2817 states and 4204 transitions. [2025-03-16 21:32:25,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:32:25,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 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 352 [2025-03-16 21:32:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:25,444 INFO L225 Difference]: With dead ends: 2817 [2025-03-16 21:32:25,444 INFO L226 Difference]: Without dead ends: 1743 [2025-03-16 21:32:25,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:25,446 INFO L435 NwaCegarLoop]: 1203 mSDtfsCounter, 1604 mSDsluCounter, 1200 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1604 SdHoareTripleChecker+Valid, 2403 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:25,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1604 Valid, 2403 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:32:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-03-16 21:32:25,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1739. [2025-03-16 21:32:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 1.4936708860759493) internal successors, (2596), 1738 states have internal predecessors, (2596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2596 transitions. [2025-03-16 21:32:25,467 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2596 transitions. Word has length 352 [2025-03-16 21:32:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:25,467 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2596 transitions. [2025-03-16 21:32:25,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2596 transitions. [2025-03-16 21:32:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-03-16 21:32:25,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:25,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:25,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 21:32:25,469 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:25,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:25,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1499061598, now seen corresponding path program 1 times [2025-03-16 21:32:25,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:25,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341186485] [2025-03-16 21:32:25,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:25,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:25,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-03-16 21:32:26,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-03-16 21:32:26,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:26,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:27,972 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-16 21:32:27,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:27,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341186485] [2025-03-16 21:32:27,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341186485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:27,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:27,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:32:27,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241723419] [2025-03-16 21:32:27,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:27,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:32:27,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:27,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:32:27,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:27,974 INFO L87 Difference]: Start difference. First operand 1739 states and 2596 transitions. Second operand has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:28,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:28,546 INFO L93 Difference]: Finished difference Result 4348 states and 6484 transitions. [2025-03-16 21:32:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 21:32:28,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 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 352 [2025-03-16 21:32:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:28,552 INFO L225 Difference]: With dead ends: 4348 [2025-03-16 21:32:28,552 INFO L226 Difference]: Without dead ends: 3193 [2025-03-16 21:32:28,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:32:28,554 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 3807 mSDsluCounter, 5327 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3807 SdHoareTripleChecker+Valid, 6663 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:28,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3807 Valid, 6663 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:32:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2025-03-16 21:32:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2797. [2025-03-16 21:32:28,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2796 states have (on average 1.496423462088698) internal successors, (4184), 2796 states have internal predecessors, (4184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4184 transitions. [2025-03-16 21:32:28,587 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4184 transitions. Word has length 352 [2025-03-16 21:32:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:28,588 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 4184 transitions. [2025-03-16 21:32:28,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.285714285714285) internal successors, (352), 6 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4184 transitions. [2025-03-16 21:32:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-16 21:32:28,591 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:28,591 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:28,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 21:32:28,591 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:28,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 506435308, now seen corresponding path program 1 times [2025-03-16 21:32:28,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:28,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008976577] [2025-03-16 21:32:28,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:28,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:28,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-16 21:32:29,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-16 21:32:29,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:29,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:30,243 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-16 21:32:30,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:30,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008976577] [2025-03-16 21:32:30,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008976577] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:30,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:30,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:32:30,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966525705] [2025-03-16 21:32:30,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:30,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-16 21:32:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:30,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-16 21:32:30,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:32:30,245 INFO L87 Difference]: Start difference. First operand 2797 states and 4184 transitions. Second operand has 8 states, 8 states have (on average 44.125) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:31,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:31,003 INFO L93 Difference]: Finished difference Result 6819 states and 10204 transitions. [2025-03-16 21:32:31,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:32:31,003 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 44.125) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 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 353 [2025-03-16 21:32:31,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:31,012 INFO L225 Difference]: With dead ends: 6819 [2025-03-16 21:32:31,012 INFO L226 Difference]: Without dead ends: 4669 [2025-03-16 21:32:31,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-16 21:32:31,014 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 3133 mSDsluCounter, 6536 mSDsCounter, 0 mSdLazyCounter, 1828 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3133 SdHoareTripleChecker+Valid, 7873 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:31,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3133 Valid, 7873 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:32:31,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2025-03-16 21:32:31,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4561. [2025-03-16 21:32:31,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4561 states, 4560 states have (on average 1.4982456140350877) internal successors, (6832), 4560 states have internal predecessors, (6832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4561 states to 4561 states and 6832 transitions. [2025-03-16 21:32:31,059 INFO L78 Accepts]: Start accepts. Automaton has 4561 states and 6832 transitions. Word has length 353 [2025-03-16 21:32:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:31,059 INFO L471 AbstractCegarLoop]: Abstraction has 4561 states and 6832 transitions. [2025-03-16 21:32:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 44.125) internal successors, (353), 7 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4561 states and 6832 transitions. [2025-03-16 21:32:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 21:32:31,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:31,062 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:31,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 21:32:31,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:31,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1698794325, now seen corresponding path program 1 times [2025-03-16 21:32:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158594649] [2025-03-16 21:32:31,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:31,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:31,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 21:32:32,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 21:32:32,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:32,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:32,905 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-16 21:32:32,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:32,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158594649] [2025-03-16 21:32:32,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158594649] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:32,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:32,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:32:32,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86199817] [2025-03-16 21:32:32,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:32,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:32:32,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:32,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:32:32,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:32,907 INFO L87 Difference]: Start difference. First operand 4561 states and 6832 transitions. Second operand has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:33,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:33,680 INFO L93 Difference]: Finished difference Result 7417 states and 11101 transitions. [2025-03-16 21:32:33,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:32:33,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2025-03-16 21:32:33,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:33,691 INFO L225 Difference]: With dead ends: 7417 [2025-03-16 21:32:33,691 INFO L226 Difference]: Without dead ends: 4669 [2025-03-16 21:32:33,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:32:33,695 INFO L435 NwaCegarLoop]: 1229 mSDtfsCounter, 2589 mSDsluCounter, 4872 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 6101 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:33,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 6101 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:32:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2025-03-16 21:32:33,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4565. [2025-03-16 21:32:33,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4565 states, 4564 states have (on average 1.4978089395267309) internal successors, (6836), 4564 states have internal predecessors, (6836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:33,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4565 states to 4565 states and 6836 transitions. [2025-03-16 21:32:33,745 INFO L78 Accepts]: Start accepts. Automaton has 4565 states and 6836 transitions. Word has length 354 [2025-03-16 21:32:33,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:33,746 INFO L471 AbstractCegarLoop]: Abstraction has 4565 states and 6836 transitions. [2025-03-16 21:32:33,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:33,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4565 states and 6836 transitions. [2025-03-16 21:32:33,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 21:32:33,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:33,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:33,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 21:32:33,750 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:33,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:33,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1292482310, now seen corresponding path program 1 times [2025-03-16 21:32:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:33,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991300054] [2025-03-16 21:32:33,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:33,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:33,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 21:32:34,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 21:32:34,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:34,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:35,874 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-16 21:32:35,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:35,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991300054] [2025-03-16 21:32:35,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991300054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:35,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:35,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-16 21:32:35,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284439609] [2025-03-16 21:32:35,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:35,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-16 21:32:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:35,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-16 21:32:35,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:32:35,876 INFO L87 Difference]: Start difference. First operand 4565 states and 6836 transitions. Second operand has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:37,767 INFO L93 Difference]: Finished difference Result 7556 states and 11295 transitions. [2025-03-16 21:32:37,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 21:32:37,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2025-03-16 21:32:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:37,776 INFO L225 Difference]: With dead ends: 7556 [2025-03-16 21:32:37,776 INFO L226 Difference]: Without dead ends: 5019 [2025-03-16 21:32:37,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-16 21:32:37,779 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 1891 mSDsluCounter, 9450 mSDsCounter, 0 mSdLazyCounter, 5267 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 10850 SdHoareTripleChecker+Invalid, 5270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:37,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 10850 Invalid, 5270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5267 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 21:32:37,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5019 states. [2025-03-16 21:32:37,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5019 to 4623. [2025-03-16 21:32:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 4622 states have (on average 1.4971873647771528) internal successors, (6920), 4622 states have internal predecessors, (6920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 6920 transitions. [2025-03-16 21:32:37,819 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 6920 transitions. Word has length 354 [2025-03-16 21:32:37,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:37,819 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 6920 transitions. [2025-03-16 21:32:37,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 35.4) internal successors, (354), 10 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:37,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 6920 transitions. [2025-03-16 21:32:37,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-16 21:32:37,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:37,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:37,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 21:32:37,823 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:37,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:37,823 INFO L85 PathProgramCache]: Analyzing trace with hash -420255212, now seen corresponding path program 1 times [2025-03-16 21:32:37,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:37,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419473471] [2025-03-16 21:32:37,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:37,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:37,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 354 statements into 1 equivalence classes. [2025-03-16 21:32:39,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 354 of 354 statements. [2025-03-16 21:32:39,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:39,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:39,756 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-16 21:32:39,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:39,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419473471] [2025-03-16 21:32:39,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419473471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:39,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:39,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:39,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746541286] [2025-03-16 21:32:39,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:39,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:32:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:39,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:32:39,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:39,757 INFO L87 Difference]: Start difference. First operand 4623 states and 6920 transitions. Second operand has 5 states, 5 states have (on average 70.8) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:40,261 INFO L93 Difference]: Finished difference Result 7145 states and 10691 transitions. [2025-03-16 21:32:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:32:40,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 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 354 [2025-03-16 21:32:40,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:40,267 INFO L225 Difference]: With dead ends: 7145 [2025-03-16 21:32:40,267 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 21:32:40,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:32:40,269 INFO L435 NwaCegarLoop]: 1201 mSDtfsCounter, 1288 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 1252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1288 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:40,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1288 Valid, 3598 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:32:40,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 21:32:40,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4629. [2025-03-16 21:32:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4628 states have (on average 1.496542783059637) internal successors, (6926), 4628 states have internal predecessors, (6926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:40,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 6926 transitions. [2025-03-16 21:32:40,299 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 6926 transitions. Word has length 354 [2025-03-16 21:32:40,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:40,299 INFO L471 AbstractCegarLoop]: Abstraction has 4629 states and 6926 transitions. [2025-03-16 21:32:40,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 70.8) internal successors, (354), 4 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 6926 transitions. [2025-03-16 21:32:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-03-16 21:32:40,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:40,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:40,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 21:32:40,303 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:40,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:40,303 INFO L85 PathProgramCache]: Analyzing trace with hash -538877115, now seen corresponding path program 1 times [2025-03-16 21:32:40,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:40,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825818892] [2025-03-16 21:32:40,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:40,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:40,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-03-16 21:32:41,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-03-16 21:32:41,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:41,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:41,944 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-16 21:32:41,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:41,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825818892] [2025-03-16 21:32:41,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825818892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:41,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:41,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:32:41,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208013425] [2025-03-16 21:32:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:41,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:32:41,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:41,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:32:41,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:32:41,945 INFO L87 Difference]: Start difference. First operand 4629 states and 6926 transitions. Second operand has 6 states, 6 states have (on average 59.166666666666664) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:42,341 INFO L93 Difference]: Finished difference Result 7202 states and 10762 transitions. [2025-03-16 21:32:42,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:32:42,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 59.166666666666664) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 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 355 [2025-03-16 21:32:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:42,346 INFO L225 Difference]: With dead ends: 7202 [2025-03-16 21:32:42,346 INFO L226 Difference]: Without dead ends: 4689 [2025-03-16 21:32:42,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-16 21:32:42,349 INFO L435 NwaCegarLoop]: 1344 mSDtfsCounter, 1340 mSDsluCounter, 4024 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 5368 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:42,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 5368 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:32:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4689 states. [2025-03-16 21:32:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4689 to 4685. [2025-03-16 21:32:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4685 states, 4684 states have (on average 1.493595217762596) internal successors, (6996), 4684 states have internal predecessors, (6996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:42,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4685 states to 4685 states and 6996 transitions. [2025-03-16 21:32:42,386 INFO L78 Accepts]: Start accepts. Automaton has 4685 states and 6996 transitions. Word has length 355 [2025-03-16 21:32:42,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:42,387 INFO L471 AbstractCegarLoop]: Abstraction has 4685 states and 6996 transitions. [2025-03-16 21:32:42,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.166666666666664) internal successors, (355), 5 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 4685 states and 6996 transitions. [2025-03-16 21:32:42,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 21:32:42,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:42,390 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:42,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 21:32:42,391 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:42,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:42,391 INFO L85 PathProgramCache]: Analyzing trace with hash -2051222738, now seen corresponding path program 1 times [2025-03-16 21:32:42,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:42,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108207711] [2025-03-16 21:32:42,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:42,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:42,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 21:32:43,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 21:32:43,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:43,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:44,211 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-16 21:32:44,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:44,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108207711] [2025-03-16 21:32:44,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108207711] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:44,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:44,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:32:44,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7893577] [2025-03-16 21:32:44,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:44,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:32:44,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:44,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:32:44,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:32:44,212 INFO L87 Difference]: Start difference. First operand 4685 states and 6996 transitions. Second operand has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:44,559 INFO L93 Difference]: Finished difference Result 7226 states and 10789 transitions. [2025-03-16 21:32:44,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:32:44,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-03-16 21:32:44,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:44,565 INFO L225 Difference]: With dead ends: 7226 [2025-03-16 21:32:44,565 INFO L226 Difference]: Without dead ends: 4685 [2025-03-16 21:32:44,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:32:44,567 INFO L435 NwaCegarLoop]: 1342 mSDtfsCounter, 14 mSDsluCounter, 2694 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4036 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:44,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4036 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:32:44,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2025-03-16 21:32:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 4629. [2025-03-16 21:32:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4628 states have (on average 1.4961106309420915) internal successors, (6924), 4628 states have internal predecessors, (6924), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:44,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 6924 transitions. [2025-03-16 21:32:44,601 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 6924 transitions. Word has length 356 [2025-03-16 21:32:44,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:44,601 INFO L471 AbstractCegarLoop]: Abstraction has 4629 states and 6924 transitions. [2025-03-16 21:32:44,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:44,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 6924 transitions. [2025-03-16 21:32:44,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 21:32:44,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:44,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:44,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 21:32:44,605 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash 878501460, now seen corresponding path program 1 times [2025-03-16 21:32:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907840395] [2025-03-16 21:32:44,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:44,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 21:32:44,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 21:32:44,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:44,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:45,323 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-16 21:32:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907840395] [2025-03-16 21:32:45,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907840395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:45,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:45,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:32:45,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370908323] [2025-03-16 21:32:45,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:45,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:32:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:45,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:32:45,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:45,324 INFO L87 Difference]: Start difference. First operand 4629 states and 6924 transitions. Second operand has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:45,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:45,852 INFO L93 Difference]: Finished difference Result 7150 states and 10691 transitions. [2025-03-16 21:32:45,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:32:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-03-16 21:32:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:45,858 INFO L225 Difference]: With dead ends: 7150 [2025-03-16 21:32:45,859 INFO L226 Difference]: Without dead ends: 4637 [2025-03-16 21:32:45,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:45,862 INFO L435 NwaCegarLoop]: 1199 mSDtfsCounter, 1603 mSDsluCounter, 2394 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1603 SdHoareTripleChecker+Valid, 3593 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:45,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1603 Valid, 3593 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:32:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4637 states. [2025-03-16 21:32:45,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4637 to 4635. [2025-03-16 21:32:45,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4635 states, 4634 states have (on average 1.4954682779456194) internal successors, (6930), 4634 states have internal predecessors, (6930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4635 states to 4635 states and 6930 transitions. [2025-03-16 21:32:45,899 INFO L78 Accepts]: Start accepts. Automaton has 4635 states and 6930 transitions. Word has length 356 [2025-03-16 21:32:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:45,899 INFO L471 AbstractCegarLoop]: Abstraction has 4635 states and 6930 transitions. [2025-03-16 21:32:45,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.2) internal successors, (356), 5 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 4635 states and 6930 transitions. [2025-03-16 21:32:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 21:32:45,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:45,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:45,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 21:32:45,902 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:45,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1161539429, now seen corresponding path program 1 times [2025-03-16 21:32:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447966848] [2025-03-16 21:32:45,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 21:32:46,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 21:32:46,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:46,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:47,454 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-16 21:32:47,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:47,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447966848] [2025-03-16 21:32:47,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447966848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:47,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:47,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 21:32:47,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633563739] [2025-03-16 21:32:47,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:47,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:32:47,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:47,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:32:47,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:47,456 INFO L87 Difference]: Start difference. First operand 4635 states and 6930 transitions. Second operand has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:47,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:47,848 INFO L93 Difference]: Finished difference Result 7171 states and 10716 transitions. [2025-03-16 21:32:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:32:47,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-03-16 21:32:47,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:47,853 INFO L225 Difference]: With dead ends: 7171 [2025-03-16 21:32:47,853 INFO L226 Difference]: Without dead ends: 4629 [2025-03-16 21:32:47,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:47,855 INFO L435 NwaCegarLoop]: 1202 mSDtfsCounter, 1290 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1290 SdHoareTripleChecker+Valid, 2401 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:47,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1290 Valid, 2401 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 21:32:47,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2025-03-16 21:32:47,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4629. [2025-03-16 21:32:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4629 states, 4628 states have (on average 1.4956784788245463) internal successors, (6922), 4628 states have internal predecessors, (6922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:47,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4629 states to 4629 states and 6922 transitions. [2025-03-16 21:32:47,886 INFO L78 Accepts]: Start accepts. Automaton has 4629 states and 6922 transitions. Word has length 356 [2025-03-16 21:32:47,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:47,886 INFO L471 AbstractCegarLoop]: Abstraction has 4629 states and 6922 transitions. [2025-03-16 21:32:47,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.0) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:47,886 INFO L276 IsEmpty]: Start isEmpty. Operand 4629 states and 6922 transitions. [2025-03-16 21:32:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-03-16 21:32:47,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:47,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:47,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 21:32:47,889 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:47,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1850179441, now seen corresponding path program 1 times [2025-03-16 21:32:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:47,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954774751] [2025-03-16 21:32:47,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:47,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:47,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-03-16 21:32:48,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-03-16 21:32:48,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:48,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:49,456 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-16 21:32:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954774751] [2025-03-16 21:32:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954774751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:49,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:49,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:32:49,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046241696] [2025-03-16 21:32:49,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:49,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:32:49,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:49,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:32:49,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:49,457 INFO L87 Difference]: Start difference. First operand 4629 states and 6922 transitions. Second operand has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:50,430 INFO L93 Difference]: Finished difference Result 7168 states and 10712 transitions. [2025-03-16 21:32:50,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:32:50,431 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 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 356 [2025-03-16 21:32:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:50,434 INFO L225 Difference]: With dead ends: 7168 [2025-03-16 21:32:50,434 INFO L226 Difference]: Without dead ends: 4637 [2025-03-16 21:32:50,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:32:50,436 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 1317 mSDsluCounter, 4372 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 5470 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:50,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 5470 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:32:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4637 states. [2025-03-16 21:32:50,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4637 to 4633. [2025-03-16 21:32:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4633 states, 4632 states have (on average 1.4952504317789292) internal successors, (6926), 4632 states have internal predecessors, (6926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:50,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4633 states to 4633 states and 6926 transitions. [2025-03-16 21:32:50,466 INFO L78 Accepts]: Start accepts. Automaton has 4633 states and 6926 transitions. Word has length 356 [2025-03-16 21:32:50,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:50,466 INFO L471 AbstractCegarLoop]: Abstraction has 4633 states and 6926 transitions. [2025-03-16 21:32:50,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.857142857142854) internal successors, (356), 7 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 4633 states and 6926 transitions. [2025-03-16 21:32:50,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-16 21:32:50,469 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:50,469 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:50,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 21:32:50,469 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:50,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:50,470 INFO L85 PathProgramCache]: Analyzing trace with hash -603717926, now seen corresponding path program 1 times [2025-03-16 21:32:50,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:50,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950302047] [2025-03-16 21:32:50,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:50,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:50,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-16 21:32:51,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-16 21:32:51,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:51,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:52,083 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-16 21:32:52,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:52,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950302047] [2025-03-16 21:32:52,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950302047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:52,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:52,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:32:52,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783144722] [2025-03-16 21:32:52,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:52,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:32:52,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:52,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:32:52,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:52,084 INFO L87 Difference]: Start difference. First operand 4633 states and 6926 transitions. Second operand has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:53,060 INFO L93 Difference]: Finished difference Result 7152 states and 10690 transitions. [2025-03-16 21:32:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:32:53,061 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 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 357 [2025-03-16 21:32:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:53,064 INFO L225 Difference]: With dead ends: 7152 [2025-03-16 21:32:53,064 INFO L226 Difference]: Without dead ends: 4641 [2025-03-16 21:32:53,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:53,066 INFO L435 NwaCegarLoop]: 1098 mSDtfsCounter, 1308 mSDsluCounter, 4369 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1308 SdHoareTripleChecker+Valid, 5467 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:53,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1308 Valid, 5467 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 21:32:53,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4641 states. [2025-03-16 21:32:53,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4641 to 4637. [2025-03-16 21:32:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 4636 states have (on average 1.494823123382226) internal successors, (6930), 4636 states have internal predecessors, (6930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:53,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 6930 transitions. [2025-03-16 21:32:53,097 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 6930 transitions. Word has length 357 [2025-03-16 21:32:53,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:53,098 INFO L471 AbstractCegarLoop]: Abstraction has 4637 states and 6930 transitions. [2025-03-16 21:32:53,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.0) internal successors, (357), 7 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:53,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 6930 transitions. [2025-03-16 21:32:53,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-16 21:32:53,100 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:53,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:53,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 21:32:53,101 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:53,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:53,101 INFO L85 PathProgramCache]: Analyzing trace with hash -2110415484, now seen corresponding path program 1 times [2025-03-16 21:32:53,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:53,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411164939] [2025-03-16 21:32:53,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:53,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:53,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 21:32:54,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 21:32:54,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:54,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:54,853 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-16 21:32:54,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:54,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411164939] [2025-03-16 21:32:54,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411164939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:54,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:54,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:54,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60024682] [2025-03-16 21:32:54,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:54,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:32:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:54,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:32:54,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:54,854 INFO L87 Difference]: Start difference. First operand 4637 states and 6930 transitions. Second operand has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:55,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:55,420 INFO L93 Difference]: Finished difference Result 7166 states and 10704 transitions. [2025-03-16 21:32:55,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:32:55,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 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 358 [2025-03-16 21:32:55,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:55,423 INFO L225 Difference]: With dead ends: 7166 [2025-03-16 21:32:55,423 INFO L226 Difference]: Without dead ends: 4645 [2025-03-16 21:32:55,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:55,426 INFO L435 NwaCegarLoop]: 1176 mSDtfsCounter, 1281 mSDsluCounter, 2349 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 3525 SdHoareTripleChecker+Invalid, 1328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:55,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 3525 Invalid, 1328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:32:55,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2025-03-16 21:32:55,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 4637. [2025-03-16 21:32:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4637 states, 4636 states have (on average 1.494823123382226) internal successors, (6930), 4636 states have internal predecessors, (6930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:55,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4637 states to 4637 states and 6930 transitions. [2025-03-16 21:32:55,454 INFO L78 Accepts]: Start accepts. Automaton has 4637 states and 6930 transitions. Word has length 358 [2025-03-16 21:32:55,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:55,454 INFO L471 AbstractCegarLoop]: Abstraction has 4637 states and 6930 transitions. [2025-03-16 21:32:55,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 71.6) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 4637 states and 6930 transitions. [2025-03-16 21:32:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2025-03-16 21:32:55,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:55,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:55,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 21:32:55,457 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:55,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:55,458 INFO L85 PathProgramCache]: Analyzing trace with hash -300219654, now seen corresponding path program 1 times [2025-03-16 21:32:55,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:55,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184247105] [2025-03-16 21:32:55,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:55,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:55,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 358 statements into 1 equivalence classes. [2025-03-16 21:32:56,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 358 of 358 statements. [2025-03-16 21:32:56,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:56,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:56,959 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-16 21:32:56,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:56,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184247105] [2025-03-16 21:32:56,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184247105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:56,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:56,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:32:56,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694870153] [2025-03-16 21:32:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:56,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:32:56,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:56,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:32:56,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:32:56,960 INFO L87 Difference]: Start difference. First operand 4637 states and 6930 transitions. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:57,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:57,272 INFO L93 Difference]: Finished difference Result 7196 states and 10743 transitions. [2025-03-16 21:32:57,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:32:57,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 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 358 [2025-03-16 21:32:57,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:57,281 INFO L225 Difference]: With dead ends: 7196 [2025-03-16 21:32:57,281 INFO L226 Difference]: Without dead ends: 4585 [2025-03-16 21:32:57,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:32:57,288 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 904 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 904 SdHoareTripleChecker+Valid, 3061 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:57,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [904 Valid, 3061 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:32:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4585 states. [2025-03-16 21:32:57,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4585 to 2651. [2025-03-16 21:32:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 2650 states have (on average 1.489811320754717) internal successors, (3948), 2650 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:57,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3948 transitions. [2025-03-16 21:32:57,316 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3948 transitions. Word has length 358 [2025-03-16 21:32:57,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:57,316 INFO L471 AbstractCegarLoop]: Abstraction has 2651 states and 3948 transitions. [2025-03-16 21:32:57,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:57,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3948 transitions. [2025-03-16 21:32:57,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-03-16 21:32:57,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:57,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:57,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 21:32:57,318 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:57,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:57,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1267470962, now seen corresponding path program 1 times [2025-03-16 21:32:57,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:57,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516918315] [2025-03-16 21:32:57,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:57,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:57,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-03-16 21:32:58,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-03-16 21:32:58,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:32:58,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:32:58,814 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-16 21:32:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:32:58,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516918315] [2025-03-16 21:32:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516918315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:32:58,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:32:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-16 21:32:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295348473] [2025-03-16 21:32:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:32:58,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:32:58,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:32:58,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:32:58,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:32:58,816 INFO L87 Difference]: Start difference. First operand 2651 states and 3948 transitions. Second operand has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:32:59,661 INFO L93 Difference]: Finished difference Result 4276 states and 6357 transitions. [2025-03-16 21:32:59,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:32:59,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 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 359 [2025-03-16 21:32:59,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:32:59,663 INFO L225 Difference]: With dead ends: 4276 [2025-03-16 21:32:59,663 INFO L226 Difference]: Without dead ends: 2659 [2025-03-16 21:32:59,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-16 21:32:59,665 INFO L435 NwaCegarLoop]: 1093 mSDtfsCounter, 2253 mSDsluCounter, 3581 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 4674 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:32:59,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2253 Valid, 4674 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:32:59,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2659 states. [2025-03-16 21:32:59,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2659 to 2655. [2025-03-16 21:32:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 1.4890730972117558) internal successors, (3952), 2654 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3952 transitions. [2025-03-16 21:32:59,679 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3952 transitions. Word has length 359 [2025-03-16 21:32:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:32:59,679 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 3952 transitions. [2025-03-16 21:32:59,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 7 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:32:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3952 transitions. [2025-03-16 21:32:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-16 21:32:59,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:32:59,681 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:32:59,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 21:32:59,681 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:32:59,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:32:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1333078019, now seen corresponding path program 1 times [2025-03-16 21:32:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:32:59,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372057072] [2025-03-16 21:32:59,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:32:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:32:59,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-03-16 21:33:00,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-03-16 21:33:00,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:33:00,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:33:01,150 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-16 21:33:01,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:33:01,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372057072] [2025-03-16 21:33:01,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372057072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:33:01,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:33:01,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 21:33:01,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485141486] [2025-03-16 21:33:01,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:33:01,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:33:01,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:33:01,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:33:01,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:33:01,151 INFO L87 Difference]: Start difference. First operand 2655 states and 3952 transitions. Second operand has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:01,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:33:01,645 INFO L93 Difference]: Finished difference Result 4574 states and 6792 transitions. [2025-03-16 21:33:01,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:33:01,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 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 360 [2025-03-16 21:33:01,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:33:01,647 INFO L225 Difference]: With dead ends: 4574 [2025-03-16 21:33:01,647 INFO L226 Difference]: Without dead ends: 2655 [2025-03-16 21:33:01,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:33:01,649 INFO L435 NwaCegarLoop]: 1337 mSDtfsCounter, 552 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 552 SdHoareTripleChecker+Valid, 4755 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:33:01,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [552 Valid, 4755 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:33:01,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2025-03-16 21:33:01,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2655. [2025-03-16 21:33:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2655 states, 2654 states have (on average 1.4883195177091184) internal successors, (3950), 2654 states have internal predecessors, (3950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:01,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 3950 transitions. [2025-03-16 21:33:01,664 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 3950 transitions. Word has length 360 [2025-03-16 21:33:01,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:33:01,665 INFO L471 AbstractCegarLoop]: Abstraction has 2655 states and 3950 transitions. [2025-03-16 21:33:01,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.0) internal successors, (360), 5 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:01,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 3950 transitions. [2025-03-16 21:33:01,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-03-16 21:33:01,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:33:01,667 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:33:01,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 21:33:01,667 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:33:01,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:33:01,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1844015879, now seen corresponding path program 1 times [2025-03-16 21:33:01,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:33:01,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550638575] [2025-03-16 21:33:01,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:33:01,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:33:01,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-03-16 21:33:02,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-03-16 21:33:02,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:33:02,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:33:04,086 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-16 21:33:04,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:33:04,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550638575] [2025-03-16 21:33:04,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550638575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:33:04,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:33:04,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-16 21:33:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16187566] [2025-03-16 21:33:04,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:33:04,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 21:33:04,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:33:04,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 21:33:04,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:33:04,087 INFO L87 Difference]: Start difference. First operand 2655 states and 3950 transitions. Second operand has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:33:04,946 INFO L93 Difference]: Finished difference Result 4190 states and 6230 transitions. [2025-03-16 21:33:04,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 21:33:04,946 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 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 361 [2025-03-16 21:33:04,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:33:04,948 INFO L225 Difference]: With dead ends: 4190 [2025-03-16 21:33:04,948 INFO L226 Difference]: Without dead ends: 2673 [2025-03-16 21:33:04,950 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-03-16 21:33:04,950 INFO L435 NwaCegarLoop]: 1318 mSDtfsCounter, 4137 mSDsluCounter, 7905 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4137 SdHoareTripleChecker+Valid, 9223 SdHoareTripleChecker+Invalid, 2068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 21:33:04,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4137 Valid, 9223 Invalid, 2068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 21:33:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-16 21:33:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2659. [2025-03-16 21:33:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2659 states, 2658 states have (on average 1.4879608728367193) internal successors, (3955), 2658 states have internal predecessors, (3955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2659 states to 2659 states and 3955 transitions. [2025-03-16 21:33:04,967 INFO L78 Accepts]: Start accepts. Automaton has 2659 states and 3955 transitions. Word has length 361 [2025-03-16 21:33:04,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:33:04,967 INFO L471 AbstractCegarLoop]: Abstraction has 2659 states and 3955 transitions. [2025-03-16 21:33:04,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.111111111111114) internal successors, (361), 8 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:04,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2659 states and 3955 transitions. [2025-03-16 21:33:04,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-16 21:33:04,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:33:04,969 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:33:04,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-16 21:33:04,969 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:33:04,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:33:04,970 INFO L85 PathProgramCache]: Analyzing trace with hash 201215104, now seen corresponding path program 1 times [2025-03-16 21:33:04,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:33:04,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506471055] [2025-03-16 21:33:04,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:33:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:33:05,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-16 21:33:06,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-16 21:33:06,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:33:06,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:33:06,311 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-16 21:33:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:33:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506471055] [2025-03-16 21:33:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506471055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:33:06,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:33:06,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:33:06,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503576757] [2025-03-16 21:33:06,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:33:06,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 21:33:06,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:33:06,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 21:33:06,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:33:06,312 INFO L87 Difference]: Start difference. First operand 2659 states and 3955 transitions. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:33:06,924 INFO L93 Difference]: Finished difference Result 4284 states and 6362 transitions. [2025-03-16 21:33:06,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 21:33:06,924 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2025-03-16 21:33:06,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:33:06,926 INFO L225 Difference]: With dead ends: 4284 [2025-03-16 21:33:06,926 INFO L226 Difference]: Without dead ends: 2661 [2025-03-16 21:33:06,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 21:33:06,928 INFO L435 NwaCegarLoop]: 1100 mSDtfsCounter, 1321 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1541 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 3296 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 21:33:06,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1321 Valid, 3296 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1541 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 21:33:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-03-16 21:33:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2661. [2025-03-16 21:33:06,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2660 states have (on average 1.487593984962406) internal successors, (3957), 2660 states have internal predecessors, (3957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3957 transitions. [2025-03-16 21:33:06,948 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 3957 transitions. Word has length 362 [2025-03-16 21:33:06,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:33:06,948 INFO L471 AbstractCegarLoop]: Abstraction has 2661 states and 3957 transitions. [2025-03-16 21:33:06,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:06,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3957 transitions. [2025-03-16 21:33:06,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-16 21:33:06,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:33:06,951 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:33:06,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 21:33:06,951 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:33:06,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:33:06,951 INFO L85 PathProgramCache]: Analyzing trace with hash 624542647, now seen corresponding path program 1 times [2025-03-16 21:33:06,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:33:06,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726308749] [2025-03-16 21:33:06,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:33:06,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:33:07,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-16 21:33:08,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-16 21:33:08,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:33:08,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:33:09,480 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-16 21:33:09,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:33:09,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726308749] [2025-03-16 21:33:09,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726308749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:33:09,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:33:09,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:33:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923334926] [2025-03-16 21:33:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:33:09,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 21:33:09,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:33:09,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 21:33:09,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:33:09,481 INFO L87 Difference]: Start difference. First operand 2661 states and 3957 transitions. Second operand has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 6 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:09,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:33:09,997 INFO L93 Difference]: Finished difference Result 6706 states and 9958 transitions. [2025-03-16 21:33:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 21:33:09,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 6 states have internal predecessors, (362), 0 states have call successors, (0), 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 362 [2025-03-16 21:33:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:33:10,002 INFO L225 Difference]: With dead ends: 6706 [2025-03-16 21:33:10,002 INFO L226 Difference]: Without dead ends: 5077 [2025-03-16 21:33:10,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-16 21:33:10,005 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 3905 mSDsluCounter, 5328 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3905 SdHoareTripleChecker+Valid, 6663 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:33:10,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3905 Valid, 6663 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:33:10,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5077 states. [2025-03-16 21:33:10,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5077 to 4597. [2025-03-16 21:33:10,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4597 states, 4596 states have (on average 1.492384682332463) internal successors, (6859), 4596 states have internal predecessors, (6859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:10,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4597 states to 4597 states and 6859 transitions. [2025-03-16 21:33:10,043 INFO L78 Accepts]: Start accepts. Automaton has 4597 states and 6859 transitions. Word has length 362 [2025-03-16 21:33:10,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:33:10,043 INFO L471 AbstractCegarLoop]: Abstraction has 4597 states and 6859 transitions. [2025-03-16 21:33:10,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.714285714285715) internal successors, (362), 6 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:10,043 INFO L276 IsEmpty]: Start isEmpty. Operand 4597 states and 6859 transitions. [2025-03-16 21:33:10,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2025-03-16 21:33:10,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:33:10,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:33:10,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-16 21:33:10,046 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:33:10,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:33:10,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1723770380, now seen corresponding path program 1 times [2025-03-16 21:33:10,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:33:10,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001008844] [2025-03-16 21:33:10,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:33:10,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:33:10,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 363 statements into 1 equivalence classes. [2025-03-16 21:33:11,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 363 of 363 statements. [2025-03-16 21:33:11,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:33:11,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:33:12,120 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-16 21:33:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:33:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001008844] [2025-03-16 21:33:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001008844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:33:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:33:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:33:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131523420] [2025-03-16 21:33:12,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:33:12,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:33:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:33:12,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:33:12,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:33:12,121 INFO L87 Difference]: Start difference. First operand 4597 states and 6859 transitions. Second operand has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:12,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:33:12,926 INFO L93 Difference]: Finished difference Result 14101 states and 21026 transitions. [2025-03-16 21:33:12,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:33:12,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 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 363 [2025-03-16 21:33:12,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:33:12,936 INFO L225 Difference]: With dead ends: 14101 [2025-03-16 21:33:12,936 INFO L226 Difference]: Without dead ends: 11517 [2025-03-16 21:33:12,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:33:12,941 INFO L435 NwaCegarLoop]: 2093 mSDtfsCounter, 2096 mSDsluCounter, 5851 mSDsCounter, 0 mSdLazyCounter, 2064 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2096 SdHoareTripleChecker+Valid, 7944 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-16 21:33:12,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2096 Valid, 7944 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2064 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-16 21:33:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11517 states. [2025-03-16 21:33:12,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11517 to 8249. [2025-03-16 21:33:13,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8249 states, 8248 states have (on average 1.4933317167798255) internal successors, (12317), 8248 states have internal predecessors, (12317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8249 states to 8249 states and 12317 transitions. [2025-03-16 21:33:13,008 INFO L78 Accepts]: Start accepts. Automaton has 8249 states and 12317 transitions. Word has length 363 [2025-03-16 21:33:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:33:13,009 INFO L471 AbstractCegarLoop]: Abstraction has 8249 states and 12317 transitions. [2025-03-16 21:33:13,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.5) internal successors, (363), 6 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8249 states and 12317 transitions. [2025-03-16 21:33:13,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-16 21:33:13,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:33:13,015 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:33:13,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 21:33:13,015 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:33:13,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:33:13,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2008654325, now seen corresponding path program 1 times [2025-03-16 21:33:13,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:33:13,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591429171] [2025-03-16 21:33:13,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:33:13,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:33:13,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 21:33:13,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 21:33:13,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:33:13,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:33:13,644 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-16 21:33:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:33:13,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591429171] [2025-03-16 21:33:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591429171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:33:13,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:33:13,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 21:33:13,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084041605] [2025-03-16 21:33:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:33:13,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 21:33:13,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:33:13,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 21:33:13,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 21:33:13,646 INFO L87 Difference]: Start difference. First operand 8249 states and 12317 transitions. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:33:13,967 INFO L93 Difference]: Finished difference Result 16341 states and 24395 transitions. [2025-03-16 21:33:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 21:33:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2025-03-16 21:33:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:33:13,973 INFO L225 Difference]: With dead ends: 16341 [2025-03-16 21:33:13,973 INFO L226 Difference]: Without dead ends: 8265 [2025-03-16 21:33:13,979 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-16 21:33:13,979 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 0 mSDsluCounter, 2661 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4004 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 21:33:13,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4004 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 21:33:13,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8265 states. [2025-03-16 21:33:14,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8265 to 8265. [2025-03-16 21:33:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8265 states, 8264 states have (on average 1.492376573088093) internal successors, (12333), 8264 states have internal predecessors, (12333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8265 states to 8265 states and 12333 transitions. [2025-03-16 21:33:14,039 INFO L78 Accepts]: Start accepts. Automaton has 8265 states and 12333 transitions. Word has length 364 [2025-03-16 21:33:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:33:14,039 INFO L471 AbstractCegarLoop]: Abstraction has 8265 states and 12333 transitions. [2025-03-16 21:33:14,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 8265 states and 12333 transitions. [2025-03-16 21:33:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2025-03-16 21:33:14,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:33:14,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:33:14,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-16 21:33:14,044 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:33:14,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:33:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash -377403631, now seen corresponding path program 1 times [2025-03-16 21:33:14,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:33:14,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67698865] [2025-03-16 21:33:14,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:33:14,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:33:14,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 364 statements into 1 equivalence classes. [2025-03-16 21:33:15,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 364 of 364 statements. [2025-03-16 21:33:15,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 21:33:15,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 21:33:16,917 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-16 21:33:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 21:33:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67698865] [2025-03-16 21:33:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67698865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 21:33:16,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 21:33:16,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 21:33:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361872774] [2025-03-16 21:33:16,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 21:33:16,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 21:33:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 21:33:16,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 21:33:16,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 21:33:16,918 INFO L87 Difference]: Start difference. First operand 8265 states and 12333 transitions. Second operand has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:17,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 21:33:17,478 INFO L93 Difference]: Finished difference Result 19193 states and 28601 transitions. [2025-03-16 21:33:17,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 21:33:17,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 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 364 [2025-03-16 21:33:17,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 21:33:17,490 INFO L225 Difference]: With dead ends: 19193 [2025-03-16 21:33:17,490 INFO L226 Difference]: Without dead ends: 14525 [2025-03-16 21:33:17,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 21:33:17,498 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 818 mSDsluCounter, 5330 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 818 SdHoareTripleChecker+Valid, 6665 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 21:33:17,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [818 Valid, 6665 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 21:33:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14525 states. [2025-03-16 21:33:17,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14525 to 13649. [2025-03-16 21:33:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13649 states, 13648 states have (on average 1.4933323563892145) internal successors, (20381), 13648 states have internal predecessors, (20381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13649 states to 13649 states and 20381 transitions. [2025-03-16 21:33:17,655 INFO L78 Accepts]: Start accepts. Automaton has 13649 states and 20381 transitions. Word has length 364 [2025-03-16 21:33:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 21:33:17,656 INFO L471 AbstractCegarLoop]: Abstraction has 13649 states and 20381 transitions. [2025-03-16 21:33:17,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 60.666666666666664) internal successors, (364), 6 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 21:33:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 13649 states and 20381 transitions. [2025-03-16 21:33:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-16 21:33:17,663 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 21:33:17,663 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:33:17,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 21:33:17,663 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 21:33:17,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 21:33:17,664 INFO L85 PathProgramCache]: Analyzing trace with hash -625156167, now seen corresponding path program 1 times [2025-03-16 21:33:17,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 21:33:17,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843665241] [2025-03-16 21:33:17,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 21:33:17,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 21:33:17,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes.