./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/toy.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/toy.cil.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 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:44:49,168 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:44:49,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:44:49,217 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:44:49,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:44:49,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:44:49,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:44:49,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:44:49,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:44:49,241 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:44:49,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:44:49,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:44:49,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:44:49,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:44:49,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:44:49,243 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:44:49,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:44:49,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:44:49,244 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:44:49,244 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:44:49,244 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:44:49,244 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:44:49,244 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 -> 4a8eabec1830ab654b41f6937ec2f9359cd3dd371ede66eafc352bac48edda3b [2025-03-03 14:44:49,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:44:49,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:44:49,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:44:49,487 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:44:49,487 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:44:49,488 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy.cil.c [2025-03-03 14:44:50,644 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d372660/a041abf6cd2e47c38ebdbd3aee7b129f/FLAGb0b8cbbf7 [2025-03-03 14:44:50,901 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:44:50,902 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy.cil.c [2025-03-03 14:44:50,911 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d372660/a041abf6cd2e47c38ebdbd3aee7b129f/FLAGb0b8cbbf7 [2025-03-03 14:44:50,922 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1d372660/a041abf6cd2e47c38ebdbd3aee7b129f [2025-03-03 14:44:50,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:44:50,925 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:44:50,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:50,926 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:44:50,930 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:44:50,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:50" (1/1) ... [2025-03-03 14:44:50,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ae1edf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:50, skipping insertion in model container [2025-03-03 14:44:50,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:44:50" (1/1) ... [2025-03-03 14:44:50,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:44:51,053 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/systemc/toy.cil.c[697,710] [2025-03-03 14:44:51,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:51,120 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:44:51,128 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/systemc/toy.cil.c[697,710] [2025-03-03 14:44:51,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:44:51,189 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:44:51,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51 WrapperNode [2025-03-03 14:44:51,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:44:51,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:51,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:44:51,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:44:51,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,228 INFO L138 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 348 [2025-03-03 14:44:51,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:44:51,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:44:51,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:44:51,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:44:51,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,261 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:44:51,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,268 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,277 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:44:51,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:44:51,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:44:51,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:44:51,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (1/1) ... [2025-03-03 14:44:51,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:44:51,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:44:51,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:44:51,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:44:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:44:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:44:51,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:44:51,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:44:51,381 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:44:51,382 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:44:51,695 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-03-03 14:44:51,695 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:44:51,706 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:44:51,706 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:44:51,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:51 BoogieIcfgContainer [2025-03-03 14:44:51,707 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:44:51,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:44:51,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:44:51,712 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:44:51,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:44:50" (1/3) ... [2025-03-03 14:44:51,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48da770d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:51, skipping insertion in model container [2025-03-03 14:44:51,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:44:51" (2/3) ... [2025-03-03 14:44:51,713 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48da770d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:44:51, skipping insertion in model container [2025-03-03 14:44:51,713 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:44:51" (3/3) ... [2025-03-03 14:44:51,714 INFO L128 eAbstractionObserver]: Analyzing ICFG toy.cil.c [2025-03-03 14:44:51,725 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:44:51,728 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG toy.cil.c that has 1 procedures, 136 locations, 1 initial locations, 6 loop locations, and 1 error locations. [2025-03-03 14:44:51,781 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:44:51,793 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;@26ab5c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:44:51,794 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:44:51,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:51,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:51,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:51,805 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] [2025-03-03 14:44:51,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:51,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:51,810 INFO L85 PathProgramCache]: Analyzing trace with hash -515177827, now seen corresponding path program 1 times [2025-03-03 14:44:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:51,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253514497] [2025-03-03 14:44:51,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:51,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:51,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:51,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:51,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:51,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:52,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:52,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:52,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253514497] [2025-03-03 14:44:52,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253514497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:52,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:52,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599776196] [2025-03-03 14:44:52,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:52,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:52,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:52,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:52,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:52,100 INFO L87 Difference]: Start difference. First operand has 136 states, 134 states have (on average 1.7686567164179106) internal successors, (237), 135 states have internal predecessors, (237), 0 states have call successors, (0), 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 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:52,129 INFO L93 Difference]: Finished difference Result 265 states and 464 transitions. [2025-03-03 14:44:52,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:52,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:52,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:52,138 INFO L225 Difference]: With dead ends: 265 [2025-03-03 14:44:52,138 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 14:44:52,142 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-03 14:44:52,145 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:52,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:52,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 14:44:52,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-03 14:44:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.7230769230769232) internal successors, (224), 130 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 224 transitions. [2025-03-03 14:44:52,178 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 224 transitions. Word has length 36 [2025-03-03 14:44:52,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:52,179 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 224 transitions. [2025-03-03 14:44:52,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,179 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 224 transitions. [2025-03-03 14:44:52,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:52,180 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:52,180 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] [2025-03-03 14:44:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:44:52,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:52,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1668499100, now seen corresponding path program 1 times [2025-03-03 14:44:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126930259] [2025-03-03 14:44:52,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:52,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:52,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:52,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:52,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:52,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:52,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:52,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126930259] [2025-03-03 14:44:52,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126930259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:52,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:52,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:52,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978174698] [2025-03-03 14:44:52,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:52,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:52,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:52,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:52,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:52,262 INFO L87 Difference]: Start difference. First operand 131 states and 224 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:52,321 INFO L93 Difference]: Finished difference Result 355 states and 604 transitions. [2025-03-03 14:44:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:52,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:52,323 INFO L225 Difference]: With dead ends: 355 [2025-03-03 14:44:52,325 INFO L226 Difference]: Without dead ends: 227 [2025-03-03 14:44:52,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:52,326 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 586 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:52,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 378 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:52,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-03 14:44:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2025-03-03 14:44:52,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6995515695067265) internal successors, (379), 223 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 379 transitions. [2025-03-03 14:44:52,358 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 379 transitions. Word has length 36 [2025-03-03 14:44:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:52,359 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 379 transitions. [2025-03-03 14:44:52,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 379 transitions. [2025-03-03 14:44:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:52,359 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:52,359 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] [2025-03-03 14:44:52,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 14:44:52,360 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:52,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1933366499, now seen corresponding path program 1 times [2025-03-03 14:44:52,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:52,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274244171] [2025-03-03 14:44:52,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:52,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:52,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:52,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:52,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:52,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:52,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:52,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:52,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274244171] [2025-03-03 14:44:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274244171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:52,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:52,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855261003] [2025-03-03 14:44:52,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:52,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:52,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:52,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:52,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:52,455 INFO L87 Difference]: Start difference. First operand 224 states and 379 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:52,499 INFO L93 Difference]: Finished difference Result 439 states and 745 transitions. [2025-03-03 14:44:52,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:52,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:52,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:52,503 INFO L225 Difference]: With dead ends: 439 [2025-03-03 14:44:52,504 INFO L226 Difference]: Without dead ends: 224 [2025-03-03 14:44:52,505 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-03 14:44:52,508 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 193 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:52,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 207 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-03-03 14:44:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2025-03-03 14:44:52,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6457399103139014) internal successors, (367), 223 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 367 transitions. [2025-03-03 14:44:52,520 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 367 transitions. Word has length 36 [2025-03-03 14:44:52,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:52,520 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 367 transitions. [2025-03-03 14:44:52,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 367 transitions. [2025-03-03 14:44:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:52,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:52,521 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] [2025-03-03 14:44:52,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 14:44:52,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1596330075, now seen corresponding path program 1 times [2025-03-03 14:44:52,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:52,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017717178] [2025-03-03 14:44:52,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:52,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:52,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:52,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:52,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:52,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:52,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:52,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017717178] [2025-03-03 14:44:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017717178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:52,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:52,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:52,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289015965] [2025-03-03 14:44:52,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:52,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:52,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:52,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:52,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:52,576 INFO L87 Difference]: Start difference. First operand 224 states and 367 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:52,657 INFO L93 Difference]: Finished difference Result 613 states and 1004 transitions. [2025-03-03 14:44:52,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:44:52,658 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:52,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:52,659 INFO L225 Difference]: With dead ends: 613 [2025-03-03 14:44:52,660 INFO L226 Difference]: Without dead ends: 399 [2025-03-03 14:44:52,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:52,661 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 377 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:52,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 470 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:44:52,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-03 14:44:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 224. [2025-03-03 14:44:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6322869955156951) internal successors, (364), 223 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 364 transitions. [2025-03-03 14:44:52,688 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 364 transitions. Word has length 36 [2025-03-03 14:44:52,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:52,688 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 364 transitions. [2025-03-03 14:44:52,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 364 transitions. [2025-03-03 14:44:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:52,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:52,691 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] [2025-03-03 14:44:52,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 14:44:52,691 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:52,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:52,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1737023204, now seen corresponding path program 1 times [2025-03-03 14:44:52,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:52,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326253747] [2025-03-03 14:44:52,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:52,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:52,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:52,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:52,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:52,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:52,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:52,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:52,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326253747] [2025-03-03 14:44:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326253747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:52,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:52,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327296800] [2025-03-03 14:44:52,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:52,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:52,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:52,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:52,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:52,747 INFO L87 Difference]: Start difference. First operand 224 states and 364 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:52,818 INFO L93 Difference]: Finished difference Result 614 states and 998 transitions. [2025-03-03 14:44:52,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:44:52,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:52,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:52,823 INFO L225 Difference]: With dead ends: 614 [2025-03-03 14:44:52,823 INFO L226 Difference]: Without dead ends: 401 [2025-03-03 14:44:52,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:52,824 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 375 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:52,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 477 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:52,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-03 14:44:52,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 224. [2025-03-03 14:44:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 223 states have (on average 1.6188340807174888) internal successors, (361), 223 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-03 14:44:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 361 transitions. [2025-03-03 14:44:52,842 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 361 transitions. Word has length 36 [2025-03-03 14:44:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:52,842 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 361 transitions. [2025-03-03 14:44:52,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 361 transitions. [2025-03-03 14:44:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:52,843 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:52,843 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] [2025-03-03 14:44:52,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 14:44:52,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:52,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:52,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1706003397, now seen corresponding path program 1 times [2025-03-03 14:44:52,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:52,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807724876] [2025-03-03 14:44:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:52,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:52,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:52,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:52,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807724876] [2025-03-03 14:44:52,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807724876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:52,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074066318] [2025-03-03 14:44:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:52,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:52,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:52,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:52,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:52,907 INFO L87 Difference]: Start difference. First operand 224 states and 361 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:52,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:52,993 INFO L93 Difference]: Finished difference Result 767 states and 1232 transitions. [2025-03-03 14:44:52,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:44:52,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:52,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:52,996 INFO L225 Difference]: With dead ends: 767 [2025-03-03 14:44:52,996 INFO L226 Difference]: Without dead ends: 556 [2025-03-03 14:44:52,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:52,998 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 379 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:52,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 586 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:52,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-03 14:44:53,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 369. [2025-03-03 14:44:53,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 368 states have (on average 1.6005434782608696) internal successors, (589), 368 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 589 transitions. [2025-03-03 14:44:53,018 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 589 transitions. Word has length 36 [2025-03-03 14:44:53,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:53,019 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 589 transitions. [2025-03-03 14:44:53,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,020 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 589 transitions. [2025-03-03 14:44:53,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:53,020 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:53,023 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] [2025-03-03 14:44:53,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:44:53,023 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:53,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:53,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1773010150, now seen corresponding path program 1 times [2025-03-03 14:44:53,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:53,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143331775] [2025-03-03 14:44:53,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:53,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:53,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:53,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:53,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:53,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:53,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:53,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:53,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143331775] [2025-03-03 14:44:53,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143331775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:53,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:53,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:53,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071893052] [2025-03-03 14:44:53,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:53,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:53,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:53,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:53,075 INFO L87 Difference]: Start difference. First operand 369 states and 589 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:53,169 INFO L93 Difference]: Finished difference Result 1123 states and 1796 transitions. [2025-03-03 14:44:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:53,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:53,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:53,172 INFO L225 Difference]: With dead ends: 1123 [2025-03-03 14:44:53,172 INFO L226 Difference]: Without dead ends: 768 [2025-03-03 14:44:53,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:53,175 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 503 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:53,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 573 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:44:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2025-03-03 14:44:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 644. [2025-03-03 14:44:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 1.5863141524105755) internal successors, (1020), 643 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1020 transitions. [2025-03-03 14:44:53,204 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1020 transitions. Word has length 36 [2025-03-03 14:44:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:53,204 INFO L471 AbstractCegarLoop]: Abstraction has 644 states and 1020 transitions. [2025-03-03 14:44:53,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,205 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1020 transitions. [2025-03-03 14:44:53,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:53,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:53,206 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] [2025-03-03 14:44:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:44:53,206 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:53,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash 128318485, now seen corresponding path program 1 times [2025-03-03 14:44:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662543346] [2025-03-03 14:44:53,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:53,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:53,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:53,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:53,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:53,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:53,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:53,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662543346] [2025-03-03 14:44:53,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662543346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:53,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:53,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:53,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213359774] [2025-03-03 14:44:53,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:53,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:53,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:53,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:53,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:53,259 INFO L87 Difference]: Start difference. First operand 644 states and 1020 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:53,305 INFO L93 Difference]: Finished difference Result 1591 states and 2523 transitions. [2025-03-03 14:44:53,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:53,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:53,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:53,310 INFO L225 Difference]: With dead ends: 1591 [2025-03-03 14:44:53,310 INFO L226 Difference]: Without dead ends: 959 [2025-03-03 14:44:53,312 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-03 14:44:53,313 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 178 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:53,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 348 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:53,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-03 14:44:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 957. [2025-03-03 14:44:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.5679916317991631) internal successors, (1499), 956 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1499 transitions. [2025-03-03 14:44:53,373 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1499 transitions. Word has length 36 [2025-03-03 14:44:53,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:53,373 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1499 transitions. [2025-03-03 14:44:53,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,374 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1499 transitions. [2025-03-03 14:44:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:53,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:53,377 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:44:53,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:44:53,377 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:53,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:53,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1374312493, now seen corresponding path program 1 times [2025-03-03 14:44:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21517675] [2025-03-03 14:44:53,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:53,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:53,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:53,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:53,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:53,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:53,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:53,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21517675] [2025-03-03 14:44:53,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21517675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:53,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:53,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:53,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129991267] [2025-03-03 14:44:53,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:53,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:53,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:53,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:53,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:53,421 INFO L87 Difference]: Start difference. First operand 957 states and 1499 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:53,509 INFO L93 Difference]: Finished difference Result 2480 states and 3884 transitions. [2025-03-03 14:44:53,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:53,510 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:53,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:53,515 INFO L225 Difference]: With dead ends: 2480 [2025-03-03 14:44:53,515 INFO L226 Difference]: Without dead ends: 1539 [2025-03-03 14:44:53,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:53,518 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 489 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:53,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 336 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2025-03-03 14:44:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 957. [2025-03-03 14:44:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.5564853556485356) internal successors, (1488), 956 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1488 transitions. [2025-03-03 14:44:53,558 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1488 transitions. Word has length 36 [2025-03-03 14:44:53,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:53,558 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1488 transitions. [2025-03-03 14:44:53,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,558 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1488 transitions. [2025-03-03 14:44:53,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:53,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:53,559 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] [2025-03-03 14:44:53,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:44:53,559 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:53,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:53,559 INFO L85 PathProgramCache]: Analyzing trace with hash -21002796, now seen corresponding path program 1 times [2025-03-03 14:44:53,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:53,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865751871] [2025-03-03 14:44:53,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:53,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:53,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:53,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:53,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:53,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:53,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:53,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865751871] [2025-03-03 14:44:53,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865751871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:53,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:53,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:53,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843239968] [2025-03-03 14:44:53,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:53,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:53,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:53,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:53,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:53,591 INFO L87 Difference]: Start difference. First operand 957 states and 1488 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:53,694 INFO L93 Difference]: Finished difference Result 2484 states and 3845 transitions. [2025-03-03 14:44:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:53,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:53,699 INFO L225 Difference]: With dead ends: 2484 [2025-03-03 14:44:53,700 INFO L226 Difference]: Without dead ends: 1549 [2025-03-03 14:44:53,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:53,701 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 473 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:53,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 325 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1549 states. [2025-03-03 14:44:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1549 to 957. [2025-03-03 14:44:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 957 states, 956 states have (on average 1.5418410041841004) internal successors, (1474), 956 states have internal predecessors, (1474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 1474 transitions. [2025-03-03 14:44:53,738 INFO L78 Accepts]: Start accepts. Automaton has 957 states and 1474 transitions. Word has length 36 [2025-03-03 14:44:53,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:53,738 INFO L471 AbstractCegarLoop]: Abstraction has 957 states and 1474 transitions. [2025-03-03 14:44:53,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,739 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1474 transitions. [2025-03-03 14:44:53,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:53,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:53,739 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] [2025-03-03 14:44:53,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:44:53,739 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:53,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:53,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1486549013, now seen corresponding path program 1 times [2025-03-03 14:44:53,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:53,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386383605] [2025-03-03 14:44:53,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:53,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:53,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:53,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:53,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:53,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:53,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:53,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386383605] [2025-03-03 14:44:53,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386383605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:53,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:53,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:53,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119221356] [2025-03-03 14:44:53,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:53,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:53,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:53,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:53,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:53,773 INFO L87 Difference]: Start difference. First operand 957 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:53,848 INFO L93 Difference]: Finished difference Result 2162 states and 3318 transitions. [2025-03-03 14:44:53,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 14:44:53,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:53,853 INFO L225 Difference]: With dead ends: 2162 [2025-03-03 14:44:53,853 INFO L226 Difference]: Without dead ends: 1233 [2025-03-03 14:44:53,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:53,855 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 475 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:53,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 359 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-03-03 14:44:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1044. [2025-03-03 14:44:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 1043 states have (on average 1.516778523489933) internal successors, (1582), 1043 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1582 transitions. [2025-03-03 14:44:53,894 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1582 transitions. Word has length 36 [2025-03-03 14:44:53,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:53,894 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1582 transitions. [2025-03-03 14:44:53,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1582 transitions. [2025-03-03 14:44:53,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 14:44:53,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:53,895 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] [2025-03-03 14:44:53,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:44:53,895 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:53,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1193146006, now seen corresponding path program 1 times [2025-03-03 14:44:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584944288] [2025-03-03 14:44:53,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:53,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:53,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 14:44:53,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 14:44:53,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:53,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:53,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:53,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:53,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584944288] [2025-03-03 14:44:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584944288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:53,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:53,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073401869] [2025-03-03 14:44:53,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:53,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:53,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:53,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:53,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:53,931 INFO L87 Difference]: Start difference. First operand 1044 states and 1582 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:53,997 INFO L93 Difference]: Finished difference Result 2309 states and 3499 transitions. [2025-03-03 14:44:53,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 14:44:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:54,002 INFO L225 Difference]: With dead ends: 2309 [2025-03-03 14:44:54,002 INFO L226 Difference]: Without dead ends: 1280 [2025-03-03 14:44:54,004 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-03 14:44:54,005 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 121 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:54,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 320 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-03-03 14:44:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1277. [2025-03-03 14:44:54,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1276 states have (on average 1.5070532915360502) internal successors, (1923), 1276 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 1923 transitions. [2025-03-03 14:44:54,061 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 1923 transitions. Word has length 36 [2025-03-03 14:44:54,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:54,061 INFO L471 AbstractCegarLoop]: Abstraction has 1277 states and 1923 transitions. [2025-03-03 14:44:54,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 1923 transitions. [2025-03-03 14:44:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:44:54,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:54,062 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:54,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:44:54,062 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:54,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1228465586, now seen corresponding path program 1 times [2025-03-03 14:44:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:54,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789455557] [2025-03-03 14:44:54,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:54,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:44:54,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:44:54,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:54,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:54,102 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:54,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:54,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789455557] [2025-03-03 14:44:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789455557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:54,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855030718] [2025-03-03 14:44:54,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:54,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:54,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:54,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:54,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:54,105 INFO L87 Difference]: Start difference. First operand 1277 states and 1923 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:54,187 INFO L93 Difference]: Finished difference Result 3185 states and 4835 transitions. [2025-03-03 14:44:54,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:54,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2025-03-03 14:44:54,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:54,195 INFO L225 Difference]: With dead ends: 3185 [2025-03-03 14:44:54,195 INFO L226 Difference]: Without dead ends: 1935 [2025-03-03 14:44:54,197 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-03 14:44:54,197 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 84 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:54,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 426 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:54,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-03-03 14:44:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1933. [2025-03-03 14:44:54,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1933 states, 1932 states have (on average 1.5082815734989647) internal successors, (2914), 1932 states have internal predecessors, (2914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1933 states to 1933 states and 2914 transitions. [2025-03-03 14:44:54,287 INFO L78 Accepts]: Start accepts. Automaton has 1933 states and 2914 transitions. Word has length 47 [2025-03-03 14:44:54,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:54,288 INFO L471 AbstractCegarLoop]: Abstraction has 1933 states and 2914 transitions. [2025-03-03 14:44:54,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 1933 states and 2914 transitions. [2025-03-03 14:44:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 14:44:54,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:54,289 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:54,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:44:54,289 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:54,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1677162225, now seen corresponding path program 1 times [2025-03-03 14:44:54,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:54,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573897124] [2025-03-03 14:44:54,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:54,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:54,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 14:44:54,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 14:44:54,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:54,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:54,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:44:54,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:54,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573897124] [2025-03-03 14:44:54,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573897124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:54,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:54,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:54,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54045088] [2025-03-03 14:44:54,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:54,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:54,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:54,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:54,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:54,337 INFO L87 Difference]: Start difference. First operand 1933 states and 2914 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:54,412 INFO L93 Difference]: Finished difference Result 3817 states and 5768 transitions. [2025-03-03 14:44:54,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:54,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 47 [2025-03-03 14:44:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:54,420 INFO L225 Difference]: With dead ends: 3817 [2025-03-03 14:44:54,421 INFO L226 Difference]: Without dead ends: 1911 [2025-03-03 14:44:54,424 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-03 14:44:54,424 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:54,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 186 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:54,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2025-03-03 14:44:54,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1911. [2025-03-03 14:44:54,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1911 states, 1910 states have (on average 1.5109947643979058) internal successors, (2886), 1910 states have internal predecessors, (2886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1911 states to 1911 states and 2886 transitions. [2025-03-03 14:44:54,520 INFO L78 Accepts]: Start accepts. Automaton has 1911 states and 2886 transitions. Word has length 47 [2025-03-03 14:44:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:54,521 INFO L471 AbstractCegarLoop]: Abstraction has 1911 states and 2886 transitions. [2025-03-03 14:44:54,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 2886 transitions. [2025-03-03 14:44:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 14:44:54,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:54,521 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:54,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:44:54,522 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:54,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -919782336, now seen corresponding path program 1 times [2025-03-03 14:44:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:54,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544953524] [2025-03-03 14:44:54,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:54,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 14:44:54,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:44:54,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:54,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:54,545 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:54,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544953524] [2025-03-03 14:44:54,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544953524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:54,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:54,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:54,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148350091] [2025-03-03 14:44:54,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:54,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:54,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:54,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:54,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:54,546 INFO L87 Difference]: Start difference. First operand 1911 states and 2886 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:54,632 INFO L93 Difference]: Finished difference Result 4920 states and 7483 transitions. [2025-03-03 14:44:54,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:54,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2025-03-03 14:44:54,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:54,644 INFO L225 Difference]: With dead ends: 4920 [2025-03-03 14:44:54,644 INFO L226 Difference]: Without dead ends: 3036 [2025-03-03 14:44:54,648 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-03 14:44:54,648 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 83 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:54,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 407 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3036 states. [2025-03-03 14:44:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3036 to 3034. [2025-03-03 14:44:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3034 states, 3033 states have (on average 1.511045169798879) internal successors, (4583), 3033 states have internal predecessors, (4583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3034 states to 3034 states and 4583 transitions. [2025-03-03 14:44:54,755 INFO L78 Accepts]: Start accepts. Automaton has 3034 states and 4583 transitions. Word has length 48 [2025-03-03 14:44:54,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:54,756 INFO L471 AbstractCegarLoop]: Abstraction has 3034 states and 4583 transitions. [2025-03-03 14:44:54,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3034 states and 4583 transitions. [2025-03-03 14:44:54,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-03 14:44:54,758 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:54,758 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:54,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:44:54,758 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:54,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1368478975, now seen corresponding path program 1 times [2025-03-03 14:44:54,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:54,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155411651] [2025-03-03 14:44:54,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:54,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:54,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-03 14:44:54,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-03 14:44:54,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:54,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:44:54,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155411651] [2025-03-03 14:44:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155411651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:54,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:54,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:54,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408261294] [2025-03-03 14:44:54,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:54,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:54,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:54,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:54,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:54,789 INFO L87 Difference]: Start difference. First operand 3034 states and 4583 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:54,885 INFO L93 Difference]: Finished difference Result 6018 states and 9107 transitions. [2025-03-03 14:44:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:54,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-03 14:44:54,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:54,895 INFO L225 Difference]: With dead ends: 6018 [2025-03-03 14:44:54,895 INFO L226 Difference]: Without dead ends: 3013 [2025-03-03 14:44:54,898 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-03 14:44:54,899 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:54,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 185 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2025-03-03 14:44:54,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 3013. [2025-03-03 14:44:54,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3013 states, 3012 states have (on average 1.5129482071713147) internal successors, (4557), 3012 states have internal predecessors, (4557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3013 states to 3013 states and 4557 transitions. [2025-03-03 14:44:55,006 INFO L78 Accepts]: Start accepts. Automaton has 3013 states and 4557 transitions. Word has length 48 [2025-03-03 14:44:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:55,006 INFO L471 AbstractCegarLoop]: Abstraction has 3013 states and 4557 transitions. [2025-03-03 14:44:55,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3013 states and 4557 transitions. [2025-03-03 14:44:55,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 14:44:55,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:55,007 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:55,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:44:55,007 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:55,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash 896768132, now seen corresponding path program 1 times [2025-03-03 14:44:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:55,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724467173] [2025-03-03 14:44:55,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:55,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 14:44:55,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 14:44:55,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:55,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:55,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:55,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:55,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724467173] [2025-03-03 14:44:55,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724467173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:55,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:55,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:55,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702823007] [2025-03-03 14:44:55,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:55,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:55,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:55,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:55,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:55,032 INFO L87 Difference]: Start difference. First operand 3013 states and 4557 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:55,165 INFO L93 Difference]: Finished difference Result 8088 states and 12374 transitions. [2025-03-03 14:44:55,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:55,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2025-03-03 14:44:55,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:55,183 INFO L225 Difference]: With dead ends: 8088 [2025-03-03 14:44:55,184 INFO L226 Difference]: Without dead ends: 5104 [2025-03-03 14:44:55,188 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-03 14:44:55,189 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 88 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:55,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 393 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5104 states. [2025-03-03 14:44:55,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5104 to 5102. [2025-03-03 14:44:55,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5102 states, 5101 states have (on average 1.524014899039404) internal successors, (7774), 5101 states have internal predecessors, (7774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5102 states to 5102 states and 7774 transitions. [2025-03-03 14:44:55,340 INFO L78 Accepts]: Start accepts. Automaton has 5102 states and 7774 transitions. Word has length 49 [2025-03-03 14:44:55,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:55,341 INFO L471 AbstractCegarLoop]: Abstraction has 5102 states and 7774 transitions. [2025-03-03 14:44:55,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 5102 states and 7774 transitions. [2025-03-03 14:44:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 14:44:55,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:55,342 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:55,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:44:55,343 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:55,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:55,343 INFO L85 PathProgramCache]: Analyzing trace with hash 448071493, now seen corresponding path program 1 times [2025-03-03 14:44:55,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:55,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112968488] [2025-03-03 14:44:55,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:55,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:55,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-03 14:44:55,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 14:44:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:55,360 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 14:44:55,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:55,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112968488] [2025-03-03 14:44:55,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112968488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:55,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:55,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:55,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419842604] [2025-03-03 14:44:55,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:55,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:55,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:55,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:55,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:55,361 INFO L87 Difference]: Start difference. First operand 5102 states and 7774 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:55,537 INFO L93 Difference]: Finished difference Result 10153 states and 15490 transitions. [2025-03-03 14:44:55,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:55,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 49 [2025-03-03 14:44:55,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:55,549 INFO L225 Difference]: With dead ends: 10153 [2025-03-03 14:44:55,549 INFO L226 Difference]: Without dead ends: 5080 [2025-03-03 14:44:55,555 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-03 14:44:55,555 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 179 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:55,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 184 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5080 states. [2025-03-03 14:44:55,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5080 to 5080. [2025-03-03 14:44:55,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5080 states, 5079 states have (on average 1.5254971451073045) internal successors, (7748), 5079 states have internal predecessors, (7748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 7748 transitions. [2025-03-03 14:44:55,718 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 7748 transitions. Word has length 49 [2025-03-03 14:44:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:55,718 INFO L471 AbstractCegarLoop]: Abstraction has 5080 states and 7748 transitions. [2025-03-03 14:44:55,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 7748 transitions. [2025-03-03 14:44:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-03 14:44:55,719 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:55,719 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:55,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:44:55,719 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:55,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:55,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1230131702, now seen corresponding path program 1 times [2025-03-03 14:44:55,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:55,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127222961] [2025-03-03 14:44:55,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:55,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:55,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-03 14:44:55,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-03 14:44:55,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:55,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127222961] [2025-03-03 14:44:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127222961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:55,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041539830] [2025-03-03 14:44:55,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:55,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:55,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:55,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:55,769 INFO L87 Difference]: Start difference. First operand 5080 states and 7748 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:55,953 INFO L93 Difference]: Finished difference Result 12436 states and 18956 transitions. [2025-03-03 14:44:55,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:44:55,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2025-03-03 14:44:55,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:55,967 INFO L225 Difference]: With dead ends: 12436 [2025-03-03 14:44:55,968 INFO L226 Difference]: Without dead ends: 6587 [2025-03-03 14:44:55,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:55,977 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 384 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:55,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 290 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6587 states. [2025-03-03 14:44:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6587 to 6587. [2025-03-03 14:44:56,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6587 states, 6586 states have (on average 1.4952930458548437) internal successors, (9848), 6586 states have internal predecessors, (9848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6587 states to 6587 states and 9848 transitions. [2025-03-03 14:44:56,210 INFO L78 Accepts]: Start accepts. Automaton has 6587 states and 9848 transitions. Word has length 50 [2025-03-03 14:44:56,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:56,210 INFO L471 AbstractCegarLoop]: Abstraction has 6587 states and 9848 transitions. [2025-03-03 14:44:56,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:56,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6587 states and 9848 transitions. [2025-03-03 14:44:56,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-03 14:44:56,212 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:56,212 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:44:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:44:56,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:56,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:56,215 INFO L85 PathProgramCache]: Analyzing trace with hash -995044220, now seen corresponding path program 1 times [2025-03-03 14:44:56,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:56,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017649719] [2025-03-03 14:44:56,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:56,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-03 14:44:56,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-03 14:44:56,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:56,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:56,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017649719] [2025-03-03 14:44:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017649719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:56,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:56,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:44:56,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978632423] [2025-03-03 14:44:56,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:56,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:44:56,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:56,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:44:56,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:56,283 INFO L87 Difference]: Start difference. First operand 6587 states and 9848 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:56,604 INFO L93 Difference]: Finished difference Result 16297 states and 24247 transitions. [2025-03-03 14:44:56,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:44:56,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-03 14:44:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:56,627 INFO L225 Difference]: With dead ends: 16297 [2025-03-03 14:44:56,627 INFO L226 Difference]: Without dead ends: 9728 [2025-03-03 14:44:56,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:44:56,639 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 704 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:56,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 530 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:56,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9728 states. [2025-03-03 14:44:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9728 to 7198. [2025-03-03 14:44:56,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7198 states, 7197 states have (on average 1.4649159371960538) internal successors, (10543), 7197 states have internal predecessors, (10543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:56,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7198 states to 7198 states and 10543 transitions. [2025-03-03 14:44:56,982 INFO L78 Accepts]: Start accepts. Automaton has 7198 states and 10543 transitions. Word has length 56 [2025-03-03 14:44:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:56,982 INFO L471 AbstractCegarLoop]: Abstraction has 7198 states and 10543 transitions. [2025-03-03 14:44:56,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7198 states and 10543 transitions. [2025-03-03 14:44:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:44:56,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:56,986 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:44:56,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:44:56,986 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:56,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:56,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1986790900, now seen corresponding path program 1 times [2025-03-03 14:44:56,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:56,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511430547] [2025-03-03 14:44:56,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:56,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:56,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:44:56,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:44:56,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:56,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:57,021 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:57,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:57,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511430547] [2025-03-03 14:44:57,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511430547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:57,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:57,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:57,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480354592] [2025-03-03 14:44:57,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:57,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:57,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:57,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:57,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:57,023 INFO L87 Difference]: Start difference. First operand 7198 states and 10543 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:57,281 INFO L93 Difference]: Finished difference Result 14663 states and 21496 transitions. [2025-03-03 14:44:57,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:57,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2025-03-03 14:44:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:57,297 INFO L225 Difference]: With dead ends: 14663 [2025-03-03 14:44:57,297 INFO L226 Difference]: Without dead ends: 7494 [2025-03-03 14:44:57,307 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-03 14:44:57,307 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 129 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:57,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 320 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:57,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7494 states. [2025-03-03 14:44:57,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7494 to 7462. [2025-03-03 14:44:57,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7462 states, 7461 states have (on average 1.4288969307063397) internal successors, (10661), 7461 states have internal predecessors, (10661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7462 states to 7462 states and 10661 transitions. [2025-03-03 14:44:57,547 INFO L78 Accepts]: Start accepts. Automaton has 7462 states and 10661 transitions. Word has length 93 [2025-03-03 14:44:57,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:57,547 INFO L471 AbstractCegarLoop]: Abstraction has 7462 states and 10661 transitions. [2025-03-03 14:44:57,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:57,548 INFO L276 IsEmpty]: Start isEmpty. Operand 7462 states and 10661 transitions. [2025-03-03 14:44:57,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:44:57,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:57,552 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:44:57,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:44:57,552 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:57,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:57,552 INFO L85 PathProgramCache]: Analyzing trace with hash 979009057, now seen corresponding path program 1 times [2025-03-03 14:44:57,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:57,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029233432] [2025-03-03 14:44:57,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:57,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:57,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 14:44:57,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:44:57,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:57,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:57,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029233432] [2025-03-03 14:44:57,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029233432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:57,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:57,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62388158] [2025-03-03 14:44:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:57,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:57,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:57,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:57,582 INFO L87 Difference]: Start difference. First operand 7462 states and 10661 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:57,789 INFO L93 Difference]: Finished difference Result 15361 states and 21956 transitions. [2025-03-03 14:44:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 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 94 [2025-03-03 14:44:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:57,804 INFO L225 Difference]: With dead ends: 15361 [2025-03-03 14:44:57,804 INFO L226 Difference]: Without dead ends: 7940 [2025-03-03 14:44:57,810 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-03 14:44:57,811 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 129 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:57,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 319 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:57,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2025-03-03 14:44:58,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7892. [2025-03-03 14:44:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7892 states, 7891 states have (on average 1.3920922570016474) internal successors, (10985), 7891 states have internal predecessors, (10985), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:58,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7892 states to 7892 states and 10985 transitions. [2025-03-03 14:44:58,025 INFO L78 Accepts]: Start accepts. Automaton has 7892 states and 10985 transitions. Word has length 94 [2025-03-03 14:44:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:58,026 INFO L471 AbstractCegarLoop]: Abstraction has 7892 states and 10985 transitions. [2025-03-03 14:44:58,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7892 states and 10985 transitions. [2025-03-03 14:44:58,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-03 14:44:58,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:58,031 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:44:58,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:44:58,031 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:58,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1851160074, now seen corresponding path program 1 times [2025-03-03 14:44:58,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:58,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398795103] [2025-03-03 14:44:58,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:58,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:58,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-03 14:44:58,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-03 14:44:58,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:58,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:58,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 14:44:58,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398795103] [2025-03-03 14:44:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398795103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133473037] [2025-03-03 14:44:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:58,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:58,069 INFO L87 Difference]: Start difference. First operand 7892 states and 10985 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:58,275 INFO L93 Difference]: Finished difference Result 15990 states and 22320 transitions. [2025-03-03 14:44:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-03-03 14:44:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:58,290 INFO L225 Difference]: With dead ends: 15990 [2025-03-03 14:44:58,290 INFO L226 Difference]: Without dead ends: 8159 [2025-03-03 14:44:58,297 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-03 14:44:58,297 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 126 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:58,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 316 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:58,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8159 states. [2025-03-03 14:44:58,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8159 to 7438. [2025-03-03 14:44:58,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 7437 states have (on average 1.3372327551432028) internal successors, (9945), 7437 states have internal predecessors, (9945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:58,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9945 transitions. [2025-03-03 14:44:58,550 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9945 transitions. Word has length 95 [2025-03-03 14:44:58,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:58,551 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 9945 transitions. [2025-03-03 14:44:58,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:58,551 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9945 transitions. [2025-03-03 14:44:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:44:58,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:58,557 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:44:58,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 14:44:58,558 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:58,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1246550497, now seen corresponding path program 1 times [2025-03-03 14:44:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:58,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000024076] [2025-03-03 14:44:58,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:58,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 14:44:58,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:44:58,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:58,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:44:58,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:58,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000024076] [2025-03-03 14:44:58,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000024076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:58,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:58,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:58,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261454028] [2025-03-03 14:44:58,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:58,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:58,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:58,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:58,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:58,599 INFO L87 Difference]: Start difference. First operand 7438 states and 9945 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:58,914 INFO L93 Difference]: Finished difference Result 13448 states and 18028 transitions. [2025-03-03 14:44:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:58,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 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 96 [2025-03-03 14:44:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:58,929 INFO L225 Difference]: With dead ends: 13448 [2025-03-03 14:44:58,929 INFO L226 Difference]: Without dead ends: 7438 [2025-03-03 14:44:58,938 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-03 14:44:58,938 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 6 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:58,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 346 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7438 states. [2025-03-03 14:44:59,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7438 to 7438. [2025-03-03 14:44:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7438 states, 7437 states have (on average 1.3354847384698132) internal successors, (9932), 7437 states have internal predecessors, (9932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7438 states to 7438 states and 9932 transitions. [2025-03-03 14:44:59,308 INFO L78 Accepts]: Start accepts. Automaton has 7438 states and 9932 transitions. Word has length 96 [2025-03-03 14:44:59,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:59,308 INFO L471 AbstractCegarLoop]: Abstraction has 7438 states and 9932 transitions. [2025-03-03 14:44:59,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:59,308 INFO L276 IsEmpty]: Start isEmpty. Operand 7438 states and 9932 transitions. [2025-03-03 14:44:59,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-03 14:44:59,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:59,313 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:44:59,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 14:44:59,313 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:59,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:59,314 INFO L85 PathProgramCache]: Analyzing trace with hash -740991872, now seen corresponding path program 1 times [2025-03-03 14:44:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399700307] [2025-03-03 14:44:59,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:59,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-03 14:44:59,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-03 14:44:59,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:59,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:44:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399700307] [2025-03-03 14:44:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399700307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:59,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:59,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:44:59,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114325913] [2025-03-03 14:44:59,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:59,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:44:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:59,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:44:59,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:44:59,370 INFO L87 Difference]: Start difference. First operand 7438 states and 9932 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:59,637 INFO L93 Difference]: Finished difference Result 13984 states and 18615 transitions. [2025-03-03 14:44:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:44:59,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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 96 [2025-03-03 14:44:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:59,646 INFO L225 Difference]: With dead ends: 13984 [2025-03-03 14:44:59,646 INFO L226 Difference]: Without dead ends: 5793 [2025-03-03 14:44:59,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:44:59,651 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 444 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:59,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 397 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:44:59,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5793 states. [2025-03-03 14:44:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5793 to 5679. [2025-03-03 14:44:59,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5679 states, 5678 states have (on average 1.2962310672772104) internal successors, (7360), 5678 states have internal predecessors, (7360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:59,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5679 states to 5679 states and 7360 transitions. [2025-03-03 14:44:59,801 INFO L78 Accepts]: Start accepts. Automaton has 5679 states and 7360 transitions. Word has length 96 [2025-03-03 14:44:59,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:44:59,801 INFO L471 AbstractCegarLoop]: Abstraction has 5679 states and 7360 transitions. [2025-03-03 14:44:59,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:59,801 INFO L276 IsEmpty]: Start isEmpty. Operand 5679 states and 7360 transitions. [2025-03-03 14:44:59,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:44:59,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:44:59,807 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 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-03 14:44:59,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-03 14:44:59,808 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:44:59,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:44:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash -473288378, now seen corresponding path program 1 times [2025-03-03 14:44:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:44:59,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284606625] [2025-03-03 14:44:59,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:44:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:44:59,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:44:59,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:44:59,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:44:59,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:44:59,837 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:44:59,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:44:59,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284606625] [2025-03-03 14:44:59,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284606625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:44:59,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:44:59,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:44:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522320180] [2025-03-03 14:44:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:44:59,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:44:59,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:44:59,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:44:59,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:44:59,839 INFO L87 Difference]: Start difference. First operand 5679 states and 7360 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:44:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:44:59,978 INFO L93 Difference]: Finished difference Result 10880 states and 14084 transitions. [2025-03-03 14:44:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:44:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 125 [2025-03-03 14:44:59,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:44:59,986 INFO L225 Difference]: With dead ends: 10880 [2025-03-03 14:44:59,987 INFO L226 Difference]: Without dead ends: 5625 [2025-03-03 14:44:59,991 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-03 14:44:59,991 INFO L435 NwaCegarLoop]: 171 mSDtfsCounter, 35 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:44:59,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 308 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:44:59,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5625 states. [2025-03-03 14:45:00,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5625 to 5625. [2025-03-03 14:45:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5625 states, 5624 states have (on average 1.2898293029871977) internal successors, (7254), 5624 states have internal predecessors, (7254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:00,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5625 states to 5625 states and 7254 transitions. [2025-03-03 14:45:00,207 INFO L78 Accepts]: Start accepts. Automaton has 5625 states and 7254 transitions. Word has length 125 [2025-03-03 14:45:00,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:00,207 INFO L471 AbstractCegarLoop]: Abstraction has 5625 states and 7254 transitions. [2025-03-03 14:45:00,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand 5625 states and 7254 transitions. [2025-03-03 14:45:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:45:00,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:00,214 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2025-03-03 14:45:00,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-03 14:45:00,214 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:00,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:00,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2146581322, now seen corresponding path program 1 times [2025-03-03 14:45:00,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:00,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550093279] [2025-03-03 14:45:00,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:00,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:00,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:45:00,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:45:00,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:00,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:00,287 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:45:00,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:00,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550093279] [2025-03-03 14:45:00,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550093279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:00,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:00,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:45:00,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165616824] [2025-03-03 14:45:00,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:00,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:45:00,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:00,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:45:00,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:00,289 INFO L87 Difference]: Start difference. First operand 5625 states and 7254 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:00,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:00,442 INFO L93 Difference]: Finished difference Result 10071 states and 13010 transitions. [2025-03-03 14:45:00,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:00,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139 [2025-03-03 14:45:00,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:00,451 INFO L225 Difference]: With dead ends: 10071 [2025-03-03 14:45:00,451 INFO L226 Difference]: Without dead ends: 5533 [2025-03-03 14:45:00,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:00,456 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 315 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:00,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 321 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:00,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5533 states. [2025-03-03 14:45:00,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5533 to 5531. [2025-03-03 14:45:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 5530 states have (on average 1.2681735985533453) internal successors, (7013), 5530 states have internal predecessors, (7013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:00,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 7013 transitions. [2025-03-03 14:45:00,610 INFO L78 Accepts]: Start accepts. Automaton has 5531 states and 7013 transitions. Word has length 139 [2025-03-03 14:45:00,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:00,610 INFO L471 AbstractCegarLoop]: Abstraction has 5531 states and 7013 transitions. [2025-03-03 14:45:00,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:00,611 INFO L276 IsEmpty]: Start isEmpty. Operand 5531 states and 7013 transitions. [2025-03-03 14:45:00,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:45:00,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:00,617 INFO L218 NwaCegarLoop]: trace histogram [5, 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-03 14:45:00,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-03 14:45:00,618 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:00,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1603753747, now seen corresponding path program 1 times [2025-03-03 14:45:00,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:00,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846937882] [2025-03-03 14:45:00,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:00,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:00,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:45:00,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:45:00,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:00,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:00,657 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:45:00,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:00,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846937882] [2025-03-03 14:45:00,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846937882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:00,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809550193] [2025-03-03 14:45:00,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:00,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:00,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:00,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:00,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:00,658 INFO L87 Difference]: Start difference. First operand 5531 states and 7013 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:00,799 INFO L93 Difference]: Finished difference Result 10637 states and 13476 transitions. [2025-03-03 14:45:00,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:00,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 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 144 [2025-03-03 14:45:00,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:00,808 INFO L225 Difference]: With dead ends: 10637 [2025-03-03 14:45:00,809 INFO L226 Difference]: Without dead ends: 5530 [2025-03-03 14:45:00,814 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-03 14:45:00,815 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 23 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:00,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 307 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5530 states. [2025-03-03 14:45:01,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5530 to 5490. [2025-03-03 14:45:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 5489 states have (on average 1.2625250501002003) internal successors, (6930), 5489 states have internal predecessors, (6930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 6930 transitions. [2025-03-03 14:45:01,019 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 6930 transitions. Word has length 144 [2025-03-03 14:45:01,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:01,019 INFO L471 AbstractCegarLoop]: Abstraction has 5490 states and 6930 transitions. [2025-03-03 14:45:01,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 6930 transitions. [2025-03-03 14:45:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:45:01,025 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:01,026 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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-03 14:45:01,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-03 14:45:01,026 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:01,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:01,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1604412281, now seen corresponding path program 1 times [2025-03-03 14:45:01,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:01,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027026879] [2025-03-03 14:45:01,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:01,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:01,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-03 14:45:01,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:45:01,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:01,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-03 14:45:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027026879] [2025-03-03 14:45:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027026879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276069883] [2025-03-03 14:45:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:01,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:01,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:01,061 INFO L87 Difference]: Start difference. First operand 5490 states and 6930 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:01,200 INFO L93 Difference]: Finished difference Result 10576 states and 13337 transitions. [2025-03-03 14:45:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:01,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 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 144 [2025-03-03 14:45:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:01,209 INFO L225 Difference]: With dead ends: 10576 [2025-03-03 14:45:01,210 INFO L226 Difference]: Without dead ends: 5500 [2025-03-03 14:45:01,214 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-03 14:45:01,215 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 23 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:01,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 303 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5500 states. [2025-03-03 14:45:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5500 to 5460. [2025-03-03 14:45:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5460 states, 5459 states have (on average 1.256457226598278) internal successors, (6859), 5459 states have internal predecessors, (6859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5460 states to 5460 states and 6859 transitions. [2025-03-03 14:45:01,372 INFO L78 Accepts]: Start accepts. Automaton has 5460 states and 6859 transitions. Word has length 144 [2025-03-03 14:45:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:01,372 INFO L471 AbstractCegarLoop]: Abstraction has 5460 states and 6859 transitions. [2025-03-03 14:45:01,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 5460 states and 6859 transitions. [2025-03-03 14:45:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:45:01,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:01,380 INFO L218 NwaCegarLoop]: trace histogram [5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:01,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-03 14:45:01,380 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:01,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:01,380 INFO L85 PathProgramCache]: Analyzing trace with hash 650584586, now seen corresponding path program 1 times [2025-03-03 14:45:01,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:01,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286457364] [2025-03-03 14:45:01,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:01,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:01,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:45:01,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:45:01,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:01,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-03 14:45:01,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:01,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286457364] [2025-03-03 14:45:01,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286457364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:01,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:01,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:45:01,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966004231] [2025-03-03 14:45:01,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:01,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:45:01,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:01,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:45:01,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:01,455 INFO L87 Difference]: Start difference. First operand 5460 states and 6859 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:01,612 INFO L93 Difference]: Finished difference Result 8778 states and 11075 transitions. [2025-03-03 14:45:01,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:01,613 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 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 149 [2025-03-03 14:45:01,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:01,619 INFO L225 Difference]: With dead ends: 8778 [2025-03-03 14:45:01,619 INFO L226 Difference]: Without dead ends: 3748 [2025-03-03 14:45:01,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:01,622 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 288 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:01,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 298 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:01,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3748 states. [2025-03-03 14:45:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3748 to 3746. [2025-03-03 14:45:01,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3746 states, 3745 states have (on average 1.225634178905207) internal successors, (4590), 3745 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3746 states to 3746 states and 4590 transitions. [2025-03-03 14:45:01,819 INFO L78 Accepts]: Start accepts. Automaton has 3746 states and 4590 transitions. Word has length 149 [2025-03-03 14:45:01,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:01,820 INFO L471 AbstractCegarLoop]: Abstraction has 3746 states and 4590 transitions. [2025-03-03 14:45:01,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:01,820 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 4590 transitions. [2025-03-03 14:45:01,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-03 14:45:01,825 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:01,825 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 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] [2025-03-03 14:45:01,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-03 14:45:01,825 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:01,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:01,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1942356060, now seen corresponding path program 1 times [2025-03-03 14:45:01,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213557337] [2025-03-03 14:45:01,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:01,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:01,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-03 14:45:01,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-03 14:45:01,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:01,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:01,928 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 14:45:01,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:01,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213557337] [2025-03-03 14:45:01,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213557337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:01,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:01,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:45:01,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088079570] [2025-03-03 14:45:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:01,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:45:01,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:01,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:45:01,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:01,929 INFO L87 Difference]: Start difference. First operand 3746 states and 4590 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:02,072 INFO L93 Difference]: Finished difference Result 5950 states and 7296 transitions. [2025-03-03 14:45:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:02,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 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 149 [2025-03-03 14:45:02,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:02,080 INFO L225 Difference]: With dead ends: 5950 [2025-03-03 14:45:02,080 INFO L226 Difference]: Without dead ends: 2301 [2025-03-03 14:45:02,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:02,083 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 288 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:02,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 291 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:02,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2301 states. [2025-03-03 14:45:02,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2301 to 2299. [2025-03-03 14:45:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 2298 states have (on average 1.1936466492602262) internal successors, (2743), 2298 states have internal predecessors, (2743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 2743 transitions. [2025-03-03 14:45:02,208 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 2743 transitions. Word has length 149 [2025-03-03 14:45:02,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:02,209 INFO L471 AbstractCegarLoop]: Abstraction has 2299 states and 2743 transitions. [2025-03-03 14:45:02,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 2743 transitions. [2025-03-03 14:45:02,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-03 14:45:02,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:02,211 INFO L218 NwaCegarLoop]: trace histogram [6, 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] [2025-03-03 14:45:02,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-03 14:45:02,212 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:02,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 307239103, now seen corresponding path program 1 times [2025-03-03 14:45:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:02,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528590982] [2025-03-03 14:45:02,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:02,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-03 14:45:02,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-03 14:45:02,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:02,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:02,257 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:45:02,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:02,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528590982] [2025-03-03 14:45:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528590982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:02,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364592199] [2025-03-03 14:45:02,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:02,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:02,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:02,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:02,260 INFO L87 Difference]: Start difference. First operand 2299 states and 2743 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:02,383 INFO L93 Difference]: Finished difference Result 4135 states and 4970 transitions. [2025-03-03 14:45:02,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:02,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 188 [2025-03-03 14:45:02,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:02,389 INFO L225 Difference]: With dead ends: 4135 [2025-03-03 14:45:02,389 INFO L226 Difference]: Without dead ends: 2237 [2025-03-03 14:45:02,391 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-03 14:45:02,391 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 1 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:02,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 308 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2237 states. [2025-03-03 14:45:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2237 to 2159. [2025-03-03 14:45:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2158 states have (on average 1.1793327154772937) internal successors, (2545), 2158 states have internal predecessors, (2545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 2545 transitions. [2025-03-03 14:45:02,512 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 2545 transitions. Word has length 188 [2025-03-03 14:45:02,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:02,513 INFO L471 AbstractCegarLoop]: Abstraction has 2159 states and 2545 transitions. [2025-03-03 14:45:02,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 2545 transitions. [2025-03-03 14:45:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-03 14:45:02,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:02,515 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:02,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-03 14:45:02,516 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:02,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:02,516 INFO L85 PathProgramCache]: Analyzing trace with hash -476914583, now seen corresponding path program 1 times [2025-03-03 14:45:02,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:02,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294782954] [2025-03-03 14:45:02,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:02,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-03 14:45:02,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-03 14:45:02,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:02,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:45:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294782954] [2025-03-03 14:45:02,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294782954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:02,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:02,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546211124] [2025-03-03 14:45:02,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:02,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:02,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:02,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:02,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:02,561 INFO L87 Difference]: Start difference. First operand 2159 states and 2545 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:02,704 INFO L93 Difference]: Finished difference Result 4618 states and 5482 transitions. [2025-03-03 14:45:02,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:02,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 195 [2025-03-03 14:45:02,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:02,711 INFO L225 Difference]: With dead ends: 4618 [2025-03-03 14:45:02,711 INFO L226 Difference]: Without dead ends: 2854 [2025-03-03 14:45:02,713 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-03 14:45:02,713 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 136 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:02,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 304 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2025-03-03 14:45:02,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2453. [2025-03-03 14:45:02,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2453 states, 2452 states have (on average 1.1651712887438825) internal successors, (2857), 2452 states have internal predecessors, (2857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2453 states to 2453 states and 2857 transitions. [2025-03-03 14:45:02,850 INFO L78 Accepts]: Start accepts. Automaton has 2453 states and 2857 transitions. Word has length 195 [2025-03-03 14:45:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:02,851 INFO L471 AbstractCegarLoop]: Abstraction has 2453 states and 2857 transitions. [2025-03-03 14:45:02,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2453 states and 2857 transitions. [2025-03-03 14:45:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 14:45:02,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:02,853 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:02,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-03 14:45:02,853 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:02,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:02,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1550299473, now seen corresponding path program 1 times [2025-03-03 14:45:02,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:02,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123118455] [2025-03-03 14:45:02,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:02,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:02,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 14:45:02,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 14:45:02,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:02,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-03 14:45:02,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:02,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123118455] [2025-03-03 14:45:02,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123118455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:02,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524448123] [2025-03-03 14:45:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:02,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:02,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:02,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:02,894 INFO L87 Difference]: Start difference. First operand 2453 states and 2857 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:03,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:03,009 INFO L93 Difference]: Finished difference Result 4146 states and 4865 transitions. [2025-03-03 14:45:03,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:03,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 198 [2025-03-03 14:45:03,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:03,015 INFO L225 Difference]: With dead ends: 4146 [2025-03-03 14:45:03,015 INFO L226 Difference]: Without dead ends: 2086 [2025-03-03 14:45:03,016 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-03 14:45:03,017 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 3 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:03,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 303 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:03,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2025-03-03 14:45:03,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2005. [2025-03-03 14:45:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 2004 states have (on average 1.1492015968063871) internal successors, (2303), 2004 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2303 transitions. [2025-03-03 14:45:03,131 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2303 transitions. Word has length 198 [2025-03-03 14:45:03,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:03,132 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2303 transitions. [2025-03-03 14:45:03,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:03,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2303 transitions. [2025-03-03 14:45:03,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-03 14:45:03,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:03,134 INFO L218 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:03,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-03 14:45:03,134 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:03,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:03,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1806136208, now seen corresponding path program 1 times [2025-03-03 14:45:03,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425982376] [2025-03-03 14:45:03,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:03,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 14:45:03,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 14:45:03,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:03,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:03,525 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:45:03,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425982376] [2025-03-03 14:45:03,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425982376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:45:03,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [536522916] [2025-03-03 14:45:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:03,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:45:03,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:45:03,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:45:03,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:45:03,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-03 14:45:03,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-03 14:45:03,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:03,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:03,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 14:45:03,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:45:03,933 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:45:03,933 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:45:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 85 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:45:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [536522916] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:45:04,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:45:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 27 [2025-03-03 14:45:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129356782] [2025-03-03 14:45:04,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:45:04,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-03 14:45:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:04,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-03 14:45:04,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=623, Unknown=0, NotChecked=0, Total=702 [2025-03-03 14:45:04,408 INFO L87 Difference]: Start difference. First operand 2005 states and 2303 transitions. Second operand has 27 states, 27 states have (on average 17.814814814814813) internal successors, (481), 27 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:05,668 INFO L93 Difference]: Finished difference Result 7156 states and 8238 transitions. [2025-03-03 14:45:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-03 14:45:05,669 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 17.814814814814813) internal successors, (481), 27 states have internal predecessors, (481), 0 states have call successors, (0), 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 198 [2025-03-03 14:45:05,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:05,676 INFO L225 Difference]: With dead ends: 7156 [2025-03-03 14:45:05,676 INFO L226 Difference]: Without dead ends: 5467 [2025-03-03 14:45:05,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=490, Invalid=3416, Unknown=0, NotChecked=0, Total=3906 [2025-03-03 14:45:05,679 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 3562 mSDsluCounter, 7822 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3562 SdHoareTripleChecker+Valid, 8364 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:05,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3562 Valid, 8364 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:45:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2025-03-03 14:45:05,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 3004. [2025-03-03 14:45:05,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3004 states, 3003 states have (on average 1.1525141525141525) internal successors, (3461), 3003 states have internal predecessors, (3461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3461 transitions. [2025-03-03 14:45:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3461 transitions. Word has length 198 [2025-03-03 14:45:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:05,791 INFO L471 AbstractCegarLoop]: Abstraction has 3004 states and 3461 transitions. [2025-03-03 14:45:05,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 17.814814814814813) internal successors, (481), 27 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3461 transitions. [2025-03-03 14:45:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-03-03 14:45:05,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:05,794 INFO L218 NwaCegarLoop]: trace histogram [9, 5, 5, 5, 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, 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] [2025-03-03 14:45:05,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:45:05,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-03 14:45:05,999 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:05,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash -607026488, now seen corresponding path program 1 times [2025-03-03 14:45:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:05,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889687839] [2025-03-03 14:45:05,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:06,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:06,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-03-03 14:45:06,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-03-03 14:45:06,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:06,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-03 14:45:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889687839] [2025-03-03 14:45:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889687839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:06,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:06,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612815257] [2025-03-03 14:45:06,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:06,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:06,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:06,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:06,042 INFO L87 Difference]: Start difference. First operand 3004 states and 3461 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:06,114 INFO L93 Difference]: Finished difference Result 4644 states and 5327 transitions. [2025-03-03 14:45:06,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:06,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 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 268 [2025-03-03 14:45:06,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:06,119 INFO L225 Difference]: With dead ends: 4644 [2025-03-03 14:45:06,119 INFO L226 Difference]: Without dead ends: 2004 [2025-03-03 14:45:06,120 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-03 14:45:06,121 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 3 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:06,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 318 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:06,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2025-03-03 14:45:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1949. [2025-03-03 14:45:06,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1948 states have (on average 1.129876796714579) internal successors, (2201), 1948 states have internal predecessors, (2201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2201 transitions. [2025-03-03 14:45:06,194 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2201 transitions. Word has length 268 [2025-03-03 14:45:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:06,195 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 2201 transitions. [2025-03-03 14:45:06,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2201 transitions. [2025-03-03 14:45:06,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-03 14:45:06,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:06,197 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 14:45:06,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-03 14:45:06,198 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:06,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash -347996123, now seen corresponding path program 1 times [2025-03-03 14:45:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:06,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686907365] [2025-03-03 14:45:06,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:06,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-03 14:45:06,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-03 14:45:06,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:06,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 14:45:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:06,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686907365] [2025-03-03 14:45:06,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686907365] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:06,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:06,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 14:45:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148377593] [2025-03-03 14:45:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:06,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 14:45:06,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:06,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 14:45:06,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 14:45:06,304 INFO L87 Difference]: Start difference. First operand 1949 states and 2201 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:06,391 INFO L93 Difference]: Finished difference Result 3583 states and 4055 transitions. [2025-03-03 14:45:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:45:06,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-03-03 14:45:06,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:06,398 INFO L225 Difference]: With dead ends: 3583 [2025-03-03 14:45:06,398 INFO L226 Difference]: Without dead ends: 1950 [2025-03-03 14:45:06,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:45:06,400 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 195 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:06,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 233 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2025-03-03 14:45:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1949. [2025-03-03 14:45:06,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1949 states, 1948 states have (on average 1.1196098562628336) internal successors, (2181), 1948 states have internal predecessors, (2181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 2181 transitions. [2025-03-03 14:45:06,473 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 2181 transitions. Word has length 276 [2025-03-03 14:45:06,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:06,474 INFO L471 AbstractCegarLoop]: Abstraction has 1949 states and 2181 transitions. [2025-03-03 14:45:06,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 2181 transitions. [2025-03-03 14:45:06,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-03 14:45:06,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:45:06,477 INFO L218 NwaCegarLoop]: trace histogram [10, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-03 14:45:06,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-03 14:45:06,477 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:45:06,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:45:06,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1392581146, now seen corresponding path program 1 times [2025-03-03 14:45:06,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:45:06,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888905600] [2025-03-03 14:45:06,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:45:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:45:06,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-03 14:45:06,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-03 14:45:06,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:45:06,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:45:06,526 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-03-03 14:45:06,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:45:06,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888905600] [2025-03-03 14:45:06,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888905600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:45:06,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:45:06,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:45:06,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119613445] [2025-03-03 14:45:06,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:45:06,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:45:06,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:45:06,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:45:06,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:45:06,528 INFO L87 Difference]: Start difference. First operand 1949 states and 2181 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:45:06,569 INFO L93 Difference]: Finished difference Result 2234 states and 2491 transitions. [2025-03-03 14:45:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:45:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-03-03 14:45:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:45:06,576 INFO L225 Difference]: With dead ends: 2234 [2025-03-03 14:45:06,576 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:45:06,577 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-03 14:45:06,578 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 24 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:45:06,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 304 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:45:06,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:45:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:45:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:45:06,581 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2025-03-03 14:45:06,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:45:06,581 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:45:06,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:45:06,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:45:06,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:45:06,585 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:45:06,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-03 14:45:06,589 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:45:06,590 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:45:12,515 WARN L286 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 297 DAG size of output: 411 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 14:45:28,178 WARN L286 SmtUtils]: Spent 15.66s on a formula simplification. DAG size of input: 385 DAG size of output: 627 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 14:46:12,508 WARN L286 SmtUtils]: Spent 44.33s on a formula simplification. DAG size of input: 569 DAG size of output: 838 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-03-03 14:46:18,401 WARN L286 SmtUtils]: Spent 5.89s on a formula simplification. DAG size of input: 272 DAG size of output: 435 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)