./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label22.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/eca-rers2012/Problem17_label22.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 4813005008457a5d4e6ae5277d71ca9796b28c553541eb8e67cfaf33286f04c4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:09:04,094 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:09:04,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:09:04,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:09:04,152 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:09:04,167 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:09:04,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:09:04,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:09:04,169 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:09:04,170 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:09:04,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:09:04,171 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:09:04,171 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:09:04,171 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:09:04,171 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:09:04,172 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:09:04,172 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:09:04,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:09:04,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:09:04,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:09:04,173 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:09:04,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:09:04,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:09:04,173 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:09:04,174 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:09:04,174 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 -> 4813005008457a5d4e6ae5277d71ca9796b28c553541eb8e67cfaf33286f04c4 [2025-03-08 02:09:04,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:09:04,420 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:09:04,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:09:04,425 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:09:04,425 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:09:04,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label22.c [2025-03-08 02:09:05,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d27af81/741f9b4123d740539ac6cc463833aa93/FLAGb4d2c5fcb [2025-03-08 02:09:06,005 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:09:06,006 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label22.c [2025-03-08 02:09:06,028 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d27af81/741f9b4123d740539ac6cc463833aa93/FLAGb4d2c5fcb [2025-03-08 02:09:06,164 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d27af81/741f9b4123d740539ac6cc463833aa93 [2025-03-08 02:09:06,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:09:06,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:09:06,170 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:09:06,170 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:09:06,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:09:06,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:06,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29eb79d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06, skipping insertion in model container [2025-03-08 02:09:06,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:06,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:09:06,416 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/eca-rers2012/Problem17_label22.c[7589,7602] [2025-03-08 02:09:06,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:09:06,755 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:09:06,776 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/eca-rers2012/Problem17_label22.c[7589,7602] [2025-03-08 02:09:06,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:09:06,967 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:09:06,968 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06 WrapperNode [2025-03-08 02:09:06,968 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:09:06,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:09:06,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:09:06,970 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:09:06,974 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:09:06" (1/1) ... [2025-03-08 02:09:07,001 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:09:06" (1/1) ... [2025-03-08 02:09:07,217 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-08 02:09:07,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:09:07,218 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:09:07,218 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:09:07,218 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:09:07,224 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,431 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:09:07,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,610 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:09:07,651 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:09:07,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:09:07,651 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:09:07,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (1/1) ... [2025-03-08 02:09:07,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:09:07,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:07,680 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:09:07,683 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:09:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:09:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:09:07,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:09:07,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:09:07,755 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:09:07,757 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:09:10,256 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-08 02:09:10,417 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-08 02:09:10,417 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:09:10,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:09:10,449 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:09:10,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:09:10 BoogieIcfgContainer [2025-03-08 02:09:10,450 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:09:10,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:09:10,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:09:10,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:09:10,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:09:06" (1/3) ... [2025-03-08 02:09:10,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af314c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:09:10, skipping insertion in model container [2025-03-08 02:09:10,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:09:06" (2/3) ... [2025-03-08 02:09:10,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5af314c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:09:10, skipping insertion in model container [2025-03-08 02:09:10,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:09:10" (3/3) ... [2025-03-08 02:09:10,457 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label22.c [2025-03-08 02:09:10,467 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:09:10,469 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label22.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:09:10,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:09:10,585 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;@200ff8e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:09:10,586 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:09:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states 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:09:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-08 02:09:10,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:10,601 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:10,601 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:10,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 98160522, now seen corresponding path program 1 times [2025-03-08 02:09:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:10,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545061730] [2025-03-08 02:09:10,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:10,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:10,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-08 02:09:10,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-08 02:09:10,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:10,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:10,909 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:09:10,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:10,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545061730] [2025-03-08 02:09:10,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545061730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:10,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:10,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168190385] [2025-03-08 02:09:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:10,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:10,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:10,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:10,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:10,934 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:09:13,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:13,046 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-03-08 02:09:13,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:13,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:09:13,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:13,062 INFO L225 Difference]: With dead ends: 1667 [2025-03-08 02:09:13,062 INFO L226 Difference]: Without dead ends: 998 [2025-03-08 02:09:13,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:13,067 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 494 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:13,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 02:09:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-08 02:09:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-03-08 02:09:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states 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:09:13,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-03-08 02:09:13,143 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 51 [2025-03-08 02:09:13,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:13,143 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-03-08 02:09:13,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 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:09:13,143 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-03-08 02:09:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-08 02:09:13,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:13,146 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:13,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:09:13,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:13,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1684978204, now seen corresponding path program 1 times [2025-03-08 02:09:13,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:13,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309664111] [2025-03-08 02:09:13,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:13,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:13,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-08 02:09:13,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-08 02:09:13,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:13,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:13,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:13,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309664111] [2025-03-08 02:09:13,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309664111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:13,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:13,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:09:13,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392565506] [2025-03-08 02:09:13,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:13,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:13,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:13,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:13,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:13,403 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:09:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:15,036 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-03-08 02:09:15,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:15,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 116 [2025-03-08 02:09:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:15,042 INFO L225 Difference]: With dead ends: 2824 [2025-03-08 02:09:15,042 INFO L226 Difference]: Without dead ends: 1844 [2025-03-08 02:09:15,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:09:15,044 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:15,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:09:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-08 02:09:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-03-08 02:09:15,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states 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:09:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-03-08 02:09:15,079 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 116 [2025-03-08 02:09:15,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:15,079 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-03-08 02:09:15,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:09:15,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-03-08 02:09:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-08 02:09:15,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:15,085 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:15,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:09:15,086 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:15,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:15,086 INFO L85 PathProgramCache]: Analyzing trace with hash -525704229, now seen corresponding path program 1 times [2025-03-08 02:09:15,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:15,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853837582] [2025-03-08 02:09:15,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:15,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:15,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 02:09:15,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 02:09:15,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:15,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:15,355 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:09:15,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:15,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853837582] [2025-03-08 02:09:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853837582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349527619] [2025-03-08 02:09:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:15,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:15,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:15,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:15,358 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:09:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:16,949 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-03-08 02:09:16,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:16,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 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 199 [2025-03-08 02:09:16,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:16,962 INFO L225 Difference]: With dead ends: 4546 [2025-03-08 02:09:16,963 INFO L226 Difference]: Without dead ends: 2704 [2025-03-08 02:09:16,967 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:09:16,968 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:16,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:09:16,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-08 02:09:17,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-08 02:09:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states 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:09:17,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-03-08 02:09:17,022 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 199 [2025-03-08 02:09:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:17,024 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-03-08 02:09:17,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states 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:09:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-03-08 02:09:17,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-08 02:09:17,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:17,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:09:17,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:17,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash 999635690, now seen corresponding path program 1 times [2025-03-08 02:09:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440746276] [2025-03-08 02:09:17,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:17,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 02:09:17,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 02:09:17,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:17,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:17,222 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 02:09:17,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:17,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440746276] [2025-03-08 02:09:17,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440746276] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:17,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:17,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:17,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980831307] [2025-03-08 02:09:17,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:17,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:17,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:17,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:17,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:17,224 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:09:18,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:18,799 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-03-08 02:09:18,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:18,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 205 [2025-03-08 02:09:18,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:18,814 INFO L225 Difference]: With dead ends: 7954 [2025-03-08 02:09:18,814 INFO L226 Difference]: Without dead ends: 5252 [2025-03-08 02:09:18,817 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:09:18,819 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 397 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:18,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:09:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-03-08 02:09:18,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-03-08 02:09:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 0 states 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:09:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-03-08 02:09:18,882 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 205 [2025-03-08 02:09:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:18,882 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-03-08 02:09:18,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states 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:09:18,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-03-08 02:09:18,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 02:09:18,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:18,885 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:18,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:09:18,885 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:18,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 738611792, now seen corresponding path program 1 times [2025-03-08 02:09:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985435916] [2025-03-08 02:09:18,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:18,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 02:09:18,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 02:09:18,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:18,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 75 proven. 22 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:19,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:19,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985435916] [2025-03-08 02:09:19,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985435916] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:19,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204707671] [2025-03-08 02:09:19,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:19,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:19,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:19,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:19,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 02:09:19,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 02:09:19,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 02:09:19,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:19,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:19,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:09:19,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:19,413 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:09:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204707671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:09:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 02:09:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132886442] [2025-03-08 02:09:19,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:19,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:19,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:19,414 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:09:21,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:21,006 INFO L93 Difference]: Finished difference Result 13481 states and 17131 transitions. [2025-03-08 02:09:21,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:21,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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 218 [2025-03-08 02:09:21,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:21,025 INFO L225 Difference]: With dead ends: 13481 [2025-03-08 02:09:21,025 INFO L226 Difference]: Without dead ends: 8657 [2025-03-08 02:09:21,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:21,030 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 433 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:21,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 483 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:09:21,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8657 states. [2025-03-08 02:09:21,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8657 to 7378. [2025-03-08 02:09:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7378 states, 7377 states have (on average 1.2479327639962043) internal successors, (9206), 7377 states have internal predecessors, (9206), 0 states have call successors, (0), 0 states 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:09:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7378 states to 7378 states and 9206 transitions. [2025-03-08 02:09:21,122 INFO L78 Accepts]: Start accepts. Automaton has 7378 states and 9206 transitions. Word has length 218 [2025-03-08 02:09:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:21,122 INFO L471 AbstractCegarLoop]: Abstraction has 7378 states and 9206 transitions. [2025-03-08 02:09:21,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states 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:09:21,123 INFO L276 IsEmpty]: Start isEmpty. Operand 7378 states and 9206 transitions. [2025-03-08 02:09:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-08 02:09:21,125 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:21,125 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:21,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:09:21,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:21,327 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:21,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:21,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2098948776, now seen corresponding path program 1 times [2025-03-08 02:09:21,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:21,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607283306] [2025-03-08 02:09:21,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:21,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:21,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 02:09:21,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 02:09:21,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:21,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-08 02:09:21,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:21,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607283306] [2025-03-08 02:09:21,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607283306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:21,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:21,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684065631] [2025-03-08 02:09:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:21,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:21,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:21,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:21,669 INFO L87 Difference]: Start difference. First operand 7378 states and 9206 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:09:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:23,419 INFO L93 Difference]: Finished difference Result 18607 states and 23435 transitions. [2025-03-08 02:09:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 267 [2025-03-08 02:09:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:23,448 INFO L225 Difference]: With dead ends: 18607 [2025-03-08 02:09:23,448 INFO L226 Difference]: Without dead ends: 10379 [2025-03-08 02:09:23,454 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:09:23,455 INFO L435 NwaCegarLoop]: 945 mSDtfsCounter, 449 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:23,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1020 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:09:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2025-03-08 02:09:23,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10371. [2025-03-08 02:09:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10371 states, 10370 states have (on average 1.2060752169720348) internal successors, (12507), 10370 states have internal predecessors, (12507), 0 states have call successors, (0), 0 states 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:09:23,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10371 states to 10371 states and 12507 transitions. [2025-03-08 02:09:23,569 INFO L78 Accepts]: Start accepts. Automaton has 10371 states and 12507 transitions. Word has length 267 [2025-03-08 02:09:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:23,570 INFO L471 AbstractCegarLoop]: Abstraction has 10371 states and 12507 transitions. [2025-03-08 02:09:23,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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:09:23,570 INFO L276 IsEmpty]: Start isEmpty. Operand 10371 states and 12507 transitions. [2025-03-08 02:09:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-08 02:09:23,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:23,573 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:23,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:09:23,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:23,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:23,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1974218303, now seen corresponding path program 1 times [2025-03-08 02:09:23,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:23,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297277060] [2025-03-08 02:09:23,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:23,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:23,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 02:09:23,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 02:09:23,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:23,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:23,848 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 236 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 02:09:23,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297277060] [2025-03-08 02:09:23,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297277060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:23,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618091244] [2025-03-08 02:09:23,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:23,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:23,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:23,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:23,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 02:09:23,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-08 02:09:23,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-08 02:09:23,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:23,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:23,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:23,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:24,104 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 236 proven. 70 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 02:09:24,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 02:09:24,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618091244] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:24,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:24,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:09:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800017118] [2025-03-08 02:09:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:24,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:24,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:24,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:24,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:24,486 INFO L87 Difference]: Start difference. First operand 10371 states and 12507 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:27,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:27,178 INFO L93 Difference]: Finished difference Result 32691 states and 39751 transitions. [2025-03-08 02:09:27,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:27,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 275 [2025-03-08 02:09:27,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:27,211 INFO L225 Difference]: With dead ends: 32691 [2025-03-08 02:09:27,212 INFO L226 Difference]: Without dead ends: 21461 [2025-03-08 02:09:27,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 547 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:27,222 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 1139 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1420 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:27,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 142 Invalid, 3713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1420 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-08 02:09:27,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21461 states. [2025-03-08 02:09:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21461 to 21459. [2025-03-08 02:09:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21459 states, 21458 states have (on average 1.1587752819461272) internal successors, (24865), 21458 states have internal predecessors, (24865), 0 states have call successors, (0), 0 states 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:09:27,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21459 states to 21459 states and 24865 transitions. [2025-03-08 02:09:27,457 INFO L78 Accepts]: Start accepts. Automaton has 21459 states and 24865 transitions. Word has length 275 [2025-03-08 02:09:27,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:27,458 INFO L471 AbstractCegarLoop]: Abstraction has 21459 states and 24865 transitions. [2025-03-08 02:09:27,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:27,458 INFO L276 IsEmpty]: Start isEmpty. Operand 21459 states and 24865 transitions. [2025-03-08 02:09:27,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-08 02:09:27,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:27,462 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:27,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 02:09:27,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-08 02:09:27,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:27,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:27,664 INFO L85 PathProgramCache]: Analyzing trace with hash -906791289, now seen corresponding path program 1 times [2025-03-08 02:09:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:27,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209228822] [2025-03-08 02:09:27,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:27,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-08 02:09:27,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-08 02:09:27,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:27,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:09:27,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:27,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209228822] [2025-03-08 02:09:27,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209228822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:27,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:27,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:27,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101376856] [2025-03-08 02:09:27,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:27,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:27,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:27,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:27,815 INFO L87 Difference]: Start difference. First operand 21459 states and 24865 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:09:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:29,333 INFO L93 Difference]: Finished difference Result 47592 states and 55279 transitions. [2025-03-08 02:09:29,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 288 [2025-03-08 02:09:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:29,366 INFO L225 Difference]: With dead ends: 47592 [2025-03-08 02:09:29,366 INFO L226 Difference]: Without dead ends: 25708 [2025-03-08 02:09:29,378 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:09:29,379 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 371 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:29,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 860 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25708 states. [2025-03-08 02:09:29,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25708 to 25708. [2025-03-08 02:09:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25708 states, 25707 states have (on average 1.1349048897187537) internal successors, (29175), 25707 states have internal predecessors, (29175), 0 states have call successors, (0), 0 states 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:09:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25708 states to 25708 states and 29175 transitions. [2025-03-08 02:09:29,697 INFO L78 Accepts]: Start accepts. Automaton has 25708 states and 29175 transitions. Word has length 288 [2025-03-08 02:09:29,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:29,697 INFO L471 AbstractCegarLoop]: Abstraction has 25708 states and 29175 transitions. [2025-03-08 02:09:29,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states 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:09:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 25708 states and 29175 transitions. [2025-03-08 02:09:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-08 02:09:29,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:29,705 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:29,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:09:29,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:29,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash 802721408, now seen corresponding path program 1 times [2025-03-08 02:09:29,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:29,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613595814] [2025-03-08 02:09:29,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:29,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:29,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-08 02:09:29,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 02:09:29,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:29,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:30,094 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 377 proven. 73 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-08 02:09:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613595814] [2025-03-08 02:09:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613595814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785275615] [2025-03-08 02:09:30,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:30,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:30,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:30,097 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:30,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 02:09:30,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-08 02:09:30,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-08 02:09:30,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:30,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:30,201 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 02:09:30,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 377 proven. 73 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-08 02:09:30,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:30,527 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-03-08 02:09:30,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785275615] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:30,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:09:30,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-08 02:09:30,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345846958] [2025-03-08 02:09:30,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:30,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:30,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:30,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:30,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:30,529 INFO L87 Difference]: Start difference. First operand 25708 states and 29175 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:32,812 INFO L93 Difference]: Finished difference Result 62499 states and 71199 transitions. [2025-03-08 02:09:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:09:32,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-08 02:09:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:32,855 INFO L225 Difference]: With dead ends: 62499 [2025-03-08 02:09:32,855 INFO L226 Difference]: Without dead ends: 36366 [2025-03-08 02:09:32,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:32,874 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 842 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2345 mSolverCounterSat, 493 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 2838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 493 IncrementalHoareTripleChecker+Valid, 2345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:32,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 195 Invalid, 2838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [493 Valid, 2345 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:09:32,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36366 states. [2025-03-08 02:09:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36366 to 34238. [2025-03-08 02:09:33,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34238 states, 34237 states have (on average 1.1454566696848438) internal successors, (39217), 34237 states have internal predecessors, (39217), 0 states have call successors, (0), 0 states 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:09:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34238 states to 34238 states and 39217 transitions. [2025-03-08 02:09:33,242 INFO L78 Accepts]: Start accepts. Automaton has 34238 states and 39217 transitions. Word has length 349 [2025-03-08 02:09:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:33,243 INFO L471 AbstractCegarLoop]: Abstraction has 34238 states and 39217 transitions. [2025-03-08 02:09:33,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 34238 states and 39217 transitions. [2025-03-08 02:09:33,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-08 02:09:33,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:33,253 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:09:33,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 02:09:33,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:33,458 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:33,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:33,458 INFO L85 PathProgramCache]: Analyzing trace with hash 83705530, now seen corresponding path program 1 times [2025-03-08 02:09:33,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:33,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311958112] [2025-03-08 02:09:33,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:33,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:33,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-08 02:09:33,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-08 02:09:33,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:33,772 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2025-03-08 02:09:33,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:33,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311958112] [2025-03-08 02:09:33,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311958112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:33,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:33,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:33,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097929197] [2025-03-08 02:09:33,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:33,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:33,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:33,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:33,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:33,775 INFO L87 Difference]: Start difference. First operand 34238 states and 39217 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:09:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:35,210 INFO L93 Difference]: Finished difference Result 80388 states and 92354 transitions. [2025-03-08 02:09:35,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:35,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 472 [2025-03-08 02:09:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:35,267 INFO L225 Difference]: With dead ends: 80388 [2025-03-08 02:09:35,267 INFO L226 Difference]: Without dead ends: 45725 [2025-03-08 02:09:35,298 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:09:35,299 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:35,299 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 255 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:35,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45725 states. [2025-03-08 02:09:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45725 to 33771. [2025-03-08 02:09:35,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33771 states, 33770 states have (on average 1.1432928634883033) internal successors, (38609), 33770 states have internal predecessors, (38609), 0 states have call successors, (0), 0 states 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:09:35,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33771 states to 33771 states and 38609 transitions. [2025-03-08 02:09:35,739 INFO L78 Accepts]: Start accepts. Automaton has 33771 states and 38609 transitions. Word has length 472 [2025-03-08 02:09:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:35,740 INFO L471 AbstractCegarLoop]: Abstraction has 33771 states and 38609 transitions. [2025-03-08 02:09:35,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states 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:09:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 33771 states and 38609 transitions. [2025-03-08 02:09:35,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 02:09:35,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:35,751 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:35,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:09:35,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:35,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:35,753 INFO L85 PathProgramCache]: Analyzing trace with hash -295208019, now seen corresponding path program 1 times [2025-03-08 02:09:35,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:35,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859369064] [2025-03-08 02:09:35,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:35,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:35,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 02:09:35,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 02:09:35,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:35,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-03-08 02:09:36,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:36,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859369064] [2025-03-08 02:09:36,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859369064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:36,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:36,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:36,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118185120] [2025-03-08 02:09:36,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:36,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:36,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:36,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:36,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:36,070 INFO L87 Difference]: Start difference. First operand 33771 states and 38609 transitions. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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:09:37,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:37,491 INFO L93 Difference]: Finished difference Result 80766 states and 92383 transitions. [2025-03-08 02:09:37,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:37,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 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 484 [2025-03-08 02:09:37,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:37,544 INFO L225 Difference]: With dead ends: 80766 [2025-03-08 02:09:37,544 INFO L226 Difference]: Without dead ends: 43595 [2025-03-08 02:09:37,576 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:09:37,576 INFO L435 NwaCegarLoop]: 777 mSDtfsCounter, 372 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:37,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 846 Invalid, 1448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:09:37,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43595 states. [2025-03-08 02:09:37,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43595 to 38898. [2025-03-08 02:09:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38898 states, 38897 states have (on average 1.1182610484099031) internal successors, (43497), 38897 states have internal predecessors, (43497), 0 states have call successors, (0), 0 states 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:09:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38898 states to 38898 states and 43497 transitions. [2025-03-08 02:09:38,009 INFO L78 Accepts]: Start accepts. Automaton has 38898 states and 43497 transitions. Word has length 484 [2025-03-08 02:09:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:38,010 INFO L471 AbstractCegarLoop]: Abstraction has 38898 states and 43497 transitions. [2025-03-08 02:09:38,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 0 states have call successors, (0), 0 states 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:09:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 38898 states and 43497 transitions. [2025-03-08 02:09:38,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-08 02:09:38,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:38,018 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:38,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:09:38,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:38,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:38,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1089412888, now seen corresponding path program 1 times [2025-03-08 02:09:38,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:38,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684473645] [2025-03-08 02:09:38,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:38,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:38,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 02:09:38,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 02:09:38,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:38,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:38,268 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-08 02:09:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:38,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684473645] [2025-03-08 02:09:38,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684473645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:38,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:38,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:38,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549559093] [2025-03-08 02:09:38,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:38,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:38,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:38,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:38,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:38,270 INFO L87 Difference]: Start difference. First operand 38898 states and 43497 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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:09:39,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:39,718 INFO L93 Difference]: Finished difference Result 90994 states and 101594 transitions. [2025-03-08 02:09:39,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:39,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 486 [2025-03-08 02:09:39,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:39,781 INFO L225 Difference]: With dead ends: 90994 [2025-03-08 02:09:39,781 INFO L226 Difference]: Without dead ends: 51666 [2025-03-08 02:09:39,802 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:09:39,802 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 472 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:39,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 165 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-08 02:09:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51666 states. [2025-03-08 02:09:40,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51666 to 49095. [2025-03-08 02:09:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49095 states, 49094 states have (on average 1.117101886177537) internal successors, (54843), 49094 states have internal predecessors, (54843), 0 states have call successors, (0), 0 states 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:09:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49095 states to 49095 states and 54843 transitions. [2025-03-08 02:09:40,194 INFO L78 Accepts]: Start accepts. Automaton has 49095 states and 54843 transitions. Word has length 486 [2025-03-08 02:09:40,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:40,194 INFO L471 AbstractCegarLoop]: Abstraction has 49095 states and 54843 transitions. [2025-03-08 02:09:40,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states 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:09:40,194 INFO L276 IsEmpty]: Start isEmpty. Operand 49095 states and 54843 transitions. [2025-03-08 02:09:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-08 02:09:40,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:40,202 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:40,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:09:40,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:40,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash 931635571, now seen corresponding path program 1 times [2025-03-08 02:09:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:40,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851934734] [2025-03-08 02:09:40,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:40,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:40,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-08 02:09:40,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-08 02:09:40,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:40,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:40,568 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 456 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 02:09:40,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:40,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851934734] [2025-03-08 02:09:40,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851934734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:40,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:40,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:40,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401706293] [2025-03-08 02:09:40,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:40,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:40,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:40,572 INFO L87 Difference]: Start difference. First operand 49095 states and 54843 transitions. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:09:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:41,890 INFO L93 Difference]: Finished difference Result 111375 states and 124283 transitions. [2025-03-08 02:09:41,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:41,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 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 494 [2025-03-08 02:09:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:41,961 INFO L225 Difference]: With dead ends: 111375 [2025-03-08 02:09:41,961 INFO L226 Difference]: Without dead ends: 57605 [2025-03-08 02:09:41,987 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:09:41,988 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 280 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1165 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:41,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 778 Invalid, 1385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1165 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:09:42,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57605 states. [2025-03-08 02:09:42,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57605 to 45663. [2025-03-08 02:09:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45663 states, 45662 states have (on average 1.11777845911261) internal successors, (51040), 45662 states have internal predecessors, (51040), 0 states have call successors, (0), 0 states 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:09:42,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45663 states to 45663 states and 51040 transitions. [2025-03-08 02:09:42,596 INFO L78 Accepts]: Start accepts. Automaton has 45663 states and 51040 transitions. Word has length 494 [2025-03-08 02:09:42,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:42,596 INFO L471 AbstractCegarLoop]: Abstraction has 45663 states and 51040 transitions. [2025-03-08 02:09:42,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states 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:09:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 45663 states and 51040 transitions. [2025-03-08 02:09:42,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-08 02:09:42,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:42,616 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:42,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:09:42,616 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:42,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:42,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2005206912, now seen corresponding path program 1 times [2025-03-08 02:09:42,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:42,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515401848] [2025-03-08 02:09:42,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:42,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:42,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-08 02:09:42,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-08 02:09:42,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:42,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 447 proven. 0 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2025-03-08 02:09:42,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:42,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515401848] [2025-03-08 02:09:42,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515401848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:42,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:42,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:42,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846145515] [2025-03-08 02:09:42,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:42,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:42,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:42,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:42,872 INFO L87 Difference]: Start difference. First operand 45663 states and 51040 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:44,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:44,245 INFO L93 Difference]: Finished difference Result 100253 states and 111804 transitions. [2025-03-08 02:09:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:44,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 594 [2025-03-08 02:09:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:44,302 INFO L225 Difference]: With dead ends: 100253 [2025-03-08 02:09:44,302 INFO L226 Difference]: Without dead ends: 50758 [2025-03-08 02:09:44,334 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:09:44,334 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 493 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:44,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 703 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:09:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50758 states. [2025-03-08 02:09:44,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50758 to 49054. [2025-03-08 02:09:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49054 states, 49053 states have (on average 1.105029254072126) internal successors, (54205), 49053 states have internal predecessors, (54205), 0 states have call successors, (0), 0 states 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:09:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49054 states to 49054 states and 54205 transitions. [2025-03-08 02:09:44,906 INFO L78 Accepts]: Start accepts. Automaton has 49054 states and 54205 transitions. Word has length 594 [2025-03-08 02:09:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:44,907 INFO L471 AbstractCegarLoop]: Abstraction has 49054 states and 54205 transitions. [2025-03-08 02:09:44,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:09:44,907 INFO L276 IsEmpty]: Start isEmpty. Operand 49054 states and 54205 transitions. [2025-03-08 02:09:44,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2025-03-08 02:09:44,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:44,921 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:44,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:09:44,921 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:44,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:44,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1576791653, now seen corresponding path program 1 times [2025-03-08 02:09:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966515870] [2025-03-08 02:09:44,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:44,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:44,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes. [2025-03-08 02:09:44,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements. [2025-03-08 02:09:44,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:44,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:45,648 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-08 02:09:45,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:45,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966515870] [2025-03-08 02:09:45,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966515870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:45,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:45,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:45,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652282646] [2025-03-08 02:09:45,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:45,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:45,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:45,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:45,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:45,650 INFO L87 Difference]: Start difference. First operand 49054 states and 54205 transitions. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:09:46,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:46,642 INFO L93 Difference]: Finished difference Result 98105 states and 108407 transitions. [2025-03-08 02:09:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:46,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 618 [2025-03-08 02:09:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:46,687 INFO L225 Difference]: With dead ends: 98105 [2025-03-08 02:09:46,687 INFO L226 Difference]: Without dead ends: 49053 [2025-03-08 02:09:46,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:09:46,710 INFO L435 NwaCegarLoop]: 530 mSDtfsCounter, 573 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:46,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 547 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:09:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49053 states. [2025-03-08 02:09:47,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49053 to 49053. [2025-03-08 02:09:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49053 states, 49052 states have (on average 1.1048683030253608) internal successors, (54196), 49052 states have internal predecessors, (54196), 0 states have call successors, (0), 0 states 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:09:47,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49053 states to 49053 states and 54196 transitions. [2025-03-08 02:09:47,223 INFO L78 Accepts]: Start accepts. Automaton has 49053 states and 54196 transitions. Word has length 618 [2025-03-08 02:09:47,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:47,223 INFO L471 AbstractCegarLoop]: Abstraction has 49053 states and 54196 transitions. [2025-03-08 02:09:47,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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:09:47,223 INFO L276 IsEmpty]: Start isEmpty. Operand 49053 states and 54196 transitions. [2025-03-08 02:09:47,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-08 02:09:47,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:47,241 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:47,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:09:47,241 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:47,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:47,241 INFO L85 PathProgramCache]: Analyzing trace with hash 90242297, now seen corresponding path program 1 times [2025-03-08 02:09:47,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829279519] [2025-03-08 02:09:47,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:47,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:47,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-08 02:09:47,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-08 02:09:47,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:47,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-03-08 02:09:47,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:47,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829279519] [2025-03-08 02:09:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829279519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:47,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:47,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401767795] [2025-03-08 02:09:47,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:47,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:47,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:47,447 INFO L87 Difference]: Start difference. First operand 49053 states and 54196 transitions. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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:09:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:48,621 INFO L93 Difference]: Finished difference Result 105755 states and 116621 transitions. [2025-03-08 02:09:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:48,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 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 703 [2025-03-08 02:09:48,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:48,675 INFO L225 Difference]: With dead ends: 105755 [2025-03-08 02:09:48,675 INFO L226 Difference]: Without dead ends: 56275 [2025-03-08 02:09:48,707 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:09:48,707 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 428 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:48,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 286 Invalid, 1369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:48,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56275 states. [2025-03-08 02:09:49,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56275 to 52020. [2025-03-08 02:09:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52020 states, 52019 states have (on average 1.0968684519118015) internal successors, (57058), 52019 states have internal predecessors, (57058), 0 states have call successors, (0), 0 states 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:09:49,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52020 states to 52020 states and 57058 transitions. [2025-03-08 02:09:49,396 INFO L78 Accepts]: Start accepts. Automaton has 52020 states and 57058 transitions. Word has length 703 [2025-03-08 02:09:49,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:49,396 INFO L471 AbstractCegarLoop]: Abstraction has 52020 states and 57058 transitions. [2025-03-08 02:09:49,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states 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:09:49,396 INFO L276 IsEmpty]: Start isEmpty. Operand 52020 states and 57058 transitions. [2025-03-08 02:09:49,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 808 [2025-03-08 02:09:49,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:49,431 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:49,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:09:49,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:49,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 964880822, now seen corresponding path program 1 times [2025-03-08 02:09:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165504550] [2025-03-08 02:09:49,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:49,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:49,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-03-08 02:09:49,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-03-08 02:09:49,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:49,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:50,296 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 523 proven. 189 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:09:50,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:50,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165504550] [2025-03-08 02:09:50,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165504550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:09:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040563775] [2025-03-08 02:09:50,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:50,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:09:50,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:09:50,299 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:09:50,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 02:09:50,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 807 statements into 1 equivalence classes. [2025-03-08 02:09:50,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 807 of 807 statements. [2025-03-08 02:09:50,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:50,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:50,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:09:50,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:09:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 523 proven. 189 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:09:51,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:09:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 523 proven. 189 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-08 02:09:52,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040563775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:09:52,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:09:52,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-08 02:09:52,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214385728] [2025-03-08 02:09:52,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:09:52,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:09:52,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:52,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:09:52,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:09:52,250 INFO L87 Difference]: Start difference. First operand 52020 states and 57058 transitions. Second operand has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states 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:09:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:54,889 INFO L93 Difference]: Finished difference Result 111713 states and 122489 transitions. [2025-03-08 02:09:54,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:09:54,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 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 807 [2025-03-08 02:09:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:54,949 INFO L225 Difference]: With dead ends: 111713 [2025-03-08 02:09:54,949 INFO L226 Difference]: Without dead ends: 59267 [2025-03-08 02:09:54,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1618 GetRequests, 1612 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:09:54,982 INFO L435 NwaCegarLoop]: 664 mSDtfsCounter, 886 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 3256 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 3564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 3256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:54,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 787 Invalid, 3564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 3256 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-08 02:09:55,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59267 states. [2025-03-08 02:09:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59267 to 52444. [2025-03-08 02:09:55,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52444 states, 52443 states have (on average 1.0909749632934806) internal successors, (57214), 52443 states have internal predecessors, (57214), 0 states have call successors, (0), 0 states 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:09:55,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52444 states to 52444 states and 57214 transitions. [2025-03-08 02:09:55,643 INFO L78 Accepts]: Start accepts. Automaton has 52444 states and 57214 transitions. Word has length 807 [2025-03-08 02:09:55,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:55,643 INFO L471 AbstractCegarLoop]: Abstraction has 52444 states and 57214 transitions. [2025-03-08 02:09:55,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.83333333333334) internal successors, (1319), 6 states have internal predecessors, (1319), 0 states have call successors, (0), 0 states 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:09:55,644 INFO L276 IsEmpty]: Start isEmpty. Operand 52444 states and 57214 transitions. [2025-03-08 02:09:55,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 817 [2025-03-08 02:09:55,667 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:55,667 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:55,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 02:09:55,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 02:09:55,867 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:55,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:55,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1346125598, now seen corresponding path program 1 times [2025-03-08 02:09:55,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:55,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793236077] [2025-03-08 02:09:55,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:55,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:55,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 816 statements into 1 equivalence classes. [2025-03-08 02:09:55,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 816 of 816 statements. [2025-03-08 02:09:55,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:55,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1258 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 1014 trivial. 0 not checked. [2025-03-08 02:09:56,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:56,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793236077] [2025-03-08 02:09:56,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793236077] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:56,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:56,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:09:56,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126002650] [2025-03-08 02:09:56,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:56,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:09:56,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:56,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:09:56,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:09:56,147 INFO L87 Difference]: Start difference. First operand 52444 states and 57214 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:09:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:09:57,326 INFO L93 Difference]: Finished difference Result 111248 states and 120835 transitions. [2025-03-08 02:09:57,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:09:57,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 816 [2025-03-08 02:09:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:09:57,384 INFO L225 Difference]: With dead ends: 111248 [2025-03-08 02:09:57,384 INFO L226 Difference]: Without dead ends: 55830 [2025-03-08 02:09:57,416 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:09:57,416 INFO L435 NwaCegarLoop]: 665 mSDtfsCounter, 449 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:09:57,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 709 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:09:57,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55830 states. [2025-03-08 02:09:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55830 to 53702. [2025-03-08 02:09:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53702 states, 53701 states have (on average 1.077819779892367) internal successors, (57880), 53701 states have internal predecessors, (57880), 0 states have call successors, (0), 0 states 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:09:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53702 states to 53702 states and 57880 transitions. [2025-03-08 02:09:57,860 INFO L78 Accepts]: Start accepts. Automaton has 53702 states and 57880 transitions. Word has length 816 [2025-03-08 02:09:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:09:57,861 INFO L471 AbstractCegarLoop]: Abstraction has 53702 states and 57880 transitions. [2025-03-08 02:09:57,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states 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:09:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 53702 states and 57880 transitions. [2025-03-08 02:09:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2025-03-08 02:09:57,885 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:09:57,886 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:57,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:09:57,886 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:09:57,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:09:57,886 INFO L85 PathProgramCache]: Analyzing trace with hash -287101915, now seen corresponding path program 1 times [2025-03-08 02:09:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:09:57,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485219814] [2025-03-08 02:09:57,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:09:57,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:09:58,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 864 statements into 1 equivalence classes. [2025-03-08 02:09:58,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 864 of 864 statements. [2025-03-08 02:09:58,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:09:58,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:09:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1323 backedges. 1025 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2025-03-08 02:09:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:09:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485219814] [2025-03-08 02:09:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485219814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:09:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:09:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:09:58,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338407221] [2025-03-08 02:09:58,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:09:58,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:09:58,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:09:58,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:09:58,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:09:58,854 INFO L87 Difference]: Start difference. First operand 53702 states and 57880 transitions. Second operand has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:10:00,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:00,805 INFO L93 Difference]: Finished difference Result 128288 states and 138199 transitions. [2025-03-08 02:10:00,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:00,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 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 864 [2025-03-08 02:10:00,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:00,878 INFO L225 Difference]: With dead ends: 128288 [2025-03-08 02:10:00,879 INFO L226 Difference]: Without dead ends: 74588 [2025-03-08 02:10:00,919 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:10:00,919 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 751 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:00,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 156 Invalid, 2570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 2248 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-08 02:10:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74588 states. [2025-03-08 02:10:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74588 to 72454. [2025-03-08 02:10:01,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72454 states, 72453 states have (on average 1.0766841952714172) internal successors, (78009), 72453 states have internal predecessors, (78009), 0 states have call successors, (0), 0 states 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:10:01,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72454 states to 72454 states and 78009 transitions. [2025-03-08 02:10:01,653 INFO L78 Accepts]: Start accepts. Automaton has 72454 states and 78009 transitions. Word has length 864 [2025-03-08 02:10:01,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:01,654 INFO L471 AbstractCegarLoop]: Abstraction has 72454 states and 78009 transitions. [2025-03-08 02:10:01,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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:10:01,654 INFO L276 IsEmpty]: Start isEmpty. Operand 72454 states and 78009 transitions. [2025-03-08 02:10:01,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 936 [2025-03-08 02:10:01,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:01,700 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:01,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 02:10:01,700 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:01,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:01,700 INFO L85 PathProgramCache]: Analyzing trace with hash 2066401421, now seen corresponding path program 1 times [2025-03-08 02:10:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740332225] [2025-03-08 02:10:01,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:01,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 935 statements into 1 equivalence classes. [2025-03-08 02:10:01,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 935 of 935 statements. [2025-03-08 02:10:01,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:01,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:02,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1478 backedges. 1147 proven. 0 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2025-03-08 02:10:02,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:02,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740332225] [2025-03-08 02:10:02,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740332225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:02,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:02,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:02,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806794576] [2025-03-08 02:10:02,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:02,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:02,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:02,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:02,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:02,647 INFO L87 Difference]: Start difference. First operand 72454 states and 78009 transitions. Second operand has 4 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:10:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:04,587 INFO L93 Difference]: Finished difference Result 156821 states and 168566 transitions. [2025-03-08 02:10:04,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:04,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 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 935 [2025-03-08 02:10:04,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:04,669 INFO L225 Difference]: With dead ends: 156821 [2025-03-08 02:10:04,669 INFO L226 Difference]: Without dead ends: 84369 [2025-03-08 02:10:04,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:04,712 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 609 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:04,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 332 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:10:04,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84369 states. [2025-03-08 02:10:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84369 to 80539. [2025-03-08 02:10:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80539 states, 80538 states have (on average 1.0741637487893914) internal successors, (86511), 80538 states have internal predecessors, (86511), 0 states have call successors, (0), 0 states 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:10:05,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80539 states to 80539 states and 86511 transitions. [2025-03-08 02:10:05,428 INFO L78 Accepts]: Start accepts. Automaton has 80539 states and 86511 transitions. Word has length 935 [2025-03-08 02:10:05,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:05,429 INFO L471 AbstractCegarLoop]: Abstraction has 80539 states and 86511 transitions. [2025-03-08 02:10:05,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 0 states 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:10:05,429 INFO L276 IsEmpty]: Start isEmpty. Operand 80539 states and 86511 transitions. [2025-03-08 02:10:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 937 [2025-03-08 02:10:05,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:05,464 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:05,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:10:05,464 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 764742569, now seen corresponding path program 1 times [2025-03-08 02:10:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:05,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093006921] [2025-03-08 02:10:05,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:05,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:05,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 936 statements into 1 equivalence classes. [2025-03-08 02:10:05,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 936 of 936 statements. [2025-03-08 02:10:05,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:05,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:05,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1509 backedges. 900 proven. 0 refuted. 0 times theorem prover too weak. 609 trivial. 0 not checked. [2025-03-08 02:10:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:05,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093006921] [2025-03-08 02:10:05,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093006921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:05,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:05,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:05,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013580406] [2025-03-08 02:10:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:05,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:05,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:05,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:05,697 INFO L87 Difference]: Start difference. First operand 80539 states and 86511 transitions. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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:10:07,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:07,029 INFO L93 Difference]: Finished difference Result 166185 states and 178505 transitions. [2025-03-08 02:10:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 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 936 [2025-03-08 02:10:07,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:07,125 INFO L225 Difference]: With dead ends: 166185 [2025-03-08 02:10:07,125 INFO L226 Difference]: Without dead ends: 85648 [2025-03-08 02:10:07,177 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:10:07,178 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 485 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:07,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 206 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:10:07,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85648 states. [2025-03-08 02:10:08,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85648 to 81388. [2025-03-08 02:10:08,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81388 states, 81387 states have (on average 1.0720631059014338) internal successors, (87252), 81387 states have internal predecessors, (87252), 0 states have call successors, (0), 0 states 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:10:08,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81388 states to 81388 states and 87252 transitions. [2025-03-08 02:10:08,247 INFO L78 Accepts]: Start accepts. Automaton has 81388 states and 87252 transitions. Word has length 936 [2025-03-08 02:10:08,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:08,248 INFO L471 AbstractCegarLoop]: Abstraction has 81388 states and 87252 transitions. [2025-03-08 02:10:08,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states 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:10:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 81388 states and 87252 transitions. [2025-03-08 02:10:08,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 968 [2025-03-08 02:10:08,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:08,314 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:08,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:10:08,314 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:08,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:08,314 INFO L85 PathProgramCache]: Analyzing trace with hash -614416586, now seen corresponding path program 1 times [2025-03-08 02:10:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:08,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394616982] [2025-03-08 02:10:08,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:08,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:08,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 967 statements into 1 equivalence classes. [2025-03-08 02:10:08,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 967 of 967 statements. [2025-03-08 02:10:08,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:08,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 1530 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2025-03-08 02:10:08,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:08,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394616982] [2025-03-08 02:10:08,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394616982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:08,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:08,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:08,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019619483] [2025-03-08 02:10:08,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:08,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:08,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:08,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:08,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:08,776 INFO L87 Difference]: Start difference. First operand 81388 states and 87252 transitions. Second operand has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:10:10,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:10,761 INFO L93 Difference]: Finished difference Result 192148 states and 205627 transitions. [2025-03-08 02:10:10,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:10,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 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 967 [2025-03-08 02:10:10,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:10,875 INFO L225 Difference]: With dead ends: 192148 [2025-03-08 02:10:10,875 INFO L226 Difference]: Without dead ends: 109912 [2025-03-08 02:10:10,927 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:10:10,928 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 522 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2292 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:10,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 181 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2292 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:10:10,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109912 states. [2025-03-08 02:10:11,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109912 to 103957. [2025-03-08 02:10:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103957 states, 103956 states have (on average 1.0664800492516064) internal successors, (110867), 103956 states have internal predecessors, (110867), 0 states have call successors, (0), 0 states 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:10:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103957 states to 103957 states and 110867 transitions. [2025-03-08 02:10:12,129 INFO L78 Accepts]: Start accepts. Automaton has 103957 states and 110867 transitions. Word has length 967 [2025-03-08 02:10:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:12,129 INFO L471 AbstractCegarLoop]: Abstraction has 103957 states and 110867 transitions. [2025-03-08 02:10:12,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:10:12,129 INFO L276 IsEmpty]: Start isEmpty. Operand 103957 states and 110867 transitions. [2025-03-08 02:10:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 973 [2025-03-08 02:10:12,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:12,178 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:12,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 02:10:12,178 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:12,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:12,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1765116080, now seen corresponding path program 1 times [2025-03-08 02:10:12,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:12,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873567867] [2025-03-08 02:10:12,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:12,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 972 statements into 1 equivalence classes. [2025-03-08 02:10:12,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 972 of 972 statements. [2025-03-08 02:10:12,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:12,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:12,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1833 backedges. 1545 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-08 02:10:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873567867] [2025-03-08 02:10:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873567867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:12,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:10:12,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106507160] [2025-03-08 02:10:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:12,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:10:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:10:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:10:12,943 INFO L87 Difference]: Start difference. First operand 103957 states and 110867 transitions. Second operand has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:10:15,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:15,017 INFO L93 Difference]: Finished difference Result 232172 states and 247511 transitions. [2025-03-08 02:10:15,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:10:15,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 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 972 [2025-03-08 02:10:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:15,157 INFO L225 Difference]: With dead ends: 232172 [2025-03-08 02:10:15,157 INFO L226 Difference]: Without dead ends: 128217 [2025-03-08 02:10:15,220 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:10:15,220 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 540 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:15,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [540 Valid, 158 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-08 02:10:15,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128217 states. [2025-03-08 02:10:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128217 to 103532. [2025-03-08 02:10:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103532 states, 103531 states have (on average 1.0676802117240247) internal successors, (110538), 103531 states have internal predecessors, (110538), 0 states have call successors, (0), 0 states 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:10:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103532 states to 103532 states and 110538 transitions. [2025-03-08 02:10:16,652 INFO L78 Accepts]: Start accepts. Automaton has 103532 states and 110538 transitions. Word has length 972 [2025-03-08 02:10:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:16,652 INFO L471 AbstractCegarLoop]: Abstraction has 103532 states and 110538 transitions. [2025-03-08 02:10:16,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 191.25) internal successors, (765), 4 states have internal predecessors, (765), 0 states have call successors, (0), 0 states 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:10:16,652 INFO L276 IsEmpty]: Start isEmpty. Operand 103532 states and 110538 transitions. [2025-03-08 02:10:16,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1060 [2025-03-08 02:10:16,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:16,926 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:16,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 02:10:16,926 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:16,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash -867771472, now seen corresponding path program 1 times [2025-03-08 02:10:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:16,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105146375] [2025-03-08 02:10:16,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:16,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:17,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1059 statements into 1 equivalence classes. [2025-03-08 02:10:17,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1059 of 1059 statements. [2025-03-08 02:10:17,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:17,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2119 backedges. 1765 proven. 0 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2025-03-08 02:10:17,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:17,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105146375] [2025-03-08 02:10:17,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105146375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:17,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:17,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 02:10:17,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077915995] [2025-03-08 02:10:17,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:17,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 02:10:17,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:17,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 02:10:17,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:10:17,721 INFO L87 Difference]: Start difference. First operand 103532 states and 110538 transitions. Second operand has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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:10:20,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:20,535 INFO L93 Difference]: Finished difference Result 241981 states and 258525 transitions. [2025-03-08 02:10:20,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:10:20,535 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 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 1059 [2025-03-08 02:10:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:20,739 INFO L225 Difference]: With dead ends: 241981 [2025-03-08 02:10:20,739 INFO L226 Difference]: Without dead ends: 138451 [2025-03-08 02:10:20,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:10:20,819 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 1010 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 3198 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 3705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 3198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:20,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 194 Invalid, 3705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 3198 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-08 02:10:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138451 states. [2025-03-08 02:10:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138451 to 106936. [2025-03-08 02:10:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106936 states, 106935 states have (on average 1.0675737597606023) internal successors, (114161), 106935 states have internal predecessors, (114161), 0 states have call successors, (0), 0 states 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:10:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106936 states to 106936 states and 114161 transitions. [2025-03-08 02:10:22,193 INFO L78 Accepts]: Start accepts. Automaton has 106936 states and 114161 transitions. Word has length 1059 [2025-03-08 02:10:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:22,194 INFO L471 AbstractCegarLoop]: Abstraction has 106936 states and 114161 transitions. [2025-03-08 02:10:22,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 158.0) internal successors, (790), 5 states have internal predecessors, (790), 0 states have call successors, (0), 0 states 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:10:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 106936 states and 114161 transitions. [2025-03-08 02:10:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1066 [2025-03-08 02:10:22,246 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:22,246 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:22,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 02:10:22,246 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:22,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:22,247 INFO L85 PathProgramCache]: Analyzing trace with hash 2047963602, now seen corresponding path program 1 times [2025-03-08 02:10:22,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:22,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704038692] [2025-03-08 02:10:22,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:22,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:22,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1065 statements into 1 equivalence classes. [2025-03-08 02:10:22,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1065 of 1065 statements. [2025-03-08 02:10:22,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:22,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2030 backedges. 1194 proven. 0 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2025-03-08 02:10:22,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:22,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704038692] [2025-03-08 02:10:22,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704038692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:22,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:22,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:10:22,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317802294] [2025-03-08 02:10:22,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:22,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:22,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:22,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:22,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:22,788 INFO L87 Difference]: Start difference. First operand 106936 states and 114161 transitions. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 2 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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:10:23,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:23,668 INFO L93 Difference]: Finished difference Result 194259 states and 207127 transitions. [2025-03-08 02:10:23,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 2 states have internal predecessors, (528), 0 states have call successors, (0), 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 1065 [2025-03-08 02:10:23,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:23,763 INFO L225 Difference]: With dead ends: 194259 [2025-03-08 02:10:23,763 INFO L226 Difference]: Without dead ends: 87750 [2025-03-08 02:10:23,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:10:23,828 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 463 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:23,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 69 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:10:23,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87750 states. [2025-03-08 02:10:24,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87750 to 86898. [2025-03-08 02:10:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86898 states, 86897 states have (on average 1.0646512537832147) internal successors, (92515), 86897 states have internal predecessors, (92515), 0 states have call successors, (0), 0 states 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:10:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86898 states to 86898 states and 92515 transitions. [2025-03-08 02:10:24,629 INFO L78 Accepts]: Start accepts. Automaton has 86898 states and 92515 transitions. Word has length 1065 [2025-03-08 02:10:24,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:10:24,629 INFO L471 AbstractCegarLoop]: Abstraction has 86898 states and 92515 transitions. [2025-03-08 02:10:24,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 2 states have internal predecessors, (528), 0 states have call successors, (0), 0 states 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:10:24,629 INFO L276 IsEmpty]: Start isEmpty. Operand 86898 states and 92515 transitions. [2025-03-08 02:10:24,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1152 [2025-03-08 02:10:24,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:10:24,704 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10:24,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 02:10:24,704 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:10:24,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:10:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash 155015077, now seen corresponding path program 1 times [2025-03-08 02:10:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:10:24,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949308490] [2025-03-08 02:10:24,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:10:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:10:24,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1151 statements into 1 equivalence classes. [2025-03-08 02:10:25,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1151 of 1151 statements. [2025-03-08 02:10:25,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:10:25,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:10:25,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2618 backedges. 1702 proven. 0 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2025-03-08 02:10:25,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:10:25,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949308490] [2025-03-08 02:10:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949308490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:10:25,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:10:25,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:10:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918686213] [2025-03-08 02:10:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:10:25,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:10:25,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:10:25,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:10:25,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:10:25,747 INFO L87 Difference]: Start difference. First operand 86898 states and 92515 transitions. Second operand has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:10:27,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:10:27,034 INFO L93 Difference]: Finished difference Result 181467 states and 193206 transitions. [2025-03-08 02:10:27,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:10:27,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.66666666666666) internal successors, (644), 3 states have internal predecessors, (644), 0 states have call successors, (0), 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 1151 [2025-03-08 02:10:27,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:10:27,141 INFO L225 Difference]: With dead ends: 181467 [2025-03-08 02:10:27,141 INFO L226 Difference]: Without dead ends: 94996 [2025-03-08 02:10:27,194 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:10:27,195 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 319 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1111 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:10:27,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 195 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1111 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:10:27,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94996 states.