./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/psyco/psyco_net_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/psyco/psyco_net_1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:26:01,500 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:26:01,553 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:26:01,556 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:26:01,558 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:26:01,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:26:01,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:26:01,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:26:01,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:26:01,576 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:26:01,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:26:01,576 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:26:01,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:26:01,576 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:26:01,576 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:26:01,577 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:26:01,577 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:26:01,577 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:26:01,577 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:26:01,578 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:26:01,578 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:26:01,578 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:26:01,579 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:26:01,579 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:26:01,579 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:26:01,580 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de2f4457e683c9057510f44fdcfcada297661f8afdeccfe707ab5df57f434b62 [2025-03-08 02:26:01,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:26:01,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:26:01,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:26:01,805 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:26:01,805 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:26:01,806 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_net_1.c [2025-03-08 02:26:02,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb81750c0/ff8b99b10b86471cac5f0d7069efcc45/FLAG048238b08 [2025-03-08 02:26:03,707 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:26:03,708 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_net_1.c [2025-03-08 02:26:03,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb81750c0/ff8b99b10b86471cac5f0d7069efcc45/FLAG048238b08 [2025-03-08 02:26:04,017 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bb81750c0/ff8b99b10b86471cac5f0d7069efcc45 [2025-03-08 02:26:04,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:26:04,021 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:26:04,021 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:26:04,022 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:26:04,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:26:04,025 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:04" (1/1) ... [2025-03-08 02:26:04,026 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54d984a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:04, skipping insertion in model container [2025-03-08 02:26:04,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:26:04" (1/1) ... [2025-03-08 02:26:04,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:26:05,143 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/psyco/psyco_net_1.c[2349407,2349420] [2025-03-08 02:26:05,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:26:05,213 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:26:05,728 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/psyco/psyco_net_1.c[2349407,2349420] [2025-03-08 02:26:05,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:26:05,773 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:26:05,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05 WrapperNode [2025-03-08 02:26:05,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:26:05,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:26:05,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:26:05,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:26:05,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:05,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,421 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 53156 [2025-03-08 02:26:06,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:26:06,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:26:06,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:26:06,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:26:06,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,681 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 02:26:06,681 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,881 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,916 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:06,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:07,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:07,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:26:07,114 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:26:07,114 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:26:07,115 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:26:07,115 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (1/1) ... [2025-03-08 02:26:07,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:26:07,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:26:07,141 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 02:26:07,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 02:26:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:26:07,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:26:07,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:26:07,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:26:07,671 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:26:07,672 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:26:19,291 INFO L? ?]: Removed 10714 outVars from TransFormulas that were not future-live. [2025-03-08 02:26:19,292 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:26:19,402 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:26:19,402 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:26:19,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:19 BoogieIcfgContainer [2025-03-08 02:26:19,402 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:26:19,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:26:19,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:26:19,411 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:26:19,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:26:04" (1/3) ... [2025-03-08 02:26:19,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c879279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:19, skipping insertion in model container [2025-03-08 02:26:19,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:26:05" (2/3) ... [2025-03-08 02:26:19,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c879279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:26:19, skipping insertion in model container [2025-03-08 02:26:19,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:26:19" (3/3) ... [2025-03-08 02:26:19,412 INFO L128 eAbstractionObserver]: Analyzing ICFG psyco_net_1.c [2025-03-08 02:26:19,425 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:26:19,428 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG psyco_net_1.c that has 1 procedures, 9210 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:26:19,586 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:26:19,595 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;@26777d61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:26:19,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:26:19,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 9210 states, 9208 states have (on average 1.999456993918332) internal successors, (18411), 9209 states have internal predecessors, (18411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-08 02:26:19,624 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:19,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:19,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:19,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:19,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1875770170, now seen corresponding path program 1 times [2025-03-08 02:26:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:19,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647538153] [2025-03-08 02:26:19,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:19,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:19,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-08 02:26:19,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-08 02:26:19,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:19,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:19,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-08 02:26:19,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:19,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647538153] [2025-03-08 02:26:19,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647538153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:19,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:19,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:26:19,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55527720] [2025-03-08 02:26:19,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:19,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 02:26:19,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:19,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 02:26:19,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 02:26:19,859 INFO L87 Difference]: Start difference. First operand has 9210 states, 9208 states have (on average 1.999456993918332) internal successors, (18411), 9209 states have internal predecessors, (18411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:20,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:20,080 INFO L93 Difference]: Finished difference Result 17696 states and 35376 transitions. [2025-03-08 02:26:20,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 02:26:20,081 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-03-08 02:26:20,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:20,127 INFO L225 Difference]: With dead ends: 17696 [2025-03-08 02:26:20,127 INFO L226 Difference]: Without dead ends: 8279 [2025-03-08 02:26:20,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 02:26:20,145 INFO L435 NwaCegarLoop]: 14146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14146 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:20,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14146 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 02:26:20,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8279 states. [2025-03-08 02:26:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8279 to 8279. [2025-03-08 02:26:20,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8279 states, 8278 states have (on average 1.5699444310219859) internal successors, (12996), 8278 states have internal predecessors, (12996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8279 states to 8279 states and 12996 transitions. [2025-03-08 02:26:20,367 INFO L78 Accepts]: Start accepts. Automaton has 8279 states and 12996 transitions. Word has length 8 [2025-03-08 02:26:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 8279 states and 12996 transitions. [2025-03-08 02:26:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 8279 states and 12996 transitions. [2025-03-08 02:26:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-08 02:26:20,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:20,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:20,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:26:20,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1961428055, now seen corresponding path program 1 times [2025-03-08 02:26:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963361748] [2025-03-08 02:26:20,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:20,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:20,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-08 02:26:20,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-08 02:26:20,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:20,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:20,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:20,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963361748] [2025-03-08 02:26:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963361748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80360811] [2025-03-08 02:26:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:20,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:20,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:20,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:20,509 INFO L87 Difference]: Start difference. First operand 8279 states and 12996 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:21,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:21,856 INFO L93 Difference]: Finished difference Result 16558 states and 25993 transitions. [2025-03-08 02:26:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:21,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-08 02:26:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:21,882 INFO L225 Difference]: With dead ends: 16558 [2025-03-08 02:26:21,883 INFO L226 Difference]: Without dead ends: 8281 [2025-03-08 02:26:21,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:21,894 INFO L435 NwaCegarLoop]: 12995 mSDtfsCounter, 4 mSDsluCounter, 11519 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 24514 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:21,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 24514 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:26:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8281 states. [2025-03-08 02:26:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8281 to 8281. [2025-03-08 02:26:22,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8281 states, 8280 states have (on average 1.569806763285024) internal successors, (12998), 8280 states have internal predecessors, (12998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:22,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8281 states to 8281 states and 12998 transitions. [2025-03-08 02:26:22,030 INFO L78 Accepts]: Start accepts. Automaton has 8281 states and 12998 transitions. Word has length 9 [2025-03-08 02:26:22,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:22,030 INFO L471 AbstractCegarLoop]: Abstraction has 8281 states and 12998 transitions. [2025-03-08 02:26:22,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:22,031 INFO L276 IsEmpty]: Start isEmpty. Operand 8281 states and 12998 transitions. [2025-03-08 02:26:22,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 02:26:22,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:22,031 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:22,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:26:22,032 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:22,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:22,034 INFO L85 PathProgramCache]: Analyzing trace with hash -249500577, now seen corresponding path program 1 times [2025-03-08 02:26:22,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:22,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540941796] [2025-03-08 02:26:22,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:22,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:22,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 02:26:22,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 02:26:22,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:22,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540941796] [2025-03-08 02:26:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540941796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:22,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097490515] [2025-03-08 02:26:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:22,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:22,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:22,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:22,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:22,176 INFO L87 Difference]: Start difference. First operand 8281 states and 12998 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:23,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:23,415 INFO L93 Difference]: Finished difference Result 16566 states and 26002 transitions. [2025-03-08 02:26:23,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:23,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2025-03-08 02:26:23,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:23,442 INFO L225 Difference]: With dead ends: 16566 [2025-03-08 02:26:23,442 INFO L226 Difference]: Without dead ends: 8287 [2025-03-08 02:26:23,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:23,452 INFO L435 NwaCegarLoop]: 12994 mSDtfsCounter, 329 mSDsluCounter, 11196 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 24190 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:23,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 24190 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:26:23,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8287 states. [2025-03-08 02:26:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8287 to 8285. [2025-03-08 02:26:23,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8285 states, 8284 states have (on average 1.5695316272332207) internal successors, (13002), 8284 states have internal predecessors, (13002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8285 states to 8285 states and 13002 transitions. [2025-03-08 02:26:23,559 INFO L78 Accepts]: Start accepts. Automaton has 8285 states and 13002 transitions. Word has length 14 [2025-03-08 02:26:23,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:23,560 INFO L471 AbstractCegarLoop]: Abstraction has 8285 states and 13002 transitions. [2025-03-08 02:26:23,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 8285 states and 13002 transitions. [2025-03-08 02:26:23,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 02:26:23,560 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:23,560 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:23,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:26:23,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:23,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:23,561 INFO L85 PathProgramCache]: Analyzing trace with hash 427054560, now seen corresponding path program 1 times [2025-03-08 02:26:23,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:23,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316986892] [2025-03-08 02:26:23,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:23,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:23,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 02:26:23,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 02:26:23,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:23,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316986892] [2025-03-08 02:26:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316986892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:23,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:23,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:23,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185743788] [2025-03-08 02:26:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:23,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:23,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:23,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:23,645 INFO L87 Difference]: Start difference. First operand 8285 states and 13002 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:25,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:25,898 INFO L93 Difference]: Finished difference Result 16490 states and 25883 transitions. [2025-03-08 02:26:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:25,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2025-03-08 02:26:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:25,911 INFO L225 Difference]: With dead ends: 16490 [2025-03-08 02:26:25,911 INFO L226 Difference]: Without dead ends: 8165 [2025-03-08 02:26:25,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:25,918 INFO L435 NwaCegarLoop]: 9997 mSDtfsCounter, 10369 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 3164 mSolverCounterSat, 1749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10369 SdHoareTripleChecker+Valid, 9999 SdHoareTripleChecker+Invalid, 4913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1749 IncrementalHoareTripleChecker+Valid, 3164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:25,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10369 Valid, 9999 Invalid, 4913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1749 Valid, 3164 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:26:25,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8165 states. [2025-03-08 02:26:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8165 to 8163. [2025-03-08 02:26:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8163 states, 8162 states have (on average 1.5166625827003186) internal successors, (12379), 8162 states have internal predecessors, (12379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 12379 transitions. [2025-03-08 02:26:26,012 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 12379 transitions. Word has length 18 [2025-03-08 02:26:26,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:26,012 INFO L471 AbstractCegarLoop]: Abstraction has 8163 states and 12379 transitions. [2025-03-08 02:26:26,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:26,013 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 12379 transitions. [2025-03-08 02:26:26,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 02:26:26,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:26,013 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:26,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:26:26,013 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:26,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:26,014 INFO L85 PathProgramCache]: Analyzing trace with hash 212807032, now seen corresponding path program 1 times [2025-03-08 02:26:26,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:26,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880031421] [2025-03-08 02:26:26,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:26,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:26,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 02:26:26,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 02:26:26,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:26,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:26,093 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:26,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:26,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880031421] [2025-03-08 02:26:26,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880031421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:26,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:26,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:26,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526827501] [2025-03-08 02:26:26,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:26,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:26,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:26,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:26,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:26,094 INFO L87 Difference]: Start difference. First operand 8163 states and 12379 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:28,163 INFO L93 Difference]: Finished difference Result 24485 states and 37133 transitions. [2025-03-08 02:26:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2025-03-08 02:26:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:28,192 INFO L225 Difference]: With dead ends: 24485 [2025-03-08 02:26:28,192 INFO L226 Difference]: Without dead ends: 16274 [2025-03-08 02:26:28,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:28,203 INFO L435 NwaCegarLoop]: 10923 mSDtfsCounter, 10930 mSDsluCounter, 10880 mSDsCounter, 0 mSdLazyCounter, 2893 mSolverCounterSat, 1345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10930 SdHoareTripleChecker+Valid, 21803 SdHoareTripleChecker+Invalid, 4238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1345 IncrementalHoareTripleChecker+Valid, 2893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:28,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10930 Valid, 21803 Invalid, 4238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1345 Valid, 2893 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-08 02:26:28,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16274 states. [2025-03-08 02:26:28,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16274 to 14960. [2025-03-08 02:26:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14960 states, 14959 states have (on average 1.55672170599639) internal successors, (23287), 14959 states have internal predecessors, (23287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14960 states to 14960 states and 23287 transitions. [2025-03-08 02:26:28,378 INFO L78 Accepts]: Start accepts. Automaton has 14960 states and 23287 transitions. Word has length 22 [2025-03-08 02:26:28,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:28,378 INFO L471 AbstractCegarLoop]: Abstraction has 14960 states and 23287 transitions. [2025-03-08 02:26:28,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 14960 states and 23287 transitions. [2025-03-08 02:26:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 02:26:28,380 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:28,380 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:28,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:26:28,380 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:28,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:28,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1565759164, now seen corresponding path program 1 times [2025-03-08 02:26:28,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:28,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904925454] [2025-03-08 02:26:28,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:28,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:28,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 02:26:28,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 02:26:28,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:28,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:28,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:28,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904925454] [2025-03-08 02:26:28,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904925454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:28,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:28,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:28,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633197871] [2025-03-08 02:26:28,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:28,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:28,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:28,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:28,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:28,483 INFO L87 Difference]: Start difference. First operand 14960 states and 23287 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:31,774 INFO L93 Difference]: Finished difference Result 37757 states and 58554 transitions. [2025-03-08 02:26:31,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:31,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-03-08 02:26:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:31,801 INFO L225 Difference]: With dead ends: 37757 [2025-03-08 02:26:31,802 INFO L226 Difference]: Without dead ends: 22517 [2025-03-08 02:26:31,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:31,817 INFO L435 NwaCegarLoop]: 10502 mSDtfsCounter, 10111 mSDsluCounter, 9628 mSDsCounter, 0 mSdLazyCounter, 4519 mSolverCounterSat, 1455 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10111 SdHoareTripleChecker+Valid, 20130 SdHoareTripleChecker+Invalid, 5974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1455 IncrementalHoareTripleChecker+Valid, 4519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:31,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10111 Valid, 20130 Invalid, 5974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1455 Valid, 4519 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-03-08 02:26:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22517 states. [2025-03-08 02:26:32,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22517 to 21277. [2025-03-08 02:26:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21277 states, 21276 states have (on average 1.551983455536755) internal successors, (33020), 21276 states have internal predecessors, (33020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:32,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 33020 transitions. [2025-03-08 02:26:32,053 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 33020 transitions. Word has length 24 [2025-03-08 02:26:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:32,053 INFO L471 AbstractCegarLoop]: Abstraction has 21277 states and 33020 transitions. [2025-03-08 02:26:32,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:32,053 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 33020 transitions. [2025-03-08 02:26:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 02:26:32,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:32,057 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:32,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:26:32,057 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:32,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:32,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1695930426, now seen corresponding path program 1 times [2025-03-08 02:26:32,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:32,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585017962] [2025-03-08 02:26:32,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:32,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:32,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 02:26:32,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 02:26:32,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:32,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:32,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:32,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:32,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585017962] [2025-03-08 02:26:32,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585017962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:32,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:32,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:32,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510327967] [2025-03-08 02:26:32,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:32,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:32,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:32,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:32,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:32,160 INFO L87 Difference]: Start difference. First operand 21277 states and 33020 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:36,016 INFO L93 Difference]: Finished difference Result 63797 states and 98996 transitions. [2025-03-08 02:26:36,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:36,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2025-03-08 02:26:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:36,095 INFO L225 Difference]: With dead ends: 63797 [2025-03-08 02:26:36,095 INFO L226 Difference]: Without dead ends: 42522 [2025-03-08 02:26:36,121 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:36,122 INFO L435 NwaCegarLoop]: 21589 mSDtfsCounter, 10225 mSDsluCounter, 9572 mSDsCounter, 0 mSdLazyCounter, 6371 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10225 SdHoareTripleChecker+Valid, 31161 SdHoareTripleChecker+Invalid, 7519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 6371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:36,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10225 Valid, 31161 Invalid, 7519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 6371 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 02:26:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42522 states. [2025-03-08 02:26:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42522 to 40438. [2025-03-08 02:26:36,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40438 states, 40437 states have (on average 1.5747459010312337) internal successors, (63678), 40437 states have internal predecessors, (63678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:36,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40438 states to 40438 states and 63678 transitions. [2025-03-08 02:26:36,730 INFO L78 Accepts]: Start accepts. Automaton has 40438 states and 63678 transitions. Word has length 29 [2025-03-08 02:26:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:36,730 INFO L471 AbstractCegarLoop]: Abstraction has 40438 states and 63678 transitions. [2025-03-08 02:26:36,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 40438 states and 63678 transitions. [2025-03-08 02:26:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-08 02:26:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:36,732 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:26:36,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:36,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:36,733 INFO L85 PathProgramCache]: Analyzing trace with hash -682328085, now seen corresponding path program 1 times [2025-03-08 02:26:36,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:36,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183182277] [2025-03-08 02:26:36,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:36,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:36,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 02:26:36,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 02:26:36,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:36,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:36,859 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 02:26:36,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:36,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183182277] [2025-03-08 02:26:36,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183182277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:36,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:36,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:36,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495847084] [2025-03-08 02:26:36,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:36,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:36,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:36,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:36,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:36,861 INFO L87 Difference]: Start difference. First operand 40438 states and 63678 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:37,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:37,966 INFO L93 Difference]: Finished difference Result 80906 states and 127409 transitions. [2025-03-08 02:26:37,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:37,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 35 [2025-03-08 02:26:37,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:38,022 INFO L225 Difference]: With dead ends: 80906 [2025-03-08 02:26:38,022 INFO L226 Difference]: Without dead ends: 40470 [2025-03-08 02:26:38,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:38,056 INFO L435 NwaCegarLoop]: 12341 mSDtfsCounter, 305 mSDsluCounter, 10698 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 23039 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:38,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 23039 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:26:38,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40470 states. [2025-03-08 02:26:38,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40470 to 40468. [2025-03-08 02:26:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40468 states, 40467 states have (on average 1.5743198161464897) internal successors, (63708), 40467 states have internal predecessors, (63708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:38,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40468 states to 40468 states and 63708 transitions. [2025-03-08 02:26:38,703 INFO L78 Accepts]: Start accepts. Automaton has 40468 states and 63708 transitions. Word has length 35 [2025-03-08 02:26:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:38,704 INFO L471 AbstractCegarLoop]: Abstraction has 40468 states and 63708 transitions. [2025-03-08 02:26:38,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 40468 states and 63708 transitions. [2025-03-08 02:26:38,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 02:26:38,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:38,705 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:38,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:26:38,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:38,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:38,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1277850664, now seen corresponding path program 1 times [2025-03-08 02:26:38,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:38,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164451548] [2025-03-08 02:26:38,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:38,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:38,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 02:26:38,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 02:26:38,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:38,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:38,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:38,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:38,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164451548] [2025-03-08 02:26:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164451548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:38,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537501618] [2025-03-08 02:26:38,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:38,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:38,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:38,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:38,775 INFO L87 Difference]: Start difference. First operand 40468 states and 63708 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:41,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:41,569 INFO L93 Difference]: Finished difference Result 109006 states and 171816 transitions. [2025-03-08 02:26:41,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:41,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-08 02:26:41,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:41,669 INFO L225 Difference]: With dead ends: 109006 [2025-03-08 02:26:41,669 INFO L226 Difference]: Without dead ends: 68490 [2025-03-08 02:26:41,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:41,703 INFO L435 NwaCegarLoop]: 10923 mSDtfsCounter, 10914 mSDsluCounter, 10880 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 1313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10914 SdHoareTripleChecker+Valid, 21803 SdHoareTripleChecker+Invalid, 4142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:41,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10914 Valid, 21803 Invalid, 4142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1313 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-08 02:26:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68490 states. [2025-03-08 02:26:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68490 to 66760. [2025-03-08 02:26:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66760 states, 66759 states have (on average 1.5852244641171978) internal successors, (105828), 66759 states have internal predecessors, (105828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66760 states to 66760 states and 105828 transitions. [2025-03-08 02:26:42,606 INFO L78 Accepts]: Start accepts. Automaton has 66760 states and 105828 transitions. Word has length 38 [2025-03-08 02:26:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:42,606 INFO L471 AbstractCegarLoop]: Abstraction has 66760 states and 105828 transitions. [2025-03-08 02:26:42,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 66760 states and 105828 transitions. [2025-03-08 02:26:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-08 02:26:42,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:42,607 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:26:42,607 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:42,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:42,607 INFO L85 PathProgramCache]: Analyzing trace with hash 680089831, now seen corresponding path program 1 times [2025-03-08 02:26:42,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:42,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784848795] [2025-03-08 02:26:42,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:42,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:42,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 02:26:42,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 02:26:42,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:42,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 02:26:42,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:42,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784848795] [2025-03-08 02:26:42,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784848795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:42,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:42,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:42,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901464240] [2025-03-08 02:26:42,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:42,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:42,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:42,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:42,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:42,690 INFO L87 Difference]: Start difference. First operand 66760 states and 105828 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:44,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:44,033 INFO L93 Difference]: Finished difference Result 129306 states and 204959 transitions. [2025-03-08 02:26:44,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:44,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 45 [2025-03-08 02:26:44,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:44,108 INFO L225 Difference]: With dead ends: 129306 [2025-03-08 02:26:44,108 INFO L226 Difference]: Without dead ends: 62548 [2025-03-08 02:26:44,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:44,148 INFO L435 NwaCegarLoop]: 12045 mSDtfsCounter, 10322 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10322 SdHoareTripleChecker+Valid, 12595 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1190 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:44,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10322 Valid, 12595 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1190 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:26:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62548 states. [2025-03-08 02:26:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62548 to 62546. [2025-03-08 02:26:44,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62546 states, 62545 states have (on average 1.5843312814773363) internal successors, (99092), 62545 states have internal predecessors, (99092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:44,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62546 states to 62546 states and 99092 transitions. [2025-03-08 02:26:44,825 INFO L78 Accepts]: Start accepts. Automaton has 62546 states and 99092 transitions. Word has length 45 [2025-03-08 02:26:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:44,825 INFO L471 AbstractCegarLoop]: Abstraction has 62546 states and 99092 transitions. [2025-03-08 02:26:44,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 62546 states and 99092 transitions. [2025-03-08 02:26:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 02:26:44,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:44,826 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:44,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:26:44,826 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash -556627736, now seen corresponding path program 1 times [2025-03-08 02:26:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422800000] [2025-03-08 02:26:44,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:44,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 02:26:44,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 02:26:44,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:44,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:44,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:44,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422800000] [2025-03-08 02:26:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422800000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:44,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:44,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:26:44,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451502690] [2025-03-08 02:26:44,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:44,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:26:44,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:44,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:26:44,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:26:44,991 INFO L87 Difference]: Start difference. First operand 62546 states and 99092 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:49,002 INFO L93 Difference]: Finished difference Result 119594 states and 189327 transitions. [2025-03-08 02:26:49,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:26:49,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-08 02:26:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:49,077 INFO L225 Difference]: With dead ends: 119594 [2025-03-08 02:26:49,077 INFO L226 Difference]: Without dead ends: 62782 [2025-03-08 02:26:49,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:26:49,113 INFO L435 NwaCegarLoop]: 9460 mSDtfsCounter, 29493 mSDsluCounter, 9230 mSDsCounter, 0 mSdLazyCounter, 4141 mSolverCounterSat, 3486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29493 SdHoareTripleChecker+Valid, 18690 SdHoareTripleChecker+Invalid, 7627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3486 IncrementalHoareTripleChecker+Valid, 4141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:49,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29493 Valid, 18690 Invalid, 7627 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3486 Valid, 4141 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-03-08 02:26:49,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62782 states. [2025-03-08 02:26:49,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62782 to 60384. [2025-03-08 02:26:49,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60384 states, 60383 states have (on average 1.5628405345875496) internal successors, (94369), 60383 states have internal predecessors, (94369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:49,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60384 states to 60384 states and 94369 transitions. [2025-03-08 02:26:49,893 INFO L78 Accepts]: Start accepts. Automaton has 60384 states and 94369 transitions. Word has length 51 [2025-03-08 02:26:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:49,893 INFO L471 AbstractCegarLoop]: Abstraction has 60384 states and 94369 transitions. [2025-03-08 02:26:49,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:49,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60384 states and 94369 transitions. [2025-03-08 02:26:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-08 02:26:49,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:49,894 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:26:49,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1930207592, now seen corresponding path program 1 times [2025-03-08 02:26:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19269053] [2025-03-08 02:26:49,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:49,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-08 02:26:49,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-08 02:26:49,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:49,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 02:26:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19269053] [2025-03-08 02:26:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19269053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189513747] [2025-03-08 02:26:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:49,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:49,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:49,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:49,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:49,971 INFO L87 Difference]: Start difference. First operand 60384 states and 94369 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:51,234 INFO L93 Difference]: Finished difference Result 120411 states and 188172 transitions. [2025-03-08 02:26:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:51,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 52 [2025-03-08 02:26:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:51,318 INFO L225 Difference]: With dead ends: 120411 [2025-03-08 02:26:51,318 INFO L226 Difference]: Without dead ends: 60446 [2025-03-08 02:26:51,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:51,362 INFO L435 NwaCegarLoop]: 11636 mSDtfsCounter, 277 mSDsluCounter, 10273 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 21909 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:51,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 21909 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:26:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60446 states. [2025-03-08 02:26:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60446 to 60444. [2025-03-08 02:26:52,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60444 states, 60443 states have (on average 1.5622818192346508) internal successors, (94429), 60443 states have internal predecessors, (94429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:52,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60444 states to 60444 states and 94429 transitions. [2025-03-08 02:26:52,132 INFO L78 Accepts]: Start accepts. Automaton has 60444 states and 94429 transitions. Word has length 52 [2025-03-08 02:26:52,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:52,132 INFO L471 AbstractCegarLoop]: Abstraction has 60444 states and 94429 transitions. [2025-03-08 02:26:52,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:52,132 INFO L276 IsEmpty]: Start isEmpty. Operand 60444 states and 94429 transitions. [2025-03-08 02:26:52,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-08 02:26:52,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:52,133 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:52,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:26:52,133 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:52,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:52,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2039442173, now seen corresponding path program 1 times [2025-03-08 02:26:52,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:52,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582892590] [2025-03-08 02:26:52,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:52,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:52,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-08 02:26:52,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-08 02:26:52,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:52,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 02:26:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:52,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582892590] [2025-03-08 02:26:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582892590] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:52,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:52,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224412056] [2025-03-08 02:26:52,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:52,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:52,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:52,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:52,372 INFO L87 Difference]: Start difference. First operand 60444 states and 94429 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:54,874 INFO L93 Difference]: Finished difference Result 110028 states and 171331 transitions. [2025-03-08 02:26:54,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:54,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-03-08 02:26:54,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:54,965 INFO L225 Difference]: With dead ends: 110028 [2025-03-08 02:26:54,965 INFO L226 Difference]: Without dead ends: 61410 [2025-03-08 02:26:54,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:54,998 INFO L435 NwaCegarLoop]: 10157 mSDtfsCounter, 9657 mSDsluCounter, 9401 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 1080 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9657 SdHoareTripleChecker+Valid, 19558 SdHoareTripleChecker+Invalid, 4001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1080 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:54,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9657 Valid, 19558 Invalid, 4001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1080 Valid, 2921 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:26:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61410 states. [2025-03-08 02:26:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61410 to 60188. [2025-03-08 02:26:55,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60188 states, 60187 states have (on average 1.551913203848007) internal successors, (93405), 60187 states have internal predecessors, (93405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:55,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60188 states to 60188 states and 93405 transitions. [2025-03-08 02:26:55,824 INFO L78 Accepts]: Start accepts. Automaton has 60188 states and 93405 transitions. Word has length 57 [2025-03-08 02:26:55,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:55,824 INFO L471 AbstractCegarLoop]: Abstraction has 60188 states and 93405 transitions. [2025-03-08 02:26:55,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:55,824 INFO L276 IsEmpty]: Start isEmpty. Operand 60188 states and 93405 transitions. [2025-03-08 02:26:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-08 02:26:55,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:55,825 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:55,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:26:55,825 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:55,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:55,825 INFO L85 PathProgramCache]: Analyzing trace with hash -680825006, now seen corresponding path program 1 times [2025-03-08 02:26:55,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:55,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865072194] [2025-03-08 02:26:55,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-08 02:26:55,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-08 02:26:55,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:55,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:55,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:55,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:55,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865072194] [2025-03-08 02:26:55,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865072194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:55,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:55,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:26:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615693816] [2025-03-08 02:26:55,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:55,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:26:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:55,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:26:55,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:55,928 INFO L87 Difference]: Start difference. First operand 60188 states and 93405 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:26:58,989 INFO L93 Difference]: Finished difference Result 122209 states and 188520 transitions. [2025-03-08 02:26:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:26:58,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-03-08 02:26:58,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:26:59,064 INFO L225 Difference]: With dead ends: 122209 [2025-03-08 02:26:59,064 INFO L226 Difference]: Without dead ends: 62400 [2025-03-08 02:26:59,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:26:59,090 INFO L435 NwaCegarLoop]: 10085 mSDtfsCounter, 9794 mSDsluCounter, 9165 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 846 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9794 SdHoareTripleChecker+Valid, 19250 SdHoareTripleChecker+Invalid, 4805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 846 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:26:59,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9794 Valid, 19250 Invalid, 4805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [846 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-08 02:26:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62400 states. [2025-03-08 02:26:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62400 to 59882. [2025-03-08 02:26:59,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59882 states, 59881 states have (on average 1.5483709356891167) internal successors, (92718), 59881 states have internal predecessors, (92718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:59,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59882 states to 59882 states and 92718 transitions. [2025-03-08 02:26:59,671 INFO L78 Accepts]: Start accepts. Automaton has 59882 states and 92718 transitions. Word has length 63 [2025-03-08 02:26:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:26:59,671 INFO L471 AbstractCegarLoop]: Abstraction has 59882 states and 92718 transitions. [2025-03-08 02:26:59,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:26:59,671 INFO L276 IsEmpty]: Start isEmpty. Operand 59882 states and 92718 transitions. [2025-03-08 02:26:59,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-08 02:26:59,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:26:59,672 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:26:59,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:26:59,672 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:26:59,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:26:59,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1427395918, now seen corresponding path program 1 times [2025-03-08 02:26:59,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:26:59,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156975610] [2025-03-08 02:26:59,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:26:59,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:26:59,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-08 02:26:59,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-08 02:26:59,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:26:59,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:26:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:26:59,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:26:59,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156975610] [2025-03-08 02:26:59,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156975610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:26:59,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:26:59,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:26:59,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804735589] [2025-03-08 02:26:59,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:26:59,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:26:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:26:59,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:26:59,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:26:59,831 INFO L87 Difference]: Start difference. First operand 59882 states and 92718 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:04,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:04,074 INFO L93 Difference]: Finished difference Result 86144 states and 132250 transitions. [2025-03-08 02:27:04,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:27:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2025-03-08 02:27:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:04,163 INFO L225 Difference]: With dead ends: 86144 [2025-03-08 02:27:04,163 INFO L226 Difference]: Without dead ends: 61140 [2025-03-08 02:27:04,191 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:27:04,192 INFO L435 NwaCegarLoop]: 19395 mSDtfsCounter, 9174 mSDsluCounter, 17056 mSDsCounter, 0 mSdLazyCounter, 8183 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9174 SdHoareTripleChecker+Valid, 36451 SdHoareTripleChecker+Invalid, 8941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 8183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:04,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9174 Valid, 36451 Invalid, 8941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 8183 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-08 02:27:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61140 states. [2025-03-08 02:27:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61140 to 59866. [2025-03-08 02:27:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59866 states, 59865 states have (on average 1.5471143405996826) internal successors, (92618), 59865 states have internal predecessors, (92618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59866 states to 59866 states and 92618 transitions. [2025-03-08 02:27:04,818 INFO L78 Accepts]: Start accepts. Automaton has 59866 states and 92618 transitions. Word has length 73 [2025-03-08 02:27:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:04,818 INFO L471 AbstractCegarLoop]: Abstraction has 59866 states and 92618 transitions. [2025-03-08 02:27:04,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 59866 states and 92618 transitions. [2025-03-08 02:27:04,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-08 02:27:04,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:04,819 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:04,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:27:04,820 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:04,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:04,820 INFO L85 PathProgramCache]: Analyzing trace with hash -249238720, now seen corresponding path program 1 times [2025-03-08 02:27:04,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:04,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823198863] [2025-03-08 02:27:04,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:04,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:04,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 02:27:04,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 02:27:04,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:04,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 02:27:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823198863] [2025-03-08 02:27:04,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823198863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:04,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:04,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:27:04,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426576450] [2025-03-08 02:27:04,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:04,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:27:04,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:04,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:27:04,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:04,888 INFO L87 Difference]: Start difference. First operand 59866 states and 92618 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:06,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:06,089 INFO L93 Difference]: Finished difference Result 117101 states and 181172 transitions. [2025-03-08 02:27:06,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:27:06,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-08 02:27:06,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:06,167 INFO L225 Difference]: With dead ends: 117101 [2025-03-08 02:27:06,167 INFO L226 Difference]: Without dead ends: 57632 [2025-03-08 02:27:06,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:06,207 INFO L435 NwaCegarLoop]: 11154 mSDtfsCounter, 9551 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9551 SdHoareTripleChecker+Valid, 11918 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 807 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:06,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9551 Valid, 11918 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [807 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:27:06,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57632 states. [2025-03-08 02:27:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57632 to 57630. [2025-03-08 02:27:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57630 states, 57629 states have (on average 1.5461486404414444) internal successors, (89103), 57629 states have internal predecessors, (89103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57630 states to 57630 states and 89103 transitions. [2025-03-08 02:27:06,876 INFO L78 Accepts]: Start accepts. Automaton has 57630 states and 89103 transitions. Word has length 80 [2025-03-08 02:27:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:06,876 INFO L471 AbstractCegarLoop]: Abstraction has 57630 states and 89103 transitions. [2025-03-08 02:27:06,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:06,877 INFO L276 IsEmpty]: Start isEmpty. Operand 57630 states and 89103 transitions. [2025-03-08 02:27:06,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-08 02:27:06,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:06,878 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:06,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:27:06,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:06,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:06,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1128159097, now seen corresponding path program 1 times [2025-03-08 02:27:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233001744] [2025-03-08 02:27:06,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:06,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-08 02:27:06,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-08 02:27:06,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:06,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:06,933 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 02:27:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233001744] [2025-03-08 02:27:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233001744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:06,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:06,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:27:06,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44940021] [2025-03-08 02:27:06,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:06,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:27:06,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:06,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:27:06,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:06,935 INFO L87 Difference]: Start difference. First operand 57630 states and 89103 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:08,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:08,641 INFO L93 Difference]: Finished difference Result 114945 states and 177727 transitions. [2025-03-08 02:27:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:27:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2025-03-08 02:27:08,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:08,893 INFO L225 Difference]: With dead ends: 114945 [2025-03-08 02:27:08,894 INFO L226 Difference]: Without dead ends: 57712 [2025-03-08 02:27:08,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:08,909 INFO L435 NwaCegarLoop]: 11226 mSDtfsCounter, 276 mSDsluCounter, 9967 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 21193 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:08,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 21193 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:27:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57712 states. [2025-03-08 02:27:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57712 to 57710. [2025-03-08 02:27:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57710 states, 57709 states have (on average 1.545391533383008) internal successors, (89183), 57709 states have internal predecessors, (89183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57710 states to 57710 states and 89183 transitions. [2025-03-08 02:27:09,586 INFO L78 Accepts]: Start accepts. Automaton has 57710 states and 89183 transitions. Word has length 83 [2025-03-08 02:27:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:09,587 INFO L471 AbstractCegarLoop]: Abstraction has 57710 states and 89183 transitions. [2025-03-08 02:27:09,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 57710 states and 89183 transitions. [2025-03-08 02:27:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-03-08 02:27:09,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:09,588 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:09,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:27:09,588 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:09,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:09,588 INFO L85 PathProgramCache]: Analyzing trace with hash 95887857, now seen corresponding path program 1 times [2025-03-08 02:27:09,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:09,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639158897] [2025-03-08 02:27:09,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:09,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:09,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-03-08 02:27:09,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-03-08 02:27:09,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:27:09,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:09,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639158897] [2025-03-08 02:27:09,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639158897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:09,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:09,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:27:09,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161640833] [2025-03-08 02:27:09,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:09,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:27:09,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:09,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:27:09,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:27:09,768 INFO L87 Difference]: Start difference. First operand 57710 states and 89183 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:13,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:13,595 INFO L93 Difference]: Finished difference Result 82666 states and 126783 transitions. [2025-03-08 02:27:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:27:13,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2025-03-08 02:27:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:13,646 INFO L225 Difference]: With dead ends: 82666 [2025-03-08 02:27:13,646 INFO L226 Difference]: Without dead ends: 36245 [2025-03-08 02:27:13,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:27:13,676 INFO L435 NwaCegarLoop]: 8732 mSDtfsCounter, 17797 mSDsluCounter, 8368 mSDsCounter, 0 mSdLazyCounter, 5629 mSolverCounterSat, 1678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17797 SdHoareTripleChecker+Valid, 17100 SdHoareTripleChecker+Invalid, 7307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1678 IncrementalHoareTripleChecker+Valid, 5629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:13,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17797 Valid, 17100 Invalid, 7307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1678 Valid, 5629 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-08 02:27:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36245 states. [2025-03-08 02:27:14,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36245 to 35092. [2025-03-08 02:27:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35092 states, 35091 states have (on average 1.5210737796016072) internal successors, (53376), 35091 states have internal predecessors, (53376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:14,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35092 states to 35092 states and 53376 transitions. [2025-03-08 02:27:14,111 INFO L78 Accepts]: Start accepts. Automaton has 35092 states and 53376 transitions. Word has length 87 [2025-03-08 02:27:14,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:14,111 INFO L471 AbstractCegarLoop]: Abstraction has 35092 states and 53376 transitions. [2025-03-08 02:27:14,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:14,111 INFO L276 IsEmpty]: Start isEmpty. Operand 35092 states and 53376 transitions. [2025-03-08 02:27:14,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-08 02:27:14,112 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:14,112 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:14,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:27:14,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:14,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2036647869, now seen corresponding path program 1 times [2025-03-08 02:27:14,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:14,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042257153] [2025-03-08 02:27:14,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:14,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:14,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-08 02:27:14,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-08 02:27:14,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:14,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:27:14,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:14,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042257153] [2025-03-08 02:27:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042257153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:14,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:14,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:27:14,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761416396] [2025-03-08 02:27:14,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:27:14,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:14,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:27:14,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:27:14,367 INFO L87 Difference]: Start difference. First operand 35092 states and 53376 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:18,322 INFO L93 Difference]: Finished difference Result 48610 states and 72980 transitions. [2025-03-08 02:27:18,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:27:18,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2025-03-08 02:27:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:18,349 INFO L225 Difference]: With dead ends: 48610 [2025-03-08 02:27:18,350 INFO L226 Difference]: Without dead ends: 24947 [2025-03-08 02:27:18,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:27:18,366 INFO L435 NwaCegarLoop]: 16026 mSDtfsCounter, 17630 mSDsluCounter, 8367 mSDsCounter, 0 mSdLazyCounter, 7809 mSolverCounterSat, 1486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17630 SdHoareTripleChecker+Valid, 24393 SdHoareTripleChecker+Invalid, 9295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1486 IncrementalHoareTripleChecker+Valid, 7809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:18,366 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17630 Valid, 24393 Invalid, 9295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1486 Valid, 7809 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2025-03-08 02:27:18,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24947 states. [2025-03-08 02:27:18,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24947 to 23794. [2025-03-08 02:27:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23794 states, 23793 states have (on average 1.5069978565124196) internal successors, (35856), 23793 states have internal predecessors, (35856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23794 states to 23794 states and 35856 transitions. [2025-03-08 02:27:18,646 INFO L78 Accepts]: Start accepts. Automaton has 23794 states and 35856 transitions. Word has length 89 [2025-03-08 02:27:18,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:18,646 INFO L471 AbstractCegarLoop]: Abstraction has 23794 states and 35856 transitions. [2025-03-08 02:27:18,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 23794 states and 35856 transitions. [2025-03-08 02:27:18,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-08 02:27:18,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:18,648 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:18,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:27:18,648 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:18,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1221908190, now seen corresponding path program 1 times [2025-03-08 02:27:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:18,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143879634] [2025-03-08 02:27:18,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:18,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-08 02:27:18,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-08 02:27:18,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:18,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:18,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:27:18,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:18,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143879634] [2025-03-08 02:27:18,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143879634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:18,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:18,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:27:18,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045433376] [2025-03-08 02:27:18,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:18,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:27:18,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:18,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:27:18,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:18,717 INFO L87 Difference]: Start difference. First operand 23794 states and 35856 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:19,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:19,470 INFO L93 Difference]: Finished difference Result 24567 states and 36968 transitions. [2025-03-08 02:27:19,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:27:19,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-08 02:27:19,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:19,495 INFO L225 Difference]: With dead ends: 24567 [2025-03-08 02:27:19,496 INFO L226 Difference]: Without dead ends: 24565 [2025-03-08 02:27:19,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:19,504 INFO L435 NwaCegarLoop]: 10883 mSDtfsCounter, 885 mSDsluCounter, 10115 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 20998 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:19,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 20998 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:27:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24565 states. [2025-03-08 02:27:19,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24565 to 24565. [2025-03-08 02:27:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24565 states, 24564 states have (on average 1.5046002279758997) internal successors, (36959), 24564 states have internal predecessors, (36959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24565 states to 24565 states and 36959 transitions. [2025-03-08 02:27:19,728 INFO L78 Accepts]: Start accepts. Automaton has 24565 states and 36959 transitions. Word has length 97 [2025-03-08 02:27:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:19,728 INFO L471 AbstractCegarLoop]: Abstraction has 24565 states and 36959 transitions. [2025-03-08 02:27:19,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:19,729 INFO L276 IsEmpty]: Start isEmpty. Operand 24565 states and 36959 transitions. [2025-03-08 02:27:19,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-08 02:27:19,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:19,730 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:19,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:27:19,730 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:19,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:19,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1354437243, now seen corresponding path program 1 times [2025-03-08 02:27:19,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:19,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349728131] [2025-03-08 02:27:19,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:19,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:19,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-08 02:27:19,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-08 02:27:19,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:19,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 02:27:19,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:19,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349728131] [2025-03-08 02:27:19,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349728131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:19,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:19,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:27:19,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611264913] [2025-03-08 02:27:19,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:19,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:27:19,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:19,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:27:19,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:19,790 INFO L87 Difference]: Start difference. First operand 24565 states and 36959 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:20,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:20,455 INFO L93 Difference]: Finished difference Result 42958 states and 64440 transitions. [2025-03-08 02:27:20,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:27:20,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 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 113 [2025-03-08 02:27:20,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:20,478 INFO L225 Difference]: With dead ends: 42958 [2025-03-08 02:27:20,478 INFO L226 Difference]: Without dead ends: 19561 [2025-03-08 02:27:20,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:20,496 INFO L435 NwaCegarLoop]: 11005 mSDtfsCounter, 290 mSDsluCounter, 9827 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 20832 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:20,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 20832 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:27:20,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19561 states. [2025-03-08 02:27:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19561 to 19559. [2025-03-08 02:27:20,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19559 states, 19558 states have (on average 1.4901830453011555) internal successors, (29145), 19558 states have internal predecessors, (29145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:20,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19559 states to 19559 states and 29145 transitions. [2025-03-08 02:27:20,668 INFO L78 Accepts]: Start accepts. Automaton has 19559 states and 29145 transitions. Word has length 113 [2025-03-08 02:27:20,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:20,668 INFO L471 AbstractCegarLoop]: Abstraction has 19559 states and 29145 transitions. [2025-03-08 02:27:20,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19559 states and 29145 transitions. [2025-03-08 02:27:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 02:27:20,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:20,670 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:20,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:27:20,670 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:20,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:20,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1876963037, now seen corresponding path program 1 times [2025-03-08 02:27:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:20,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66020674] [2025-03-08 02:27:20,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:20,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:20,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 02:27:20,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 02:27:20,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:20,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:20,749 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 02:27:20,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:20,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66020674] [2025-03-08 02:27:20,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66020674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:20,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:20,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:27:20,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209081486] [2025-03-08 02:27:20,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:20,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:27:20,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:20,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:27:20,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:20,750 INFO L87 Difference]: Start difference. First operand 19559 states and 29145 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:21,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:21,500 INFO L93 Difference]: Finished difference Result 36141 states and 53937 transitions. [2025-03-08 02:27:21,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:27:21,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 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 135 [2025-03-08 02:27:21,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:21,520 INFO L225 Difference]: With dead ends: 36141 [2025-03-08 02:27:21,520 INFO L226 Difference]: Without dead ends: 17940 [2025-03-08 02:27:21,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:21,532 INFO L435 NwaCegarLoop]: 10565 mSDtfsCounter, 8616 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8616 SdHoareTripleChecker+Valid, 11782 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 642 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:21,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8616 Valid, 11782 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [642 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:27:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17940 states. [2025-03-08 02:27:21,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17940 to 17938. [2025-03-08 02:27:21,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17938 states, 17937 states have (on average 1.4901600044600547) internal successors, (26729), 17937 states have internal predecessors, (26729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:21,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17938 states to 17938 states and 26729 transitions. [2025-03-08 02:27:21,696 INFO L78 Accepts]: Start accepts. Automaton has 17938 states and 26729 transitions. Word has length 135 [2025-03-08 02:27:21,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:21,696 INFO L471 AbstractCegarLoop]: Abstraction has 17938 states and 26729 transitions. [2025-03-08 02:27:21,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 17938 states and 26729 transitions. [2025-03-08 02:27:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 02:27:21,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:21,698 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:21,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:27:21,698 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:21,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:21,698 INFO L85 PathProgramCache]: Analyzing trace with hash -250641650, now seen corresponding path program 1 times [2025-03-08 02:27:21,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:21,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629728779] [2025-03-08 02:27:21,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:21,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:21,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 02:27:21,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 02:27:21,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:21,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 02:27:21,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:21,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629728779] [2025-03-08 02:27:21,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629728779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:21,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:21,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:27:21,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899886726] [2025-03-08 02:27:21,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:21,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:27:21,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:21,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:27:21,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:21,770 INFO L87 Difference]: Start difference. First operand 17938 states and 26729 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:22,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:27:22,397 INFO L93 Difference]: Finished difference Result 29244 states and 43522 transitions. [2025-03-08 02:27:22,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:27:22,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 137 [2025-03-08 02:27:22,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:27:22,415 INFO L225 Difference]: With dead ends: 29244 [2025-03-08 02:27:22,415 INFO L226 Difference]: Without dead ends: 13055 [2025-03-08 02:27:22,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:22,431 INFO L435 NwaCegarLoop]: 10287 mSDtfsCounter, 291 mSDsluCounter, 9132 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 19419 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:27:22,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 19419 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:27:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13055 states. [2025-03-08 02:27:22,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13055 to 13053. [2025-03-08 02:27:22,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13053 states, 13052 states have (on average 1.478317499233834) internal successors, (19295), 13052 states have internal predecessors, (19295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:22,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13053 states to 13053 states and 19295 transitions. [2025-03-08 02:27:22,569 INFO L78 Accepts]: Start accepts. Automaton has 13053 states and 19295 transitions. Word has length 137 [2025-03-08 02:27:22,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:27:22,570 INFO L471 AbstractCegarLoop]: Abstraction has 13053 states and 19295 transitions. [2025-03-08 02:27:22,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:27:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 13053 states and 19295 transitions. [2025-03-08 02:27:22,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 02:27:22,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:27:22,571 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:27:22,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:27:22,572 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:27:22,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:27:22,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1669034147, now seen corresponding path program 1 times [2025-03-08 02:27:22,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:27:22,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70246898] [2025-03-08 02:27:22,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:27:22,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:27:22,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 02:27:22,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 02:27:22,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:27:22,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:27:22,652 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 02:27:22,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:27:22,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70246898] [2025-03-08 02:27:22,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70246898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:27:22,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:27:22,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:27:22,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854994434] [2025-03-08 02:27:22,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:27:22,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:27:22,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:27:22,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:27:22,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:27:22,654 INFO L87 Difference]: Start difference. First operand 13053 states and 19295 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)