./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.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 76759b02095285d07c750df63dcdc9c02e70d9a0344831d30f8bf2a90bed45af --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 17:35:18,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:35:18,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:35:18,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:35:18,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:35:18,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:35:18,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:35:18,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:35:18,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:35:18,669 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:35:18,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:35:18,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:35:18,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:35:18,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:35:18,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:35:18,671 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:35:18,671 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:35:18,671 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:35:18,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:35:18,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:18,673 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:35:18,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:35:18,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:35:18,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:35:18,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:35:18,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:35:18,674 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:35:18,674 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:35:18,674 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:35:18,674 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:35:18,674 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 -> 76759b02095285d07c750df63dcdc9c02e70d9a0344831d30f8bf2a90bed45af [2025-03-03 17:35:18,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:35:18,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:35:18,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:35:18,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:35:18,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:35:18,896 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.c [2025-03-03 17:35:20,038 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d073060/e95d2f477ad14feb96ee29695fc5b26f/FLAGfdae5148f [2025-03-03 17:35:20,363 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:35:20,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_FourbyFour.c [2025-03-03 17:35:20,384 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d073060/e95d2f477ad14feb96ee29695fc5b26f/FLAGfdae5148f [2025-03-03 17:35:20,605 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61d073060/e95d2f477ad14feb96ee29695fc5b26f [2025-03-03 17:35:20,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:35:20,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:35:20,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:20,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:35:20,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:35:20,612 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e131198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:20, skipping insertion in model container [2025-03-03 17:35:20,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:35:20" (1/1) ... [2025-03-03 17:35:20,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:35:20,793 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.h_FourbyFour.c[1252,1265] [2025-03-03 17:35:21,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:21,039 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:35:21,046 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.h_FourbyFour.c[1252,1265] [2025-03-03 17:35:21,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:35:21,214 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:35:21,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21 WrapperNode [2025-03-03 17:35:21,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:35:21,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:21,216 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:35:21,216 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:35:21,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,639 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4219 [2025-03-03 17:35:21,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:35:21,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:35:21,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:35:21,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:35:21,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,871 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 17:35:21,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,872 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,962 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:21,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:22,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:22,060 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:35:22,062 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:35:22,062 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:35:22,062 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:35:22,063 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (1/1) ... [2025-03-03 17:35:22,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:35:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:35:22,088 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 17:35:22,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 17:35:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:35:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:35:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:35:22,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:35:22,450 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:35:22,452 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:35:25,344 INFO L? ?]: Removed 2712 outVars from TransFormulas that were not future-live. [2025-03-03 17:35:25,345 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:35:25,500 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:35:25,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:35:25,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:25 BoogieIcfgContainer [2025-03-03 17:35:25,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:35:25,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:35:25,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:35:25,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:35:25,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:35:20" (1/3) ... [2025-03-03 17:35:25,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c65440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:25, skipping insertion in model container [2025-03-03 17:35:25,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:35:21" (2/3) ... [2025-03-03 17:35:25,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34c65440 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:35:25, skipping insertion in model container [2025-03-03 17:35:25,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:35:25" (3/3) ... [2025-03-03 17:35:25,508 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_FourbyFour.c [2025-03-03 17:35:25,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:35:25,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_FourbyFour.c that has 1 procedures, 1129 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:35:25,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:35:25,600 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;@458959ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:35:25,600 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:35:25,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 1129 states, 1127 states have (on average 1.502218278615794) internal successors, (1693), 1128 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:25,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-03 17:35:25,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:25,627 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] [2025-03-03 17:35:25,628 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:25,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:25,632 INFO L85 PathProgramCache]: Analyzing trace with hash -934359406, now seen corresponding path program 1 times [2025-03-03 17:35:25,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:25,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419414198] [2025-03-03 17:35:25,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:25,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-03 17:35:26,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-03 17:35:26,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:26,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:27,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:27,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419414198] [2025-03-03 17:35:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419414198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:27,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:27,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:27,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294593127] [2025-03-03 17:35:27,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:27,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:27,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:27,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:27,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:27,161 INFO L87 Difference]: Start difference. First operand has 1129 states, 1127 states have (on average 1.502218278615794) internal successors, (1693), 1128 states have internal predecessors, (1693), 0 states have call successors, (0), 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 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:27,895 INFO L93 Difference]: Finished difference Result 2215 states and 3325 transitions. [2025-03-03 17:35:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2025-03-03 17:35:27,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:27,925 INFO L225 Difference]: With dead ends: 2215 [2025-03-03 17:35:27,925 INFO L226 Difference]: Without dead ends: 1128 [2025-03-03 17:35:27,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:27,932 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 0 mSDsluCounter, 2813 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:27,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4222 Invalid, 844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2025-03-03 17:35:28,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2025-03-03 17:35:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1128 states, 1127 states have (on average 1.5004436557231589) internal successors, (1691), 1127 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1691 transitions. [2025-03-03 17:35:28,025 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1691 transitions. Word has length 219 [2025-03-03 17:35:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:28,027 INFO L471 AbstractCegarLoop]: Abstraction has 1128 states and 1691 transitions. [2025-03-03 17:35:28,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1691 transitions. [2025-03-03 17:35:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 17:35:28,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:28,031 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] [2025-03-03 17:35:28,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:35:28,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:28,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:28,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1104309828, now seen corresponding path program 1 times [2025-03-03 17:35:28,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:28,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93311478] [2025-03-03 17:35:28,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:28,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:28,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 17:35:28,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 17:35:28,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:28,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:28,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:28,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:28,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93311478] [2025-03-03 17:35:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93311478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369866458] [2025-03-03 17:35:28,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:28,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:28,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:28,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:28,651 INFO L87 Difference]: Start difference. First operand 1128 states and 1691 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:29,129 INFO L93 Difference]: Finished difference Result 2216 states and 3323 transitions. [2025-03-03 17:35:29,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:29,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2025-03-03 17:35:29,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:29,136 INFO L225 Difference]: With dead ends: 2216 [2025-03-03 17:35:29,137 INFO L226 Difference]: Without dead ends: 1130 [2025-03-03 17:35:29,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:29,141 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 0 mSDsluCounter, 2810 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4219 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:29,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4219 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:29,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-03 17:35:29,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2025-03-03 17:35:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.49955713020372) internal successors, (1693), 1129 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:29,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1693 transitions. [2025-03-03 17:35:29,163 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1693 transitions. Word has length 220 [2025-03-03 17:35:29,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:29,164 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1693 transitions. [2025-03-03 17:35:29,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:29,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1693 transitions. [2025-03-03 17:35:29,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 17:35:29,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:29,166 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] [2025-03-03 17:35:29,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:35:29,166 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:29,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1805376717, now seen corresponding path program 1 times [2025-03-03 17:35:29,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:29,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922137012] [2025-03-03 17:35:29,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:29,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:29,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 17:35:29,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 17:35:29,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:29,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:30,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:30,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:30,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922137012] [2025-03-03 17:35:30,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922137012] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:30,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:30,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:30,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321761513] [2025-03-03 17:35:30,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:30,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:30,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:30,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:30,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:30,515 INFO L87 Difference]: Start difference. First operand 1130 states and 1693 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:31,033 INFO L93 Difference]: Finished difference Result 2218 states and 3324 transitions. [2025-03-03 17:35:31,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:31,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2025-03-03 17:35:31,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:31,038 INFO L225 Difference]: With dead ends: 2218 [2025-03-03 17:35:31,038 INFO L226 Difference]: Without dead ends: 1130 [2025-03-03 17:35:31,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:31,040 INFO L435 NwaCegarLoop]: 1406 mSDtfsCounter, 272 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 3880 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:31,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 3880 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2025-03-03 17:35:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2025-03-03 17:35:31,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1129 states have (on average 1.4986713906111604) internal successors, (1692), 1129 states have internal predecessors, (1692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1692 transitions. [2025-03-03 17:35:31,059 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1692 transitions. Word has length 221 [2025-03-03 17:35:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:31,059 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1692 transitions. [2025-03-03 17:35:31,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:31,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1692 transitions. [2025-03-03 17:35:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 17:35:31,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:31,061 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] [2025-03-03 17:35:31,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:35:31,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:31,062 INFO L85 PathProgramCache]: Analyzing trace with hash 2020467081, now seen corresponding path program 1 times [2025-03-03 17:35:31,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010023216] [2025-03-03 17:35:31,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:31,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 17:35:31,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 17:35:31,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:31,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:32,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:32,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010023216] [2025-03-03 17:35:32,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010023216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:32,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:32,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459230969] [2025-03-03 17:35:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:32,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:32,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:32,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:32,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:32,654 INFO L87 Difference]: Start difference. First operand 1130 states and 1692 transitions. Second operand has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:33,581 INFO L93 Difference]: Finished difference Result 2487 states and 3728 transitions. [2025-03-03 17:35:33,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:33,582 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 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 222 [2025-03-03 17:35:33,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:33,587 INFO L225 Difference]: With dead ends: 2487 [2025-03-03 17:35:33,587 INFO L226 Difference]: Without dead ends: 1399 [2025-03-03 17:35:33,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:33,590 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 2282 mSDsluCounter, 6983 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2282 SdHoareTripleChecker+Valid, 8382 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:33,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2282 Valid, 8382 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 17:35:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2025-03-03 17:35:33,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1398. [2025-03-03 17:35:33,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 1397 states have (on average 1.5003579098067288) internal successors, (2096), 1397 states have internal predecessors, (2096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 2096 transitions. [2025-03-03 17:35:33,619 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 2096 transitions. Word has length 222 [2025-03-03 17:35:33,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:33,620 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 2096 transitions. [2025-03-03 17:35:33,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.75) internal successors, (222), 8 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:33,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 2096 transitions. [2025-03-03 17:35:33,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 17:35:33,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:33,625 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] [2025-03-03 17:35:33,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:35:33,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:33,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1914638981, now seen corresponding path program 1 times [2025-03-03 17:35:33,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:33,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818797187] [2025-03-03 17:35:33,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:33,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 17:35:33,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 17:35:33,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:33,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:35,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:35,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:35,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818797187] [2025-03-03 17:35:35,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818797187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:35,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:35,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-03 17:35:35,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256540565] [2025-03-03 17:35:35,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:35,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 17:35:35,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:35,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 17:35:35,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-03 17:35:35,706 INFO L87 Difference]: Start difference. First operand 1398 states and 2096 transitions. Second operand has 9 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:36,990 INFO L93 Difference]: Finished difference Result 2759 states and 4137 transitions. [2025-03-03 17:35:36,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 17:35:36,991 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2025-03-03 17:35:36,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:36,996 INFO L225 Difference]: With dead ends: 2759 [2025-03-03 17:35:36,996 INFO L226 Difference]: Without dead ends: 1403 [2025-03-03 17:35:36,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-03-03 17:35:37,000 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 2285 mSDsluCounter, 8362 mSDsCounter, 0 mSdLazyCounter, 2057 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2285 SdHoareTripleChecker+Valid, 9758 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:37,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2285 Valid, 9758 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2057 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 17:35:37,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2025-03-03 17:35:37,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1402. [2025-03-03 17:35:37,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1402 states, 1401 states have (on average 1.4996431120628122) internal successors, (2101), 1401 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2101 transitions. [2025-03-03 17:35:37,032 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2101 transitions. Word has length 223 [2025-03-03 17:35:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:37,032 INFO L471 AbstractCegarLoop]: Abstraction has 1402 states and 2101 transitions. [2025-03-03 17:35:37,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 24.77777777777778) internal successors, (223), 9 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2101 transitions. [2025-03-03 17:35:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-03 17:35:37,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:37,036 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] [2025-03-03 17:35:37,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:35:37,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:37,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1750479098, now seen corresponding path program 1 times [2025-03-03 17:35:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:37,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977960321] [2025-03-03 17:35:37,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:37,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:37,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-03 17:35:37,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-03 17:35:37,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:37,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:37,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:37,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:37,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977960321] [2025-03-03 17:35:37,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977960321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:37,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:37,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:37,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464000847] [2025-03-03 17:35:37,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:37,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:37,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:37,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:37,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:37,558 INFO L87 Difference]: Start difference. First operand 1402 states and 2101 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:38,031 INFO L93 Difference]: Finished difference Result 2764 states and 4143 transitions. [2025-03-03 17:35:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:38,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 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 223 [2025-03-03 17:35:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:38,036 INFO L225 Difference]: With dead ends: 2764 [2025-03-03 17:35:38,036 INFO L226 Difference]: Without dead ends: 1404 [2025-03-03 17:35:38,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:38,039 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:38,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:38,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2025-03-03 17:35:38,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1404. [2025-03-03 17:35:38,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1403 states have (on average 1.4989308624376336) internal successors, (2103), 1403 states have internal predecessors, (2103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:38,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 2103 transitions. [2025-03-03 17:35:38,068 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 2103 transitions. Word has length 223 [2025-03-03 17:35:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:38,069 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 2103 transitions. [2025-03-03 17:35:38,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:38,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 2103 transitions. [2025-03-03 17:35:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-03 17:35:38,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:38,071 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] [2025-03-03 17:35:38,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:35:38,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:38,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:38,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1523456908, now seen corresponding path program 1 times [2025-03-03 17:35:38,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:38,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991189210] [2025-03-03 17:35:38,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:38,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:38,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-03 17:35:38,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-03 17:35:38,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:38,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:39,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:39,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991189210] [2025-03-03 17:35:39,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991189210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:39,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:39,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:35:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374757538] [2025-03-03 17:35:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:39,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:35:39,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:39,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:35:39,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:35:39,625 INFO L87 Difference]: Start difference. First operand 1404 states and 2103 transitions. Second operand has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:40,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:40,449 INFO L93 Difference]: Finished difference Result 2800 states and 4194 transitions. [2025-03-03 17:35:40,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:35:40,449 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 224 [2025-03-03 17:35:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:40,454 INFO L225 Difference]: With dead ends: 2800 [2025-03-03 17:35:40,455 INFO L226 Difference]: Without dead ends: 1438 [2025-03-03 17:35:40,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:35:40,457 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 1624 mSDsluCounter, 5512 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1624 SdHoareTripleChecker+Valid, 6893 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:40,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1624 Valid, 6893 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:35:40,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2025-03-03 17:35:40,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1428. [2025-03-03 17:35:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.4975473020322354) internal successors, (2137), 1427 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2137 transitions. [2025-03-03 17:35:40,485 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2137 transitions. Word has length 224 [2025-03-03 17:35:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:40,485 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 2137 transitions. [2025-03-03 17:35:40,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.0) internal successors, (224), 7 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2137 transitions. [2025-03-03 17:35:40,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 17:35:40,487 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:40,488 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] [2025-03-03 17:35:40,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:35:40,488 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:40,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:40,488 INFO L85 PathProgramCache]: Analyzing trace with hash -154680450, now seen corresponding path program 1 times [2025-03-03 17:35:40,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:40,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986545841] [2025-03-03 17:35:40,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:40,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 17:35:40,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 17:35:40,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:40,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:40,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:40,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986545841] [2025-03-03 17:35:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986545841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:40,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869873031] [2025-03-03 17:35:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:40,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:40,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:40,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:40,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:40,864 INFO L87 Difference]: Start difference. First operand 1428 states and 2137 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:41,467 INFO L93 Difference]: Finished difference Result 2822 states and 4224 transitions. [2025-03-03 17:35:41,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-03 17:35:41,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:41,473 INFO L225 Difference]: With dead ends: 2822 [2025-03-03 17:35:41,473 INFO L226 Difference]: Without dead ends: 1436 [2025-03-03 17:35:41,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:41,476 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:41,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-03-03 17:35:41,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1436. [2025-03-03 17:35:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 1.494773519163763) internal successors, (2145), 1435 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:41,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 2145 transitions. [2025-03-03 17:35:41,505 INFO L78 Accepts]: Start accepts. Automaton has 1436 states and 2145 transitions. Word has length 225 [2025-03-03 17:35:41,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:41,506 INFO L471 AbstractCegarLoop]: Abstraction has 1436 states and 2145 transitions. [2025-03-03 17:35:41,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:41,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1436 states and 2145 transitions. [2025-03-03 17:35:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 17:35:41,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:41,508 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] [2025-03-03 17:35:41,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 17:35:41,509 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:41,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:41,509 INFO L85 PathProgramCache]: Analyzing trace with hash 861848259, now seen corresponding path program 1 times [2025-03-03 17:35:41,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:41,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348328822] [2025-03-03 17:35:41,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:41,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:41,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 17:35:41,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 17:35:41,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:41,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:42,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:42,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348328822] [2025-03-03 17:35:42,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348328822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:42,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:42,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820747116] [2025-03-03 17:35:42,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:42,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:42,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:42,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:42,045 INFO L87 Difference]: Start difference. First operand 1436 states and 2145 transitions. Second operand has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:42,984 INFO L93 Difference]: Finished difference Result 2900 states and 4334 transitions. [2025-03-03 17:35:42,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:35:42,985 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-03 17:35:42,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:42,990 INFO L225 Difference]: With dead ends: 2900 [2025-03-03 17:35:42,990 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 17:35:42,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:42,994 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 35 mSDsluCounter, 8369 mSDsCounter, 0 mSdLazyCounter, 2043 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 9767 SdHoareTripleChecker+Invalid, 2045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:42,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 9767 Invalid, 2045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2043 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 17:35:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 17:35:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1502. [2025-03-03 17:35:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 1501 states have (on average 1.4930046635576282) internal successors, (2241), 1501 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 2241 transitions. [2025-03-03 17:35:43,025 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 2241 transitions. Word has length 225 [2025-03-03 17:35:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:43,025 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 2241 transitions. [2025-03-03 17:35:43,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.125) internal successors, (225), 8 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 2241 transitions. [2025-03-03 17:35:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-03 17:35:43,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:43,028 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] [2025-03-03 17:35:43,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 17:35:43,028 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:43,032 INFO L85 PathProgramCache]: Analyzing trace with hash -369232593, now seen corresponding path program 1 times [2025-03-03 17:35:43,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:43,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284135563] [2025-03-03 17:35:43,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:43,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-03 17:35:43,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-03 17:35:43,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:43,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284135563] [2025-03-03 17:35:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284135563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:43,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:43,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373411030] [2025-03-03 17:35:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:43,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:43,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:43,493 INFO L87 Difference]: Start difference. First operand 1502 states and 2241 transitions. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:44,172 INFO L93 Difference]: Finished difference Result 2966 states and 4426 transitions. [2025-03-03 17:35:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2025-03-03 17:35:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:44,179 INFO L225 Difference]: With dead ends: 2966 [2025-03-03 17:35:44,179 INFO L226 Difference]: Without dead ends: 1506 [2025-03-03 17:35:44,181 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:44,182 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:44,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:35:44,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2025-03-03 17:35:44,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2025-03-03 17:35:44,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1505 states have (on average 1.4916943521594683) internal successors, (2245), 1505 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2245 transitions. [2025-03-03 17:35:44,216 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2245 transitions. Word has length 225 [2025-03-03 17:35:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:44,217 INFO L471 AbstractCegarLoop]: Abstraction has 1506 states and 2245 transitions. [2025-03-03 17:35:44,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:44,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2245 transitions. [2025-03-03 17:35:44,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 17:35:44,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:44,220 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] [2025-03-03 17:35:44,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 17:35:44,220 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:44,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:44,221 INFO L85 PathProgramCache]: Analyzing trace with hash -811830309, now seen corresponding path program 1 times [2025-03-03 17:35:44,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:44,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855644262] [2025-03-03 17:35:44,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:44,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:44,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 17:35:44,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 17:35:44,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:44,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:44,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:44,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:44,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855644262] [2025-03-03 17:35:44,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855644262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:44,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:44,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:44,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746531031] [2025-03-03 17:35:44,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:44,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:44,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:44,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:44,548 INFO L87 Difference]: Start difference. First operand 1506 states and 2245 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:45,249 INFO L93 Difference]: Finished difference Result 3036 states and 4528 transitions. [2025-03-03 17:35:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:35:45,250 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-03 17:35:45,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:45,254 INFO L225 Difference]: With dead ends: 3036 [2025-03-03 17:35:45,255 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 17:35:45,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:45,258 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:45,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:35:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 17:35:45,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1566. [2025-03-03 17:35:45,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1565 states have (on average 1.4907348242811502) internal successors, (2333), 1565 states have internal predecessors, (2333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:45,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2333 transitions. [2025-03-03 17:35:45,284 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2333 transitions. Word has length 226 [2025-03-03 17:35:45,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:45,284 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2333 transitions. [2025-03-03 17:35:45,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2333 transitions. [2025-03-03 17:35:45,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 17:35:45,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:45,287 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] [2025-03-03 17:35:45,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 17:35:45,287 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:45,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:45,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1632473028, now seen corresponding path program 1 times [2025-03-03 17:35:45,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:45,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818786517] [2025-03-03 17:35:45,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:45,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:45,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 17:35:45,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 17:35:45,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:45,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:45,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:45,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:45,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818786517] [2025-03-03 17:35:45,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818786517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:45,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:45,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:45,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780522891] [2025-03-03 17:35:45,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:45,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:45,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:45,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:45,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:45,844 INFO L87 Difference]: Start difference. First operand 1566 states and 2333 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:46,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:46,352 INFO L93 Difference]: Finished difference Result 3096 states and 4614 transitions. [2025-03-03 17:35:46,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:46,353 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-03 17:35:46,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:46,357 INFO L225 Difference]: With dead ends: 3096 [2025-03-03 17:35:46,358 INFO L226 Difference]: Without dead ends: 1572 [2025-03-03 17:35:46,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-03 17:35:46,361 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1583 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1583 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:46,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1583 Valid, 4158 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:46,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2025-03-03 17:35:46,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1572. [2025-03-03 17:35:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1572 states, 1571 states have (on average 1.49013367281986) internal successors, (2341), 1571 states have internal predecessors, (2341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 2341 transitions. [2025-03-03 17:35:46,397 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 2341 transitions. Word has length 226 [2025-03-03 17:35:46,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:46,398 INFO L471 AbstractCegarLoop]: Abstraction has 1572 states and 2341 transitions. [2025-03-03 17:35:46,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:46,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 2341 transitions. [2025-03-03 17:35:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 17:35:46,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:46,402 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] [2025-03-03 17:35:46,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 17:35:46,403 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:46,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash -229696719, now seen corresponding path program 1 times [2025-03-03 17:35:46,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:46,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395151833] [2025-03-03 17:35:46,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:46,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:46,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 17:35:46,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 17:35:46,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:46,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:46,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:46,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:46,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395151833] [2025-03-03 17:35:46,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395151833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:46,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:46,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:46,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237341424] [2025-03-03 17:35:46,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:46,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:46,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:46,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:46,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:46,922 INFO L87 Difference]: Start difference. First operand 1572 states and 2341 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:47,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:47,465 INFO L93 Difference]: Finished difference Result 3118 states and 4644 transitions. [2025-03-03 17:35:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:47,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-03 17:35:47,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:47,470 INFO L225 Difference]: With dead ends: 3118 [2025-03-03 17:35:47,470 INFO L226 Difference]: Without dead ends: 1588 [2025-03-03 17:35:47,472 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-03 17:35:47,472 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1590 mSDsluCounter, 2768 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1590 SdHoareTripleChecker+Valid, 4155 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:47,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1590 Valid, 4155 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2025-03-03 17:35:47,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1584. [2025-03-03 17:35:47,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1583 states have (on average 1.4889450410612761) internal successors, (2357), 1583 states have internal predecessors, (2357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:47,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2357 transitions. [2025-03-03 17:35:47,494 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2357 transitions. Word has length 226 [2025-03-03 17:35:47,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:47,494 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2357 transitions. [2025-03-03 17:35:47,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2357 transitions. [2025-03-03 17:35:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2025-03-03 17:35:47,497 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:47,497 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] [2025-03-03 17:35:47,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 17:35:47,497 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:47,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:47,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1255804527, now seen corresponding path program 1 times [2025-03-03 17:35:47,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:47,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708708247] [2025-03-03 17:35:47,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:47,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:47,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-03 17:35:47,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-03 17:35:47,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:47,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:47,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:47,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708708247] [2025-03-03 17:35:47,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708708247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:47,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:47,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:47,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307617554] [2025-03-03 17:35:47,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:47,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:47,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:47,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:47,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:47,950 INFO L87 Difference]: Start difference. First operand 1584 states and 2357 transitions. Second operand has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:48,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:48,404 INFO L93 Difference]: Finished difference Result 3134 states and 4664 transitions. [2025-03-03 17:35:48,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:48,404 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 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 226 [2025-03-03 17:35:48,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:48,408 INFO L225 Difference]: With dead ends: 3134 [2025-03-03 17:35:48,409 INFO L226 Difference]: Without dead ends: 1592 [2025-03-03 17:35:48,410 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-03 17:35:48,411 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1596 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1596 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:48,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1596 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:48,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2025-03-03 17:35:48,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1590. [2025-03-03 17:35:48,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1589 states have (on average 1.488357457520453) internal successors, (2365), 1589 states have internal predecessors, (2365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:48,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2365 transitions. [2025-03-03 17:35:48,432 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2365 transitions. Word has length 226 [2025-03-03 17:35:48,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:48,432 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2365 transitions. [2025-03-03 17:35:48,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.2) internal successors, (226), 5 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:48,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2365 transitions. [2025-03-03 17:35:48,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 17:35:48,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:48,435 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] [2025-03-03 17:35:48,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 17:35:48,436 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:48,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash -595000743, now seen corresponding path program 1 times [2025-03-03 17:35:48,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:48,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238637919] [2025-03-03 17:35:48,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:48,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:48,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 17:35:48,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 17:35:48,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:48,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:48,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:48,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:48,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238637919] [2025-03-03 17:35:48,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238637919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:48,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:48,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:48,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757469446] [2025-03-03 17:35:48,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:48,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:48,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:48,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:48,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:48,767 INFO L87 Difference]: Start difference. First operand 1590 states and 2365 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:49,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:49,276 INFO L93 Difference]: Finished difference Result 4287 states and 6370 transitions. [2025-03-03 17:35:49,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:49,277 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-03 17:35:49,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:49,283 INFO L225 Difference]: With dead ends: 4287 [2025-03-03 17:35:49,283 INFO L226 Difference]: Without dead ends: 2739 [2025-03-03 17:35:49,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:49,285 INFO L435 NwaCegarLoop]: 1394 mSDtfsCounter, 954 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 954 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:49,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [954 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:49,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2025-03-03 17:35:49,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 1843. [2025-03-03 17:35:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1843 states, 1842 states have (on average 1.485342019543974) internal successors, (2736), 1842 states have internal predecessors, (2736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 2736 transitions. [2025-03-03 17:35:49,314 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 2736 transitions. Word has length 227 [2025-03-03 17:35:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:49,315 INFO L471 AbstractCegarLoop]: Abstraction has 1843 states and 2736 transitions. [2025-03-03 17:35:49,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 2736 transitions. [2025-03-03 17:35:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 17:35:49,318 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:49,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] [2025-03-03 17:35:49,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 17:35:49,318 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:49,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:49,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1829699142, now seen corresponding path program 1 times [2025-03-03 17:35:49,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677891609] [2025-03-03 17:35:49,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:49,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:49,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 17:35:49,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 17:35:49,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:49,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:50,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:50,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677891609] [2025-03-03 17:35:50,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677891609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:50,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 17:35:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609393741] [2025-03-03 17:35:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:50,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 17:35:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:50,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 17:35:50,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:35:50,713 INFO L87 Difference]: Start difference. First operand 1843 states and 2736 transitions. Second operand has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:52,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:52,064 INFO L93 Difference]: Finished difference Result 3615 states and 5349 transitions. [2025-03-03 17:35:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 17:35:52,064 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-03 17:35:52,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:52,069 INFO L225 Difference]: With dead ends: 3615 [2025-03-03 17:35:52,070 INFO L226 Difference]: Without dead ends: 2023 [2025-03-03 17:35:52,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=351, Unknown=0, NotChecked=0, Total=420 [2025-03-03 17:35:52,072 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 1708 mSDsluCounter, 12517 mSDsCounter, 0 mSdLazyCounter, 2969 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1708 SdHoareTripleChecker+Valid, 13910 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:52,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1708 Valid, 13910 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2969 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 17:35:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2025-03-03 17:35:52,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 2019. [2025-03-03 17:35:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2019 states, 2018 states have (on average 1.4757185332011893) internal successors, (2978), 2018 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2019 states to 2019 states and 2978 transitions. [2025-03-03 17:35:52,096 INFO L78 Accepts]: Start accepts. Automaton has 2019 states and 2978 transitions. Word has length 227 [2025-03-03 17:35:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:52,097 INFO L471 AbstractCegarLoop]: Abstraction has 2019 states and 2978 transitions. [2025-03-03 17:35:52,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.46153846153846) internal successors, (227), 13 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2019 states and 2978 transitions. [2025-03-03 17:35:52,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 17:35:52,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:52,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] [2025-03-03 17:35:52,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 17:35:52,101 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:52,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:52,101 INFO L85 PathProgramCache]: Analyzing trace with hash 68247213, now seen corresponding path program 1 times [2025-03-03 17:35:52,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:52,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685638645] [2025-03-03 17:35:52,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:52,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 17:35:52,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 17:35:52,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:52,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:52,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:52,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685638645] [2025-03-03 17:35:52,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685638645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:52,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:52,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:35:52,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98192174] [2025-03-03 17:35:52,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:52,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:35:52,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:52,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:35:52,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:52,439 INFO L87 Difference]: Start difference. First operand 2019 states and 2978 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:52,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:52,957 INFO L93 Difference]: Finished difference Result 3761 states and 5559 transitions. [2025-03-03 17:35:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:35:52,959 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-03 17:35:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:52,963 INFO L225 Difference]: With dead ends: 3761 [2025-03-03 17:35:52,964 INFO L226 Difference]: Without dead ends: 2085 [2025-03-03 17:35:52,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:52,966 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:52,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-03 17:35:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 2079. [2025-03-03 17:35:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2079 states, 2078 states have (on average 1.4754571703561117) internal successors, (3066), 2078 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:52,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2079 states to 2079 states and 3066 transitions. [2025-03-03 17:35:52,989 INFO L78 Accepts]: Start accepts. Automaton has 2079 states and 3066 transitions. Word has length 227 [2025-03-03 17:35:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:52,989 INFO L471 AbstractCegarLoop]: Abstraction has 2079 states and 3066 transitions. [2025-03-03 17:35:52,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:52,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2079 states and 3066 transitions. [2025-03-03 17:35:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 17:35:52,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:52,992 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] [2025-03-03 17:35:52,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 17:35:52,993 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:52,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:52,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1550680454, now seen corresponding path program 1 times [2025-03-03 17:35:52,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:52,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659855988] [2025-03-03 17:35:52,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:52,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:53,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 17:35:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 17:35:53,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:53,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:53,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:53,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659855988] [2025-03-03 17:35:53,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659855988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:53,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:53,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 17:35:53,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147962831] [2025-03-03 17:35:53,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:53,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:35:53,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:53,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:35:53,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:35:53,921 INFO L87 Difference]: Start difference. First operand 2079 states and 3066 transitions. Second operand has 12 states, 12 states have (on average 18.916666666666668) internal successors, (227), 12 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:55,069 INFO L93 Difference]: Finished difference Result 3835 states and 5665 transitions. [2025-03-03 17:35:55,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:35:55,069 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 18.916666666666668) internal successors, (227), 12 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-03 17:35:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:55,074 INFO L225 Difference]: With dead ends: 3835 [2025-03-03 17:35:55,074 INFO L226 Difference]: Without dead ends: 2099 [2025-03-03 17:35:55,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-03 17:35:55,076 INFO L435 NwaCegarLoop]: 1390 mSDtfsCounter, 1664 mSDsluCounter, 12485 mSDsCounter, 0 mSdLazyCounter, 2999 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 13875 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:55,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1664 Valid, 13875 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2999 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:35:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2025-03-03 17:35:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 2091. [2025-03-03 17:35:55,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2091 states, 2090 states have (on average 1.4746411483253588) internal successors, (3082), 2090 states have internal predecessors, (3082), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 3082 transitions. [2025-03-03 17:35:55,098 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 3082 transitions. Word has length 227 [2025-03-03 17:35:55,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:55,098 INFO L471 AbstractCegarLoop]: Abstraction has 2091 states and 3082 transitions. [2025-03-03 17:35:55,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.916666666666668) internal successors, (227), 12 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3082 transitions. [2025-03-03 17:35:55,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 17:35:55,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:55,102 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] [2025-03-03 17:35:55,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 17:35:55,102 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:55,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:55,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1012275708, now seen corresponding path program 1 times [2025-03-03 17:35:55,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:55,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149258155] [2025-03-03 17:35:55,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:55,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:55,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 17:35:55,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 17:35:55,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:55,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:55,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:55,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:55,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149258155] [2025-03-03 17:35:55,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149258155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:55,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:55,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635425342] [2025-03-03 17:35:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:55,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:55,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:55,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:55,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:55,593 INFO L87 Difference]: Start difference. First operand 2091 states and 3082 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:55,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:55,932 INFO L93 Difference]: Finished difference Result 3831 states and 5659 transitions. [2025-03-03 17:35:55,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:55,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-03 17:35:55,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:55,936 INFO L225 Difference]: With dead ends: 3831 [2025-03-03 17:35:55,936 INFO L226 Difference]: Without dead ends: 2083 [2025-03-03 17:35:55,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:55,938 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:55,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:35:55,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2083 states. [2025-03-03 17:35:55,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2083 to 2083. [2025-03-03 17:35:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 2082 states have (on average 1.4726224783861672) internal successors, (3066), 2082 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3066 transitions. [2025-03-03 17:35:55,956 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3066 transitions. Word has length 227 [2025-03-03 17:35:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:55,957 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3066 transitions. [2025-03-03 17:35:55,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3066 transitions. [2025-03-03 17:35:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 17:35:55,959 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:55,959 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] [2025-03-03 17:35:55,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 17:35:55,960 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 866494533, now seen corresponding path program 1 times [2025-03-03 17:35:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914207055] [2025-03-03 17:35:55,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:56,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 17:35:56,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 17:35:56,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:56,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914207055] [2025-03-03 17:35:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914207055] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:56,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:56,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:35:56,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158383924] [2025-03-03 17:35:56,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:56,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:35:56,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:56,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:35:56,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:56,439 INFO L87 Difference]: Start difference. First operand 2083 states and 3066 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:56,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:56,833 INFO L93 Difference]: Finished difference Result 3855 states and 5675 transitions. [2025-03-03 17:35:56,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:56,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-03 17:35:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:56,836 INFO L225 Difference]: With dead ends: 3855 [2025-03-03 17:35:56,836 INFO L226 Difference]: Without dead ends: 2075 [2025-03-03 17:35:56,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:35:56,838 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:56,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:35:56,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2075 states. [2025-03-03 17:35:56,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2075 to 2075. [2025-03-03 17:35:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2075 states, 2074 states have (on average 1.4705882352941178) internal successors, (3050), 2074 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:56,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 3050 transitions. [2025-03-03 17:35:56,852 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 3050 transitions. Word has length 227 [2025-03-03 17:35:56,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:56,852 INFO L471 AbstractCegarLoop]: Abstraction has 2075 states and 3050 transitions. [2025-03-03 17:35:56,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:56,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 3050 transitions. [2025-03-03 17:35:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2025-03-03 17:35:56,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:56,854 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] [2025-03-03 17:35:56,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 17:35:56,854 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:56,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:56,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1989951914, now seen corresponding path program 1 times [2025-03-03 17:35:56,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:56,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105759950] [2025-03-03 17:35:56,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:56,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:56,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-03-03 17:35:56,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-03-03 17:35:56,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:56,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:57,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:57,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:57,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105759950] [2025-03-03 17:35:57,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105759950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:57,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:57,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:57,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521351272] [2025-03-03 17:35:57,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:57,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:57,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:57,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:57,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:57,116 INFO L87 Difference]: Start difference. First operand 2075 states and 3050 transitions. Second operand has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:57,647 INFO L93 Difference]: Finished difference Result 4771 states and 7016 transitions. [2025-03-03 17:35:57,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:35:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 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 227 [2025-03-03 17:35:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:57,652 INFO L225 Difference]: With dead ends: 4771 [2025-03-03 17:35:57,652 INFO L226 Difference]: Without dead ends: 2971 [2025-03-03 17:35:57,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:35:57,656 INFO L435 NwaCegarLoop]: 1394 mSDtfsCounter, 937 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 937 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:57,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [937 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:57,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2971 states. [2025-03-03 17:35:57,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2027. [2025-03-03 17:35:57,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 2026 states have (on average 1.4698914116485686) internal successors, (2978), 2026 states have internal predecessors, (2978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2978 transitions. [2025-03-03 17:35:57,682 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2978 transitions. Word has length 227 [2025-03-03 17:35:57,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:57,682 INFO L471 AbstractCegarLoop]: Abstraction has 2027 states and 2978 transitions. [2025-03-03 17:35:57,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.4) internal successors, (227), 5 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2978 transitions. [2025-03-03 17:35:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:35:57,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:57,684 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] [2025-03-03 17:35:57,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 17:35:57,685 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:57,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:57,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1873670103, now seen corresponding path program 1 times [2025-03-03 17:35:57,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:57,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201587168] [2025-03-03 17:35:57,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:57,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:57,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:35:57,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:35:57,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:57,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:58,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:58,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201587168] [2025-03-03 17:35:58,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201587168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:58,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:58,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:35:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261246797] [2025-03-03 17:35:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:58,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:35:58,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:58,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:35:58,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:58,006 INFO L87 Difference]: Start difference. First operand 2027 states and 2978 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:35:58,543 INFO L93 Difference]: Finished difference Result 3799 states and 5585 transitions. [2025-03-03 17:35:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:35:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:35:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:35:58,547 INFO L225 Difference]: With dead ends: 3799 [2025-03-03 17:35:58,547 INFO L226 Difference]: Without dead ends: 2035 [2025-03-03 17:35:58,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:35:58,551 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:35:58,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:35:58,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2035 states. [2025-03-03 17:35:58,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2035 to 2035. [2025-03-03 17:35:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2035 states, 2034 states have (on average 1.4680432645034416) internal successors, (2986), 2034 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:58,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2986 transitions. [2025-03-03 17:35:58,591 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2986 transitions. Word has length 228 [2025-03-03 17:35:58,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:35:58,592 INFO L471 AbstractCegarLoop]: Abstraction has 2035 states and 2986 transitions. [2025-03-03 17:35:58,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:35:58,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2986 transitions. [2025-03-03 17:35:58,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:35:58,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:35:58,594 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] [2025-03-03 17:35:58,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 17:35:58,595 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:35:58,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:35:58,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1374921350, now seen corresponding path program 1 times [2025-03-03 17:35:58,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:35:58,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741505398] [2025-03-03 17:35:58,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:35:58,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:35:58,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:35:58,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:35:58,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:35:58,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:35:59,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:35:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:35:59,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741505398] [2025-03-03 17:35:59,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741505398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:35:59,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:35:59,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 17:35:59,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76131840] [2025-03-03 17:35:59,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:35:59,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 17:35:59,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:35:59,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 17:35:59,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:35:59,347 INFO L87 Difference]: Start difference. First operand 2035 states and 2986 transitions. Second operand has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:00,034 INFO L93 Difference]: Finished difference Result 3777 states and 5555 transitions. [2025-03-03 17:36:00,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 17:36:00,035 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:00,038 INFO L225 Difference]: With dead ends: 3777 [2025-03-03 17:36:00,038 INFO L226 Difference]: Without dead ends: 2037 [2025-03-03 17:36:00,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-03-03 17:36:00,040 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 1670 mSDsluCounter, 6986 mSDsCounter, 0 mSdLazyCounter, 1742 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 8386 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:00,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1670 Valid, 8386 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:36:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2025-03-03 17:36:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2037. [2025-03-03 17:36:00,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2037 states, 2036 states have (on average 1.4666011787819253) internal successors, (2986), 2036 states have internal predecessors, (2986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2986 transitions. [2025-03-03 17:36:00,063 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2986 transitions. Word has length 228 [2025-03-03 17:36:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:00,063 INFO L471 AbstractCegarLoop]: Abstraction has 2037 states and 2986 transitions. [2025-03-03 17:36:00,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.5) internal successors, (228), 8 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2986 transitions. [2025-03-03 17:36:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:00,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:00,065 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] [2025-03-03 17:36:00,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 17:36:00,066 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:00,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:00,066 INFO L85 PathProgramCache]: Analyzing trace with hash 365110105, now seen corresponding path program 1 times [2025-03-03 17:36:00,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:00,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222999759] [2025-03-03 17:36:00,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:00,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:00,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:00,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:00,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:00,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:00,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222999759] [2025-03-03 17:36:00,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222999759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:00,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:00,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175203577] [2025-03-03 17:36:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:00,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:00,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:00,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:00,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:00,696 INFO L87 Difference]: Start difference. First operand 2037 states and 2986 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:01,114 INFO L93 Difference]: Finished difference Result 3839 states and 5641 transitions. [2025-03-03 17:36:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:01,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:01,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:01,117 INFO L225 Difference]: With dead ends: 3839 [2025-03-03 17:36:01,117 INFO L226 Difference]: Without dead ends: 2097 [2025-03-03 17:36:01,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-03 17:36:01,120 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 1601 mSDsluCounter, 4197 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 5599 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:01,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 5599 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:01,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2097 states. [2025-03-03 17:36:01,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2097 to 2097. [2025-03-03 17:36:01,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2097 states, 2096 states have (on average 1.4646946564885497) internal successors, (3070), 2096 states have internal predecessors, (3070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2097 states to 2097 states and 3070 transitions. [2025-03-03 17:36:01,138 INFO L78 Accepts]: Start accepts. Automaton has 2097 states and 3070 transitions. Word has length 228 [2025-03-03 17:36:01,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:01,139 INFO L471 AbstractCegarLoop]: Abstraction has 2097 states and 3070 transitions. [2025-03-03 17:36:01,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:01,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2097 states and 3070 transitions. [2025-03-03 17:36:01,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:01,141 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:01,141 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] [2025-03-03 17:36:01,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 17:36:01,141 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:01,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:01,142 INFO L85 PathProgramCache]: Analyzing trace with hash -514830370, now seen corresponding path program 1 times [2025-03-03 17:36:01,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:01,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012078279] [2025-03-03 17:36:01,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:01,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:01,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:01,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:01,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:01,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:01,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:01,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:01,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012078279] [2025-03-03 17:36:01,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012078279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:01,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:01,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:01,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597683044] [2025-03-03 17:36:01,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:01,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:01,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:01,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:01,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:01,725 INFO L87 Difference]: Start difference. First operand 2097 states and 3070 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:02,267 INFO L93 Difference]: Finished difference Result 3921 states and 5753 transitions. [2025-03-03 17:36:02,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:02,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:02,272 INFO L225 Difference]: With dead ends: 3921 [2025-03-03 17:36:02,272 INFO L226 Difference]: Without dead ends: 2119 [2025-03-03 17:36:02,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:02,276 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 1555 mSDsluCounter, 5525 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 6909 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:02,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 6909 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:02,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2025-03-03 17:36:02,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2119. [2025-03-03 17:36:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2119 states, 2118 states have (on average 1.4627006610009443) internal successors, (3098), 2118 states have internal predecessors, (3098), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2119 states to 2119 states and 3098 transitions. [2025-03-03 17:36:02,300 INFO L78 Accepts]: Start accepts. Automaton has 2119 states and 3098 transitions. Word has length 228 [2025-03-03 17:36:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:02,300 INFO L471 AbstractCegarLoop]: Abstraction has 2119 states and 3098 transitions. [2025-03-03 17:36:02,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3098 transitions. [2025-03-03 17:36:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:02,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:02,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] [2025-03-03 17:36:02,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 17:36:02,302 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:02,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -2071373051, now seen corresponding path program 1 times [2025-03-03 17:36:02,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:02,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934710430] [2025-03-03 17:36:02,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:02,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:02,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:02,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:02,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:02,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:02,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:02,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:02,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934710430] [2025-03-03 17:36:02,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934710430] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:02,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:02,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:02,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465993009] [2025-03-03 17:36:02,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:02,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:02,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:02,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:02,614 INFO L87 Difference]: Start difference. First operand 2119 states and 3098 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:03,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:03,128 INFO L93 Difference]: Finished difference Result 4009 states and 5875 transitions. [2025-03-03 17:36:03,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:03,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:03,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:03,134 INFO L225 Difference]: With dead ends: 4009 [2025-03-03 17:36:03,134 INFO L226 Difference]: Without dead ends: 2185 [2025-03-03 17:36:03,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:03,137 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:03,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2025-03-03 17:36:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2179. [2025-03-03 17:36:03,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 2178 states have (on average 1.462809917355372) internal successors, (3186), 2178 states have internal predecessors, (3186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:03,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3186 transitions. [2025-03-03 17:36:03,157 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3186 transitions. Word has length 228 [2025-03-03 17:36:03,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:03,157 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 3186 transitions. [2025-03-03 17:36:03,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3186 transitions. [2025-03-03 17:36:03,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:03,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:03,159 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] [2025-03-03 17:36:03,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 17:36:03,159 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:03,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:03,160 INFO L85 PathProgramCache]: Analyzing trace with hash 245486541, now seen corresponding path program 1 times [2025-03-03 17:36:03,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:03,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853326301] [2025-03-03 17:36:03,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:03,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:03,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:03,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:03,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:03,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:03,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:03,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853326301] [2025-03-03 17:36:03,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853326301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:03,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:03,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:03,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548465285] [2025-03-03 17:36:03,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:03,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:03,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:03,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:03,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:03,812 INFO L87 Difference]: Start difference. First operand 2179 states and 3186 transitions. Second operand has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:04,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:04,350 INFO L93 Difference]: Finished difference Result 4079 states and 5977 transitions. [2025-03-03 17:36:04,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:04,350 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:04,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:04,352 INFO L225 Difference]: With dead ends: 4079 [2025-03-03 17:36:04,352 INFO L226 Difference]: Without dead ends: 2195 [2025-03-03 17:36:04,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:04,354 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 1572 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 6988 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:04,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 6988 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:04,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2025-03-03 17:36:04,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2193. [2025-03-03 17:36:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2193 states, 2192 states have (on average 1.4607664233576643) internal successors, (3202), 2192 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2193 states to 2193 states and 3202 transitions. [2025-03-03 17:36:04,374 INFO L78 Accepts]: Start accepts. Automaton has 2193 states and 3202 transitions. Word has length 228 [2025-03-03 17:36:04,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:04,374 INFO L471 AbstractCegarLoop]: Abstraction has 2193 states and 3202 transitions. [2025-03-03 17:36:04,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:04,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2193 states and 3202 transitions. [2025-03-03 17:36:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:04,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:04,377 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] [2025-03-03 17:36:04,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 17:36:04,377 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:04,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:04,378 INFO L85 PathProgramCache]: Analyzing trace with hash -622315692, now seen corresponding path program 1 times [2025-03-03 17:36:04,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:04,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775874558] [2025-03-03 17:36:04,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:04,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:04,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:04,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:04,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:04,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:04,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:04,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775874558] [2025-03-03 17:36:04,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775874558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:04,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:04,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:04,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714592606] [2025-03-03 17:36:04,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:04,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:04,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:04,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:04,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:04,696 INFO L87 Difference]: Start difference. First operand 2193 states and 3202 transitions. Second operand has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:05,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:05,122 INFO L93 Difference]: Finished difference Result 4107 states and 6007 transitions. [2025-03-03 17:36:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:05,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:05,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:05,125 INFO L225 Difference]: With dead ends: 4107 [2025-03-03 17:36:05,125 INFO L226 Difference]: Without dead ends: 2209 [2025-03-03 17:36:05,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:05,127 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:05,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:05,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2025-03-03 17:36:05,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 2209. [2025-03-03 17:36:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2209 states, 2208 states have (on average 1.457427536231884) internal successors, (3218), 2208 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2209 states to 2209 states and 3218 transitions. [2025-03-03 17:36:05,147 INFO L78 Accepts]: Start accepts. Automaton has 2209 states and 3218 transitions. Word has length 228 [2025-03-03 17:36:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:05,147 INFO L471 AbstractCegarLoop]: Abstraction has 2209 states and 3218 transitions. [2025-03-03 17:36:05,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:05,148 INFO L276 IsEmpty]: Start isEmpty. Operand 2209 states and 3218 transitions. [2025-03-03 17:36:05,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:05,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:05,150 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] [2025-03-03 17:36:05,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 17:36:05,150 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:05,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:05,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2103886642, now seen corresponding path program 1 times [2025-03-03 17:36:05,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:05,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810124599] [2025-03-03 17:36:05,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:05,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:05,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:05,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:05,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:05,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:05,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810124599] [2025-03-03 17:36:05,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810124599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:05,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:05,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:05,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745311895] [2025-03-03 17:36:05,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:05,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:05,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:05,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:05,747 INFO L87 Difference]: Start difference. First operand 2209 states and 3218 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:06,251 INFO L93 Difference]: Finished difference Result 4217 states and 6143 transitions. [2025-03-03 17:36:06,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:06,252 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:06,254 INFO L225 Difference]: With dead ends: 4217 [2025-03-03 17:36:06,254 INFO L226 Difference]: Without dead ends: 2281 [2025-03-03 17:36:06,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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-03 17:36:06,260 INFO L435 NwaCegarLoop]: 1402 mSDtfsCounter, 1632 mSDsluCounter, 4198 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 5600 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:06,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 5600 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:06,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2281 states. [2025-03-03 17:36:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2281 to 2281. [2025-03-03 17:36:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2281 states, 2280 states have (on average 1.4535087719298245) internal successors, (3314), 2280 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2281 states to 2281 states and 3314 transitions. [2025-03-03 17:36:06,280 INFO L78 Accepts]: Start accepts. Automaton has 2281 states and 3314 transitions. Word has length 228 [2025-03-03 17:36:06,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:06,281 INFO L471 AbstractCegarLoop]: Abstraction has 2281 states and 3314 transitions. [2025-03-03 17:36:06,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:06,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2281 states and 3314 transitions. [2025-03-03 17:36:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:06,283 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:06,283 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] [2025-03-03 17:36:06,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 17:36:06,283 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:06,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:06,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2082983023, now seen corresponding path program 1 times [2025-03-03 17:36:06,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:06,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641240140] [2025-03-03 17:36:06,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:06,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:06,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:06,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:06,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:06,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:06,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641240140] [2025-03-03 17:36:06,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641240140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:06,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:06,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:06,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615430251] [2025-03-03 17:36:06,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:06,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:06,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:06,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:06,644 INFO L87 Difference]: Start difference. First operand 2281 states and 3314 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:07,783 INFO L93 Difference]: Finished difference Result 5794 states and 8427 transitions. [2025-03-03 17:36:07,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:07,783 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:07,787 INFO L225 Difference]: With dead ends: 5794 [2025-03-03 17:36:07,787 INFO L226 Difference]: Without dead ends: 3844 [2025-03-03 17:36:07,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:07,791 INFO L435 NwaCegarLoop]: 1504 mSDtfsCounter, 2651 mSDsluCounter, 4177 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 5681 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:07,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 5681 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 17:36:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2025-03-03 17:36:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 2546. [2025-03-03 17:36:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 2545 states have (on average 1.4526522593320235) internal successors, (3697), 2545 states have internal predecessors, (3697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3697 transitions. [2025-03-03 17:36:07,823 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3697 transitions. Word has length 228 [2025-03-03 17:36:07,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:07,823 INFO L471 AbstractCegarLoop]: Abstraction has 2546 states and 3697 transitions. [2025-03-03 17:36:07,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:07,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3697 transitions. [2025-03-03 17:36:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-03 17:36:07,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:07,826 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] [2025-03-03 17:36:07,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 17:36:07,827 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:07,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:07,828 INFO L85 PathProgramCache]: Analyzing trace with hash 372968384, now seen corresponding path program 1 times [2025-03-03 17:36:07,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:07,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544804534] [2025-03-03 17:36:07,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:07,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:07,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-03 17:36:07,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-03 17:36:07,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:07,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544804534] [2025-03-03 17:36:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544804534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:08,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:08,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476472190] [2025-03-03 17:36:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:08,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:08,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:08,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:08,212 INFO L87 Difference]: Start difference. First operand 2546 states and 3697 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:09,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:09,425 INFO L93 Difference]: Finished difference Result 5778 states and 8407 transitions. [2025-03-03 17:36:09,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:09,425 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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 228 [2025-03-03 17:36:09,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:09,428 INFO L225 Difference]: With dead ends: 5778 [2025-03-03 17:36:09,428 INFO L226 Difference]: Without dead ends: 3828 [2025-03-03 17:36:09,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:09,430 INFO L435 NwaCegarLoop]: 1908 mSDtfsCounter, 2640 mSDsluCounter, 4985 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2640 SdHoareTripleChecker+Valid, 6893 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:09,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2640 Valid, 6893 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 17:36:09,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2025-03-03 17:36:09,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 2610. [2025-03-03 17:36:09,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2610 states, 2609 states have (on average 1.4492142583365275) internal successors, (3781), 2609 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 3781 transitions. [2025-03-03 17:36:09,456 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 3781 transitions. Word has length 228 [2025-03-03 17:36:09,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:09,456 INFO L471 AbstractCegarLoop]: Abstraction has 2610 states and 3781 transitions. [2025-03-03 17:36:09,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:09,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 3781 transitions. [2025-03-03 17:36:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 17:36:09,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:09,459 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] [2025-03-03 17:36:09,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 17:36:09,460 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:09,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:09,460 INFO L85 PathProgramCache]: Analyzing trace with hash 563372395, now seen corresponding path program 1 times [2025-03-03 17:36:09,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:09,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961863154] [2025-03-03 17:36:09,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:09,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:09,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 17:36:09,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 17:36:09,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:09,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961863154] [2025-03-03 17:36:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961863154] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059760263] [2025-03-03 17:36:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:09,849 INFO L87 Difference]: Start difference. First operand 2610 states and 3781 transitions. Second operand has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:10,244 INFO L93 Difference]: Finished difference Result 4592 states and 6674 transitions. [2025-03-03 17:36:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-03 17:36:10,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:10,247 INFO L225 Difference]: With dead ends: 4592 [2025-03-03 17:36:10,247 INFO L226 Difference]: Without dead ends: 2642 [2025-03-03 17:36:10,249 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-03 17:36:10,249 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1573 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:10,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:10,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2025-03-03 17:36:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2634. [2025-03-03 17:36:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2634 states, 2633 states have (on average 1.4481579946828713) internal successors, (3813), 2633 states have internal predecessors, (3813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2634 states to 2634 states and 3813 transitions. [2025-03-03 17:36:10,272 INFO L78 Accepts]: Start accepts. Automaton has 2634 states and 3813 transitions. Word has length 229 [2025-03-03 17:36:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:10,273 INFO L471 AbstractCegarLoop]: Abstraction has 2634 states and 3813 transitions. [2025-03-03 17:36:10,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.8) internal successors, (229), 5 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:10,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2634 states and 3813 transitions. [2025-03-03 17:36:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 17:36:10,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:10,275 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] [2025-03-03 17:36:10,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 17:36:10,275 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:10,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:10,276 INFO L85 PathProgramCache]: Analyzing trace with hash 660310679, now seen corresponding path program 1 times [2025-03-03 17:36:10,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:10,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388410068] [2025-03-03 17:36:10,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:10,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:10,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 17:36:10,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 17:36:10,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:10,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:10,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:10,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388410068] [2025-03-03 17:36:10,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388410068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:10,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:10,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:36:10,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143811548] [2025-03-03 17:36:10,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:10,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:36:10,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:10,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:36:10,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:10,584 INFO L87 Difference]: Start difference. First operand 2634 states and 3813 transitions. Second operand has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:11,061 INFO L93 Difference]: Finished difference Result 4674 states and 6790 transitions. [2025-03-03 17:36:11,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:36:11,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-03 17:36:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:11,063 INFO L225 Difference]: With dead ends: 4674 [2025-03-03 17:36:11,064 INFO L226 Difference]: Without dead ends: 2700 [2025-03-03 17:36:11,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:11,066 INFO L435 NwaCegarLoop]: 1401 mSDtfsCounter, 33 mSDsluCounter, 5591 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 6992 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:11,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 6992 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2700 states. [2025-03-03 17:36:11,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2700 to 2694. [2025-03-03 17:36:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2694 states, 2693 states have (on average 1.448570367619755) internal successors, (3901), 2693 states have internal predecessors, (3901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2694 states to 2694 states and 3901 transitions. [2025-03-03 17:36:11,089 INFO L78 Accepts]: Start accepts. Automaton has 2694 states and 3901 transitions. Word has length 229 [2025-03-03 17:36:11,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:11,089 INFO L471 AbstractCegarLoop]: Abstraction has 2694 states and 3901 transitions. [2025-03-03 17:36:11,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:11,089 INFO L276 IsEmpty]: Start isEmpty. Operand 2694 states and 3901 transitions. [2025-03-03 17:36:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 17:36:11,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:11,092 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] [2025-03-03 17:36:11,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 17:36:11,093 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:11,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:11,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1938730640, now seen corresponding path program 1 times [2025-03-03 17:36:11,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:11,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990335285] [2025-03-03 17:36:11,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:11,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:11,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 17:36:11,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 17:36:11,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:11,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:11,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:11,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:11,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990335285] [2025-03-03 17:36:11,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990335285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:11,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:11,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:11,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083127091] [2025-03-03 17:36:11,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:11,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:11,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:11,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:11,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:11,688 INFO L87 Difference]: Start difference. First operand 2694 states and 3901 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:12,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:12,184 INFO L93 Difference]: Finished difference Result 4750 states and 6900 transitions. [2025-03-03 17:36:12,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:12,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-03 17:36:12,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:12,186 INFO L225 Difference]: With dead ends: 4750 [2025-03-03 17:36:12,187 INFO L226 Difference]: Without dead ends: 2716 [2025-03-03 17:36:12,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:12,189 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 1538 mSDsluCounter, 5588 mSDsCounter, 0 mSdLazyCounter, 1451 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1538 SdHoareTripleChecker+Valid, 6988 SdHoareTripleChecker+Invalid, 1452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:12,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1538 Valid, 6988 Invalid, 1452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1451 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2716 states. [2025-03-03 17:36:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2716 to 2716. [2025-03-03 17:36:12,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2716 states, 2715 states have (on average 1.4471454880294659) internal successors, (3929), 2715 states have internal predecessors, (3929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:12,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2716 states to 2716 states and 3929 transitions. [2025-03-03 17:36:12,210 INFO L78 Accepts]: Start accepts. Automaton has 2716 states and 3929 transitions. Word has length 229 [2025-03-03 17:36:12,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:12,210 INFO L471 AbstractCegarLoop]: Abstraction has 2716 states and 3929 transitions. [2025-03-03 17:36:12,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:12,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2716 states and 3929 transitions. [2025-03-03 17:36:12,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-03-03 17:36:12,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:12,213 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] [2025-03-03 17:36:12,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 17:36:12,213 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:12,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:12,214 INFO L85 PathProgramCache]: Analyzing trace with hash 951614187, now seen corresponding path program 1 times [2025-03-03 17:36:12,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:12,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693896453] [2025-03-03 17:36:12,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:12,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:12,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-03-03 17:36:12,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-03-03 17:36:12,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:12,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:13,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:13,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:13,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693896453] [2025-03-03 17:36:13,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693896453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:13,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:13,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 17:36:13,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736054337] [2025-03-03 17:36:13,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:13,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 17:36:13,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:13,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 17:36:13,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-03 17:36:13,388 INFO L87 Difference]: Start difference. First operand 2716 states and 3929 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:13,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:13,985 INFO L93 Difference]: Finished difference Result 4806 states and 6972 transitions. [2025-03-03 17:36:13,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 17:36:13,986 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 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 229 [2025-03-03 17:36:13,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:13,988 INFO L225 Difference]: With dead ends: 4806 [2025-03-03 17:36:13,988 INFO L226 Difference]: Without dead ends: 2750 [2025-03-03 17:36:13,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:13,990 INFO L435 NwaCegarLoop]: 1381 mSDtfsCounter, 1523 mSDsluCounter, 5512 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 6893 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:13,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1523 Valid, 6893 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2750 states. [2025-03-03 17:36:14,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2750 to 2740. [2025-03-03 17:36:14,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2740 states, 2739 states have (on average 1.4468784227820373) internal successors, (3963), 2739 states have internal predecessors, (3963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2740 states to 2740 states and 3963 transitions. [2025-03-03 17:36:14,013 INFO L78 Accepts]: Start accepts. Automaton has 2740 states and 3963 transitions. Word has length 229 [2025-03-03 17:36:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:14,013 INFO L471 AbstractCegarLoop]: Abstraction has 2740 states and 3963 transitions. [2025-03-03 17:36:14,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 2740 states and 3963 transitions. [2025-03-03 17:36:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 17:36:14,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:14,016 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] [2025-03-03 17:36:14,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-03 17:36:14,016 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:14,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:14,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1402789056, now seen corresponding path program 1 times [2025-03-03 17:36:14,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:14,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952565373] [2025-03-03 17:36:14,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:14,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:14,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 17:36:14,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 17:36:14,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:14,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:14,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:14,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952565373] [2025-03-03 17:36:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952565373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:14,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:14,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:36:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018849729] [2025-03-03 17:36:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:14,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:36:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:14,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:36:14,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:14,677 INFO L87 Difference]: Start difference. First operand 2740 states and 3963 transitions. Second operand has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:15,980 INFO L93 Difference]: Finished difference Result 6207 states and 9023 transitions. [2025-03-03 17:36:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 17:36:15,981 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-03 17:36:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:15,983 INFO L225 Difference]: With dead ends: 6207 [2025-03-03 17:36:15,983 INFO L226 Difference]: Without dead ends: 2754 [2025-03-03 17:36:15,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-03-03 17:36:15,986 INFO L435 NwaCegarLoop]: 1820 mSDtfsCounter, 1466 mSDsluCounter, 12097 mSDsCounter, 0 mSdLazyCounter, 3533 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 13917 SdHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 3533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:15,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 13917 Invalid, 3579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 3533 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 17:36:15,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2025-03-03 17:36:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2750. [2025-03-03 17:36:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2750 states, 2749 states have (on average 1.4459803564932703) internal successors, (3975), 2749 states have internal predecessors, (3975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2750 states to 2750 states and 3975 transitions. [2025-03-03 17:36:16,004 INFO L78 Accepts]: Start accepts. Automaton has 2750 states and 3975 transitions. Word has length 230 [2025-03-03 17:36:16,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:16,004 INFO L471 AbstractCegarLoop]: Abstraction has 2750 states and 3975 transitions. [2025-03-03 17:36:16,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.0) internal successors, (230), 10 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:16,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2750 states and 3975 transitions. [2025-03-03 17:36:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 17:36:16,006 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:16,006 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] [2025-03-03 17:36:16,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 17:36:16,006 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:16,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:16,007 INFO L85 PathProgramCache]: Analyzing trace with hash 660791675, now seen corresponding path program 1 times [2025-03-03 17:36:16,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:16,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628770536] [2025-03-03 17:36:16,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:16,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:16,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 17:36:16,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 17:36:16,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:16,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:16,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628770536] [2025-03-03 17:36:16,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628770536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:16,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:16,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:16,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578963047] [2025-03-03 17:36:16,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:16,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:16,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:16,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:16,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:16,359 INFO L87 Difference]: Start difference. First operand 2750 states and 3975 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:16,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:16,664 INFO L93 Difference]: Finished difference Result 4848 states and 7026 transitions. [2025-03-03 17:36:16,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:16,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-03 17:36:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:16,666 INFO L225 Difference]: With dead ends: 4848 [2025-03-03 17:36:16,667 INFO L226 Difference]: Without dead ends: 2758 [2025-03-03 17:36:16,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:16,669 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:16,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:16,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2025-03-03 17:36:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2758. [2025-03-03 17:36:16,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2758 states, 2757 states have (on average 1.4446862531737397) internal successors, (3983), 2757 states have internal predecessors, (3983), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 3983 transitions. [2025-03-03 17:36:16,689 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 3983 transitions. Word has length 230 [2025-03-03 17:36:16,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:16,689 INFO L471 AbstractCegarLoop]: Abstraction has 2758 states and 3983 transitions. [2025-03-03 17:36:16,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:16,689 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 3983 transitions. [2025-03-03 17:36:16,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-03 17:36:16,692 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:16,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:36:16,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 17:36:16,692 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:16,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:16,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1987436756, now seen corresponding path program 1 times [2025-03-03 17:36:16,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:16,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545317573] [2025-03-03 17:36:16,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:16,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:16,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-03 17:36:16,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-03 17:36:16,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:16,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:16,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:16,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:16,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545317573] [2025-03-03 17:36:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545317573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:16,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:16,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889594017] [2025-03-03 17:36:16,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:16,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:16,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:16,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:16,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:16,980 INFO L87 Difference]: Start difference. First operand 2758 states and 3983 transitions. Second operand has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:17,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:17,393 INFO L93 Difference]: Finished difference Result 4860 states and 7036 transitions. [2025-03-03 17:36:17,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:17,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 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 230 [2025-03-03 17:36:17,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:17,395 INFO L225 Difference]: With dead ends: 4860 [2025-03-03 17:36:17,395 INFO L226 Difference]: Without dead ends: 2762 [2025-03-03 17:36:17,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:17,397 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5559 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:17,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5559 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2762 states. [2025-03-03 17:36:17,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2762 to 2762. [2025-03-03 17:36:17,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2761 states have (on average 1.4440420137631294) internal successors, (3987), 2761 states have internal predecessors, (3987), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:17,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3987 transitions. [2025-03-03 17:36:17,417 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 3987 transitions. Word has length 230 [2025-03-03 17:36:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:17,417 INFO L471 AbstractCegarLoop]: Abstraction has 2762 states and 3987 transitions. [2025-03-03 17:36:17,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.0) internal successors, (230), 5 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:17,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3987 transitions. [2025-03-03 17:36:17,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 17:36:17,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:17,420 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] [2025-03-03 17:36:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 17:36:17,420 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:17,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:17,420 INFO L85 PathProgramCache]: Analyzing trace with hash -179232592, now seen corresponding path program 1 times [2025-03-03 17:36:17,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:17,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484638460] [2025-03-03 17:36:17,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:17,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:17,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 17:36:17,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 17:36:17,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:17,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:17,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:17,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484638460] [2025-03-03 17:36:17,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484638460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:17,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:17,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:17,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346562169] [2025-03-03 17:36:17,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:17,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:17,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:17,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:17,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:17,821 INFO L87 Difference]: Start difference. First operand 2762 states and 3987 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:18,223 INFO L93 Difference]: Finished difference Result 4872 states and 7050 transitions. [2025-03-03 17:36:18,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:18,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-03 17:36:18,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:18,225 INFO L225 Difference]: With dead ends: 4872 [2025-03-03 17:36:18,225 INFO L226 Difference]: Without dead ends: 2770 [2025-03-03 17:36:18,226 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-03 17:36:18,226 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1495 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:18,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:18,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2025-03-03 17:36:18,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2768. [2025-03-03 17:36:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2768 states, 2767 states have (on average 1.4438019515720997) internal successors, (3995), 2767 states have internal predecessors, (3995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2768 states to 2768 states and 3995 transitions. [2025-03-03 17:36:18,241 INFO L78 Accepts]: Start accepts. Automaton has 2768 states and 3995 transitions. Word has length 231 [2025-03-03 17:36:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:18,241 INFO L471 AbstractCegarLoop]: Abstraction has 2768 states and 3995 transitions. [2025-03-03 17:36:18,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 2768 states and 3995 transitions. [2025-03-03 17:36:18,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 17:36:18,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:18,244 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] [2025-03-03 17:36:18,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-03 17:36:18,244 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1993826199, now seen corresponding path program 1 times [2025-03-03 17:36:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:18,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867955259] [2025-03-03 17:36:18,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:18,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:18,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 17:36:18,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 17:36:18,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:18,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867955259] [2025-03-03 17:36:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867955259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668267051] [2025-03-03 17:36:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:18,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:18,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:18,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:18,837 INFO L87 Difference]: Start difference. First operand 2768 states and 3995 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:19,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:19,406 INFO L93 Difference]: Finished difference Result 4882 states and 7062 transitions. [2025-03-03 17:36:19,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:19,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-03 17:36:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:19,408 INFO L225 Difference]: With dead ends: 4882 [2025-03-03 17:36:19,408 INFO L226 Difference]: Without dead ends: 2774 [2025-03-03 17:36:19,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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-03 17:36:19,410 INFO L435 NwaCegarLoop]: 1226 mSDtfsCounter, 1474 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 1389 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 3675 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:19,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 3675 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1389 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 17:36:19,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2025-03-03 17:36:19,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774. [2025-03-03 17:36:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2774 states, 2773 states have (on average 1.442841687702849) internal successors, (4001), 2773 states have internal predecessors, (4001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:19,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 4001 transitions. [2025-03-03 17:36:19,427 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 4001 transitions. Word has length 231 [2025-03-03 17:36:19,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:19,427 INFO L471 AbstractCegarLoop]: Abstraction has 2774 states and 4001 transitions. [2025-03-03 17:36:19,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:19,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 4001 transitions. [2025-03-03 17:36:19,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 17:36:19,429 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:19,429 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] [2025-03-03 17:36:19,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-03 17:36:19,429 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:19,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash 300635868, now seen corresponding path program 1 times [2025-03-03 17:36:19,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:19,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200450940] [2025-03-03 17:36:19,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:19,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:19,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 17:36:19,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 17:36:19,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:19,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:19,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:19,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200450940] [2025-03-03 17:36:19,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200450940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:19,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:19,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:19,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004247155] [2025-03-03 17:36:19,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:19,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:19,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:19,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:19,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:19,912 INFO L87 Difference]: Start difference. First operand 2774 states and 4001 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:20,273 INFO L93 Difference]: Finished difference Result 4894 states and 7076 transitions. [2025-03-03 17:36:20,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:20,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-03 17:36:20,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:20,275 INFO L225 Difference]: With dead ends: 4894 [2025-03-03 17:36:20,275 INFO L226 Difference]: Without dead ends: 2780 [2025-03-03 17:36:20,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-03 17:36:20,277 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1482 mSDsluCounter, 2770 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 4158 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:20,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 4158 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:20,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2025-03-03 17:36:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2780. [2025-03-03 17:36:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2780 states, 2779 states have (on average 1.442605253688377) internal successors, (4009), 2779 states have internal predecessors, (4009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2780 states to 2780 states and 4009 transitions. [2025-03-03 17:36:20,298 INFO L78 Accepts]: Start accepts. Automaton has 2780 states and 4009 transitions. Word has length 231 [2025-03-03 17:36:20,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:20,298 INFO L471 AbstractCegarLoop]: Abstraction has 2780 states and 4009 transitions. [2025-03-03 17:36:20,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:20,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2780 states and 4009 transitions. [2025-03-03 17:36:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 17:36:20,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:20,301 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] [2025-03-03 17:36:20,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-03 17:36:20,301 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:20,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:20,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1587923536, now seen corresponding path program 1 times [2025-03-03 17:36:20,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:20,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483199953] [2025-03-03 17:36:20,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:20,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 17:36:20,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 17:36:20,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:20,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:20,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:20,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483199953] [2025-03-03 17:36:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483199953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417295666] [2025-03-03 17:36:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:20,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:20,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:20,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:20,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:20,682 INFO L87 Difference]: Start difference. First operand 2780 states and 4009 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:21,094 INFO L93 Difference]: Finished difference Result 4916 states and 7106 transitions. [2025-03-03 17:36:21,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:21,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-03 17:36:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:21,096 INFO L225 Difference]: With dead ends: 4916 [2025-03-03 17:36:21,096 INFO L226 Difference]: Without dead ends: 2796 [2025-03-03 17:36:21,098 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-03 17:36:21,098 INFO L435 NwaCegarLoop]: 1387 mSDtfsCounter, 1489 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 4156 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:21,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 4156 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2025-03-03 17:36:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2792. [2025-03-03 17:36:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2792 states, 2791 states have (on average 1.4421354353278395) internal successors, (4025), 2791 states have internal predecessors, (4025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2792 states to 2792 states and 4025 transitions. [2025-03-03 17:36:21,113 INFO L78 Accepts]: Start accepts. Automaton has 2792 states and 4025 transitions. Word has length 231 [2025-03-03 17:36:21,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:21,114 INFO L471 AbstractCegarLoop]: Abstraction has 2792 states and 4025 transitions. [2025-03-03 17:36:21,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 2792 states and 4025 transitions. [2025-03-03 17:36:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 17:36:21,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:21,116 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] [2025-03-03 17:36:21,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-03 17:36:21,116 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:21,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1448104913, now seen corresponding path program 1 times [2025-03-03 17:36:21,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:21,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641845290] [2025-03-03 17:36:21,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:21,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:21,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 17:36:21,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 17:36:21,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:21,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:21,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:21,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:21,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641845290] [2025-03-03 17:36:21,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641845290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:21,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:21,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:21,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785655720] [2025-03-03 17:36:21,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:21,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:21,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:21,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:21,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:21,378 INFO L87 Difference]: Start difference. First operand 2792 states and 4025 transitions. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:21,780 INFO L93 Difference]: Finished difference Result 5250 states and 7553 transitions. [2025-03-03 17:36:21,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:21,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 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 231 [2025-03-03 17:36:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:21,782 INFO L225 Difference]: With dead ends: 5250 [2025-03-03 17:36:21,783 INFO L226 Difference]: Without dead ends: 2798 [2025-03-03 17:36:21,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:21,785 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 4211 mSDsCounter, 0 mSdLazyCounter, 1132 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5619 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:21,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5619 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1132 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2025-03-03 17:36:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2798. [2025-03-03 17:36:21,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2798 states, 2797 states have (on average 1.4411869860564892) internal successors, (4031), 2797 states have internal predecessors, (4031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2798 states to 2798 states and 4031 transitions. [2025-03-03 17:36:21,801 INFO L78 Accepts]: Start accepts. Automaton has 2798 states and 4031 transitions. Word has length 231 [2025-03-03 17:36:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:21,801 INFO L471 AbstractCegarLoop]: Abstraction has 2798 states and 4031 transitions. [2025-03-03 17:36:21,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 2798 states and 4031 transitions. [2025-03-03 17:36:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 17:36:21,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:21,804 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] [2025-03-03 17:36:21,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-03 17:36:21,804 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:21,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:21,804 INFO L85 PathProgramCache]: Analyzing trace with hash 639282176, now seen corresponding path program 1 times [2025-03-03 17:36:21,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:21,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813321869] [2025-03-03 17:36:21,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:21,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:21,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 17:36:21,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 17:36:21,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:21,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:22,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-03 17:36:22,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:22,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813321869] [2025-03-03 17:36:22,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813321869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:22,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:22,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:22,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886471703] [2025-03-03 17:36:22,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:22,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:22,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:22,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:22,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:22,174 INFO L87 Difference]: Start difference. First operand 2798 states and 4031 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:22,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:22,531 INFO L93 Difference]: Finished difference Result 4930 states and 7120 transitions. [2025-03-03 17:36:22,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:22,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 17:36:22,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:22,534 INFO L225 Difference]: With dead ends: 4930 [2025-03-03 17:36:22,534 INFO L226 Difference]: Without dead ends: 2796 [2025-03-03 17:36:22,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:22,536 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:22,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2796 states. [2025-03-03 17:36:22,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2796 to 2796. [2025-03-03 17:36:22,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2796 states, 2795 states have (on average 1.4407871198568873) internal successors, (4027), 2795 states have internal predecessors, (4027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:22,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2796 states to 2796 states and 4027 transitions. [2025-03-03 17:36:22,554 INFO L78 Accepts]: Start accepts. Automaton has 2796 states and 4027 transitions. Word has length 232 [2025-03-03 17:36:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:22,554 INFO L471 AbstractCegarLoop]: Abstraction has 2796 states and 4027 transitions. [2025-03-03 17:36:22,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 2796 states and 4027 transitions. [2025-03-03 17:36:22,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 17:36:22,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:22,556 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] [2025-03-03 17:36:22,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-03 17:36:22,557 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:22,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash -260925413, now seen corresponding path program 1 times [2025-03-03 17:36:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485219814] [2025-03-03 17:36:22,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:22,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 17:36:22,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 17:36:22,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:22,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:23,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:23,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:23,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485219814] [2025-03-03 17:36:23,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485219814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:23,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:23,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-03 17:36:23,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223476655] [2025-03-03 17:36:23,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:23,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-03 17:36:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:23,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-03 17:36:23,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:23,413 INFO L87 Difference]: Start difference. First operand 2796 states and 4027 transitions. Second operand has 10 states, 10 states have (on average 23.2) internal successors, (232), 10 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:24,483 INFO L93 Difference]: Finished difference Result 4938 states and 7130 transitions. [2025-03-03 17:36:24,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:36:24,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 23.2) internal successors, (232), 10 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 17:36:24,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:24,485 INFO L225 Difference]: With dead ends: 4938 [2025-03-03 17:36:24,485 INFO L226 Difference]: Without dead ends: 2806 [2025-03-03 17:36:24,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 17:36:24,487 INFO L435 NwaCegarLoop]: 1224 mSDtfsCounter, 1498 mSDsluCounter, 7313 mSDsCounter, 0 mSdLazyCounter, 3254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1498 SdHoareTripleChecker+Valid, 8537 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:24,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1498 Valid, 8537 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3254 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:36:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2025-03-03 17:36:24,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2802. [2025-03-03 17:36:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2802 states, 2801 states have (on average 1.4405569439485897) internal successors, (4035), 2801 states have internal predecessors, (4035), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2802 states to 2802 states and 4035 transitions. [2025-03-03 17:36:24,503 INFO L78 Accepts]: Start accepts. Automaton has 2802 states and 4035 transitions. Word has length 232 [2025-03-03 17:36:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:24,503 INFO L471 AbstractCegarLoop]: Abstraction has 2802 states and 4035 transitions. [2025-03-03 17:36:24,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.2) internal successors, (232), 10 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2802 states and 4035 transitions. [2025-03-03 17:36:24,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 17:36:24,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:24,505 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] [2025-03-03 17:36:24,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-03 17:36:24,505 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1554046845, now seen corresponding path program 1 times [2025-03-03 17:36:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:24,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180520974] [2025-03-03 17:36:24,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:24,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 17:36:24,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 17:36:24,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:24,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:25,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:25,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:25,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180520974] [2025-03-03 17:36:25,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180520974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:25,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-03 17:36:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130427693] [2025-03-03 17:36:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 17:36:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:25,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 17:36:25,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-03-03 17:36:25,269 INFO L87 Difference]: Start difference. First operand 2802 states and 4035 transitions. Second operand has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:26,368 INFO L93 Difference]: Finished difference Result 5086 states and 7336 transitions. [2025-03-03 17:36:26,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 17:36:26,368 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 17:36:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:26,370 INFO L225 Difference]: With dead ends: 5086 [2025-03-03 17:36:26,370 INFO L226 Difference]: Without dead ends: 2948 [2025-03-03 17:36:26,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2025-03-03 17:36:26,372 INFO L435 NwaCegarLoop]: 1393 mSDtfsCounter, 1584 mSDsluCounter, 13898 mSDsCounter, 0 mSdLazyCounter, 3275 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1584 SdHoareTripleChecker+Valid, 15291 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:26,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1584 Valid, 15291 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3275 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 17:36:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2948 states. [2025-03-03 17:36:26,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2948 to 2944. [2025-03-03 17:36:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2943 states have (on average 1.436969079170914) internal successors, (4229), 2943 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4229 transitions. [2025-03-03 17:36:26,389 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4229 transitions. Word has length 232 [2025-03-03 17:36:26,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:26,389 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 4229 transitions. [2025-03-03 17:36:26,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 17.846153846153847) internal successors, (232), 13 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4229 transitions. [2025-03-03 17:36:26,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 17:36:26,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:26,391 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] [2025-03-03 17:36:26,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-03 17:36:26,391 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:26,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:26,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1494846412, now seen corresponding path program 1 times [2025-03-03 17:36:26,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:26,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217687177] [2025-03-03 17:36:26,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:26,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:26,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 17:36:26,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 17:36:26,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:26,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:26,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:26,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217687177] [2025-03-03 17:36:26,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217687177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:26,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:26,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:26,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814918572] [2025-03-03 17:36:26,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:26,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:26,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:26,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:26,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:26,774 INFO L87 Difference]: Start difference. First operand 2944 states and 4229 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:27,085 INFO L93 Difference]: Finished difference Result 5216 states and 7510 transitions. [2025-03-03 17:36:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 17:36:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:27,087 INFO L225 Difference]: With dead ends: 5216 [2025-03-03 17:36:27,087 INFO L226 Difference]: Without dead ends: 2936 [2025-03-03 17:36:27,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:27,089 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:27,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:27,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2936 states. [2025-03-03 17:36:27,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2936. [2025-03-03 17:36:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2936 states, 2935 states have (on average 1.435434412265758) internal successors, (4213), 2935 states have internal predecessors, (4213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:27,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4213 transitions. [2025-03-03 17:36:27,108 INFO L78 Accepts]: Start accepts. Automaton has 2936 states and 4213 transitions. Word has length 232 [2025-03-03 17:36:27,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:27,108 INFO L471 AbstractCegarLoop]: Abstraction has 2936 states and 4213 transitions. [2025-03-03 17:36:27,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2936 states and 4213 transitions. [2025-03-03 17:36:27,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 17:36:27,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:27,110 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] [2025-03-03 17:36:27,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-03 17:36:27,110 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:27,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:27,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1272952682, now seen corresponding path program 1 times [2025-03-03 17:36:27,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:27,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701700666] [2025-03-03 17:36:27,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:27,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 17:36:27,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 17:36:27,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:27,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:27,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:27,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:27,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701700666] [2025-03-03 17:36:27,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701700666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:27,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:27,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547421549] [2025-03-03 17:36:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:27,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:27,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:27,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:27,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:27,361 INFO L87 Difference]: Start difference. First operand 2936 states and 4213 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:27,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:27,851 INFO L93 Difference]: Finished difference Result 7973 states and 11442 transitions. [2025-03-03 17:36:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:27,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 17:36:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:27,858 INFO L225 Difference]: With dead ends: 7973 [2025-03-03 17:36:27,858 INFO L226 Difference]: Without dead ends: 5701 [2025-03-03 17:36:27,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:27,861 INFO L435 NwaCegarLoop]: 1394 mSDtfsCounter, 1432 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:27,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2025-03-03 17:36:27,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 4891. [2025-03-03 17:36:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4891 states, 4890 states have (on average 1.4282208588957055) internal successors, (6984), 4890 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:27,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4891 states to 4891 states and 6984 transitions. [2025-03-03 17:36:27,905 INFO L78 Accepts]: Start accepts. Automaton has 4891 states and 6984 transitions. Word has length 232 [2025-03-03 17:36:27,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:27,906 INFO L471 AbstractCegarLoop]: Abstraction has 4891 states and 6984 transitions. [2025-03-03 17:36:27,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:27,906 INFO L276 IsEmpty]: Start isEmpty. Operand 4891 states and 6984 transitions. [2025-03-03 17:36:27,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 17:36:27,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:27,909 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] [2025-03-03 17:36:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-03 17:36:27,910 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:27,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:27,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1560275993, now seen corresponding path program 1 times [2025-03-03 17:36:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382476250] [2025-03-03 17:36:27,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:27,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 17:36:27,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 17:36:27,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:27,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:28,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:28,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382476250] [2025-03-03 17:36:28,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382476250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:28,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:28,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350336439] [2025-03-03 17:36:28,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:28,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:28,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:28,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:28,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:28,193 INFO L87 Difference]: Start difference. First operand 4891 states and 6984 transitions. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:28,664 INFO L93 Difference]: Finished difference Result 7959 states and 11412 transitions. [2025-03-03 17:36:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:36:28,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 17:36:28,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:28,669 INFO L225 Difference]: With dead ends: 7959 [2025-03-03 17:36:28,669 INFO L226 Difference]: Without dead ends: 5623 [2025-03-03 17:36:28,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:36:28,671 INFO L435 NwaCegarLoop]: 1394 mSDtfsCounter, 1424 mSDsluCounter, 4173 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1424 SdHoareTripleChecker+Valid, 5567 SdHoareTripleChecker+Invalid, 1184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:28,671 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1424 Valid, 5567 Invalid, 1184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 17:36:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5623 states. [2025-03-03 17:36:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5623 to 4843. [2025-03-03 17:36:28,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4842 states have (on average 1.4275092936802973) internal successors, (6912), 4842 states have internal predecessors, (6912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 6912 transitions. [2025-03-03 17:36:28,700 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 6912 transitions. Word has length 232 [2025-03-03 17:36:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:28,700 INFO L471 AbstractCegarLoop]: Abstraction has 4843 states and 6912 transitions. [2025-03-03 17:36:28,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 6912 transitions. [2025-03-03 17:36:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-03 17:36:28,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:28,703 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] [2025-03-03 17:36:28,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-03 17:36:28,703 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:28,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1959772520, now seen corresponding path program 1 times [2025-03-03 17:36:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:28,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463786321] [2025-03-03 17:36:28,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:28,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-03 17:36:28,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-03 17:36:28,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:28,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:28,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:28,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463786321] [2025-03-03 17:36:28,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463786321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:28,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:28,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:36:28,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460043003] [2025-03-03 17:36:28,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:36:28,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:28,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:36:28,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:28,938 INFO L87 Difference]: Start difference. First operand 4843 states and 6912 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:29,239 INFO L93 Difference]: Finished difference Result 9003 states and 12808 transitions. [2025-03-03 17:36:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:29,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 232 [2025-03-03 17:36:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:29,243 INFO L225 Difference]: With dead ends: 9003 [2025-03-03 17:36:29,243 INFO L226 Difference]: Without dead ends: 4855 [2025-03-03 17:36:29,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:36:29,246 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:29,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 847 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4855 states. [2025-03-03 17:36:29,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4855 to 4855. [2025-03-03 17:36:29,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4855 states, 4854 states have (on average 1.426452410383189) internal successors, (6924), 4854 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-03 17:36:29,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4855 states to 4855 states and 6924 transitions. [2025-03-03 17:36:29,275 INFO L78 Accepts]: Start accepts. Automaton has 4855 states and 6924 transitions. Word has length 232 [2025-03-03 17:36:29,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:29,275 INFO L471 AbstractCegarLoop]: Abstraction has 4855 states and 6924 transitions. [2025-03-03 17:36:29,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:29,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4855 states and 6924 transitions. [2025-03-03 17:36:29,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 17:36:29,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:29,278 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] [2025-03-03 17:36:29,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-03 17:36:29,278 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:29,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:29,279 INFO L85 PathProgramCache]: Analyzing trace with hash 756727050, now seen corresponding path program 1 times [2025-03-03 17:36:29,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:29,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719134911] [2025-03-03 17:36:29,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:29,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:29,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 17:36:29,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 17:36:29,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:29,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:36:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:36:29,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:36:29,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719134911] [2025-03-03 17:36:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719134911] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:36:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:36:29,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:36:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612958411] [2025-03-03 17:36:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:36:29,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:36:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:36:29,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:36:29,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:29,536 INFO L87 Difference]: Start difference. First operand 4855 states and 6924 transitions. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:29,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:36:29,842 INFO L93 Difference]: Finished difference Result 9047 states and 12862 transitions. [2025-03-03 17:36:29,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:36:29,842 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 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 233 [2025-03-03 17:36:29,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:36:29,847 INFO L225 Difference]: With dead ends: 9047 [2025-03-03 17:36:29,847 INFO L226 Difference]: Without dead ends: 4867 [2025-03-03 17:36:29,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:36:29,850 INFO L435 NwaCegarLoop]: 1408 mSDtfsCounter, 0 mSDsluCounter, 2808 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 17:36:29,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4216 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 17:36:29,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4867 states. [2025-03-03 17:36:29,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4867 to 4867. [2025-03-03 17:36:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4867 states, 4866 states have (on average 1.4254007398273736) internal successors, (6936), 4866 states have internal predecessors, (6936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4867 states to 4867 states and 6936 transitions. [2025-03-03 17:36:29,902 INFO L78 Accepts]: Start accepts. Automaton has 4867 states and 6936 transitions. Word has length 233 [2025-03-03 17:36:29,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:36:29,902 INFO L471 AbstractCegarLoop]: Abstraction has 4867 states and 6936 transitions. [2025-03-03 17:36:29,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:36:29,902 INFO L276 IsEmpty]: Start isEmpty. Operand 4867 states and 6936 transitions. [2025-03-03 17:36:29,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-03 17:36:29,906 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:36:29,906 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] [2025-03-03 17:36:29,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-03-03 17:36:29,906 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:36:29,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:36:29,906 INFO L85 PathProgramCache]: Analyzing trace with hash 156771007, now seen corresponding path program 1 times [2025-03-03 17:36:29,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:36:29,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632994282] [2025-03-03 17:36:29,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:36:29,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:36:29,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-03 17:36:30,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-03 17:36:30,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:36:30,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat