./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label44.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/eca-rers2012/Problem03_label44.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 37cccb3bf38aef2358990f5bb72c991902624e4b903b7b6aaef89921bb90a94d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:52:19,223 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:52:19,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:52:19,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:52:19,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:52:19,297 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:52:19,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:52:19,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:52:19,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:52:19,299 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:52:19,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:52:19,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:52:19,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:52:19,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:52:19,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:52:19,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:52:19,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:52:19,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:52:19,301 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 -> 37cccb3bf38aef2358990f5bb72c991902624e4b903b7b6aaef89921bb90a94d [2025-03-03 09:52:19,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:52:19,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:52:19,556 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:52:19,558 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:52:19,558 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:52:19,559 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2025-03-03 09:52:20,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f03a598/28aeb9bf07dc4727895c4dddb8b766f7/FLAGf7aa472d0 [2025-03-03 09:52:21,066 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:52:21,068 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2025-03-03 09:52:21,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f03a598/28aeb9bf07dc4727895c4dddb8b766f7/FLAGf7aa472d0 [2025-03-03 09:52:21,096 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06f03a598/28aeb9bf07dc4727895c4dddb8b766f7 [2025-03-03 09:52:21,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:52:21,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:52:21,100 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:52:21,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:52:21,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:52:21,104 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a3089c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21, skipping insertion in model container [2025-03-03 09:52:21,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:52:21,522 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c[58121,58134] [2025-03-03 09:52:21,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:52:21,557 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:52:21,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c[58121,58134] [2025-03-03 09:52:21,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:52:21,692 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:52:21,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21 WrapperNode [2025-03-03 09:52:21,693 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:52:21,694 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:52:21,694 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:52:21,694 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:52:21,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,720 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,785 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-03-03 09:52:21,785 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:52:21,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:52:21,787 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:52:21,787 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:52:21,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,802 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,836 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 09:52:21,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,866 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:52:21,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:52:21,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:52:21,903 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:52:21,904 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (1/1) ... [2025-03-03 09:52:21,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:52:21,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:21,954 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 09:52:21,957 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 09:52:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:52:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:52:21,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:52:21,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:52:22,046 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:52:22,047 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:52:23,508 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-03-03 09:52:23,508 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:52:23,521 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:52:23,522 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:52:23,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:52:23 BoogieIcfgContainer [2025-03-03 09:52:23,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:52:23,524 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:52:23,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:52:23,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:52:23,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:52:21" (1/3) ... [2025-03-03 09:52:23,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc5410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:52:23, skipping insertion in model container [2025-03-03 09:52:23,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:52:21" (2/3) ... [2025-03-03 09:52:23,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71cc5410 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:52:23, skipping insertion in model container [2025-03-03 09:52:23,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:52:23" (3/3) ... [2025-03-03 09:52:23,530 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label44.c [2025-03-03 09:52:23,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:52:23,543 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label44.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 09:52:23,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:52:23,597 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;@702a5d39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:52:23,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:52:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:23,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-03 09:52:23,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:23,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:23,615 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:23,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -740182921, now seen corresponding path program 1 times [2025-03-03 09:52:23,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:23,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405017839] [2025-03-03 09:52:23,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:23,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:23,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-03 09:52:23,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-03 09:52:23,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:23,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:24,355 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 09:52:24,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:24,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405017839] [2025-03-03 09:52:24,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405017839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:24,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:24,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:24,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640658730] [2025-03-03 09:52:24,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:24,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:24,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:24,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:24,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:24,376 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:25,209 INFO L93 Difference]: Finished difference Result 855 states and 1493 transitions. [2025-03-03 09:52:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:25,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2025-03-03 09:52:25,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:25,219 INFO L225 Difference]: With dead ends: 855 [2025-03-03 09:52:25,220 INFO L226 Difference]: Without dead ends: 460 [2025-03-03 09:52:25,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:25,226 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 119 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:25,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 175 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:52:25,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-03 09:52:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2025-03-03 09:52:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:25,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2025-03-03 09:52:25,278 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 177 [2025-03-03 09:52:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:25,279 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2025-03-03 09:52:25,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2025-03-03 09:52:25,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-03 09:52:25,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:25,285 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:25,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:52:25,286 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:25,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1609407949, now seen corresponding path program 1 times [2025-03-03 09:52:25,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:25,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437747539] [2025-03-03 09:52:25,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:25,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-03 09:52:25,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-03 09:52:25,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:25,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:25,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:25,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437747539] [2025-03-03 09:52:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437747539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:25,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:25,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:25,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961112063] [2025-03-03 09:52:25,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:25,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:25,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:25,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:25,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:25,549 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 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 09:52:25,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:25,768 INFO L93 Difference]: Finished difference Result 1372 states and 2125 transitions. [2025-03-03 09:52:25,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:25,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 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 182 [2025-03-03 09:52:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:25,772 INFO L225 Difference]: With dead ends: 1372 [2025-03-03 09:52:25,773 INFO L226 Difference]: Without dead ends: 915 [2025-03-03 09:52:25,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:25,777 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:25,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:52:25,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-03 09:52:25,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913. [2025-03-03 09:52:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 912 states have (on average 1.5460526315789473) internal successors, (1410), 912 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1410 transitions. [2025-03-03 09:52:25,814 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1410 transitions. Word has length 182 [2025-03-03 09:52:25,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:25,815 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1410 transitions. [2025-03-03 09:52:25,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 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 09:52:25,815 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1410 transitions. [2025-03-03 09:52:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-03 09:52:25,818 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:25,818 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:25,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 09:52:25,818 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:25,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:25,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1077071841, now seen corresponding path program 1 times [2025-03-03 09:52:25,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:25,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857310413] [2025-03-03 09:52:25,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:25,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:25,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-03 09:52:25,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-03 09:52:25,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:25,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:25,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857310413] [2025-03-03 09:52:25,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857310413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:25,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:25,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:25,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97579141] [2025-03-03 09:52:25,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:25,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:25,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:25,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:25,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:25,972 INFO L87 Difference]: Start difference. First operand 913 states and 1410 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:26,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:26,615 INFO L93 Difference]: Finished difference Result 2685 states and 4171 transitions. [2025-03-03 09:52:26,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:26,616 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2025-03-03 09:52:26,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:26,622 INFO L225 Difference]: With dead ends: 2685 [2025-03-03 09:52:26,622 INFO L226 Difference]: Without dead ends: 1774 [2025-03-03 09:52:26,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:26,624 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 237 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:26,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 153 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:26,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1774 states. [2025-03-03 09:52:26,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1774 to 1738. [2025-03-03 09:52:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1737 states have (on average 1.5146804835924006) internal successors, (2631), 1737 states have internal predecessors, (2631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:26,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2631 transitions. [2025-03-03 09:52:26,679 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2631 transitions. Word has length 185 [2025-03-03 09:52:26,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:26,679 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2631 transitions. [2025-03-03 09:52:26,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2631 transitions. [2025-03-03 09:52:26,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-03 09:52:26,684 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:26,684 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:26,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:52:26,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:26,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:26,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1879158032, now seen corresponding path program 1 times [2025-03-03 09:52:26,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:26,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304931735] [2025-03-03 09:52:26,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:26,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:26,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-03 09:52:26,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-03 09:52:26,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:26,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:26,849 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:26,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:26,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304931735] [2025-03-03 09:52:26,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304931735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:26,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:26,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:26,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893153512] [2025-03-03 09:52:26,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:26,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:26,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:26,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:26,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:26,851 INFO L87 Difference]: Start difference. First operand 1738 states and 2631 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:27,173 INFO L93 Difference]: Finished difference Result 5178 states and 7849 transitions. [2025-03-03 09:52:27,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:27,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2025-03-03 09:52:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:27,183 INFO L225 Difference]: With dead ends: 5178 [2025-03-03 09:52:27,184 INFO L226 Difference]: Without dead ends: 3442 [2025-03-03 09:52:27,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:27,189 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 349 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:27,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 513 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:52:27,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3442 states. [2025-03-03 09:52:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3442 to 3438. [2025-03-03 09:52:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3437 states have (on average 1.5085830666278732) internal successors, (5185), 3437 states have internal predecessors, (5185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 5185 transitions. [2025-03-03 09:52:27,251 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 5185 transitions. Word has length 191 [2025-03-03 09:52:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:27,251 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 5185 transitions. [2025-03-03 09:52:27,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:27,252 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 5185 transitions. [2025-03-03 09:52:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 09:52:27,256 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:27,256 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:27,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 09:52:27,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:27,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -862890564, now seen corresponding path program 1 times [2025-03-03 09:52:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135245030] [2025-03-03 09:52:27,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:27,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 09:52:27,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 09:52:27,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:27,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:52:27,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:27,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135245030] [2025-03-03 09:52:27,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135245030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:27,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:27,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:52:27,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424406317] [2025-03-03 09:52:27,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:27,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:52:27,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:27,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:52:27,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:52:27,765 INFO L87 Difference]: Start difference. First operand 3438 states and 5185 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:28,489 INFO L93 Difference]: Finished difference Result 7480 states and 11419 transitions. [2025-03-03 09:52:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:52:28,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 192 [2025-03-03 09:52:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:28,499 INFO L225 Difference]: With dead ends: 7480 [2025-03-03 09:52:28,499 INFO L226 Difference]: Without dead ends: 3348 [2025-03-03 09:52:28,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:52:28,503 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 331 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:28,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 47 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 09:52:28,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3348 states. [2025-03-03 09:52:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3348 to 3347. [2025-03-03 09:52:28,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3347 states, 3346 states have (on average 1.3682008368200838) internal successors, (4578), 3346 states have internal predecessors, (4578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:28,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3347 states to 3347 states and 4578 transitions. [2025-03-03 09:52:28,558 INFO L78 Accepts]: Start accepts. Automaton has 3347 states and 4578 transitions. Word has length 192 [2025-03-03 09:52:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:28,559 INFO L471 AbstractCegarLoop]: Abstraction has 3347 states and 4578 transitions. [2025-03-03 09:52:28,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 3347 states and 4578 transitions. [2025-03-03 09:52:28,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-03 09:52:28,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:28,564 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:28,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 09:52:28,564 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:28,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:28,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1885078682, now seen corresponding path program 1 times [2025-03-03 09:52:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260039793] [2025-03-03 09:52:28,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:28,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:28,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-03 09:52:28,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-03 09:52:28,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:28,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:28,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:28,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260039793] [2025-03-03 09:52:28,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260039793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:28,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:28,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:28,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3842894] [2025-03-03 09:52:28,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:28,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:28,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:28,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:28,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:28,726 INFO L87 Difference]: Start difference. First operand 3347 states and 4578 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:29,272 INFO L93 Difference]: Finished difference Result 9975 states and 13648 transitions. [2025-03-03 09:52:29,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:29,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 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 192 [2025-03-03 09:52:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:29,289 INFO L225 Difference]: With dead ends: 9975 [2025-03-03 09:52:29,289 INFO L226 Difference]: Without dead ends: 6630 [2025-03-03 09:52:29,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:29,295 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 227 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:29,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 104 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:52:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6630 states. [2025-03-03 09:52:29,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6630 to 6616. [2025-03-03 09:52:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6616 states, 6615 states have (on average 1.3180650037792896) internal successors, (8719), 6615 states have internal predecessors, (8719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:29,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6616 states to 6616 states and 8719 transitions. [2025-03-03 09:52:29,384 INFO L78 Accepts]: Start accepts. Automaton has 6616 states and 8719 transitions. Word has length 192 [2025-03-03 09:52:29,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:29,385 INFO L471 AbstractCegarLoop]: Abstraction has 6616 states and 8719 transitions. [2025-03-03 09:52:29,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 2 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:29,385 INFO L276 IsEmpty]: Start isEmpty. Operand 6616 states and 8719 transitions. [2025-03-03 09:52:29,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-03 09:52:29,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:29,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 09:52:29,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:29,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 677719120, now seen corresponding path program 1 times [2025-03-03 09:52:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985503902] [2025-03-03 09:52:29,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:29,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-03 09:52:29,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-03 09:52:29,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:29,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:29,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:29,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985503902] [2025-03-03 09:52:29,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985503902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:29,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:29,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:52:29,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828617842] [2025-03-03 09:52:29,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:29,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:52:29,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:29,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:52:29,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:52:29,824 INFO L87 Difference]: Start difference. First operand 6616 states and 8719 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:30,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:30,770 INFO L93 Difference]: Finished difference Result 17220 states and 22747 transitions. [2025-03-03 09:52:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:52:30,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 208 [2025-03-03 09:52:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:30,797 INFO L225 Difference]: With dead ends: 17220 [2025-03-03 09:52:30,797 INFO L226 Difference]: Without dead ends: 9910 [2025-03-03 09:52:30,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:52:30,804 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 194 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:30,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 98 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:52:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9910 states. [2025-03-03 09:52:30,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9910 to 9906. [2025-03-03 09:52:30,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9906 states, 9905 states have (on average 1.3010600706713782) internal successors, (12887), 9905 states have internal predecessors, (12887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:30,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 12887 transitions. [2025-03-03 09:52:30,926 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 12887 transitions. Word has length 208 [2025-03-03 09:52:30,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:30,926 INFO L471 AbstractCegarLoop]: Abstraction has 9906 states and 12887 transitions. [2025-03-03 09:52:30,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:30,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 12887 transitions. [2025-03-03 09:52:30,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-03 09:52:30,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:30,937 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:30,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 09:52:30,937 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:30,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:30,938 INFO L85 PathProgramCache]: Analyzing trace with hash -153731051, now seen corresponding path program 1 times [2025-03-03 09:52:30,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:30,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194872310] [2025-03-03 09:52:30,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:30,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:30,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 09:52:30,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 09:52:30,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:30,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:31,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194872310] [2025-03-03 09:52:31,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194872310] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420269248] [2025-03-03 09:52:31,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:31,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:31,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:31,699 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 09:52:31,700 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 09:52:31,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-03-03 09:52:31,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-03-03 09:52:31,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:31,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:31,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:52:31,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 09:52:32,043 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:32,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420269248] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:32,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:32,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:52:32,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471043818] [2025-03-03 09:52:32,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:32,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:32,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:32,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:32,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:32,044 INFO L87 Difference]: Start difference. First operand 9906 states and 12887 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:32,640 INFO L93 Difference]: Finished difference Result 19843 states and 25833 transitions. [2025-03-03 09:52:32,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:32,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 215 [2025-03-03 09:52:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:32,661 INFO L225 Difference]: With dead ends: 19843 [2025-03-03 09:52:32,661 INFO L226 Difference]: Without dead ends: 9939 [2025-03-03 09:52:32,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:32,672 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 47 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:32,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 317 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:52:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2025-03-03 09:52:32,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 9906. [2025-03-03 09:52:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9906 states, 9905 states have (on average 1.2832912670368501) internal successors, (12711), 9905 states have internal predecessors, (12711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9906 states to 9906 states and 12711 transitions. [2025-03-03 09:52:32,781 INFO L78 Accepts]: Start accepts. Automaton has 9906 states and 12711 transitions. Word has length 215 [2025-03-03 09:52:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:32,782 INFO L471 AbstractCegarLoop]: Abstraction has 9906 states and 12711 transitions. [2025-03-03 09:52:32,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 9906 states and 12711 transitions. [2025-03-03 09:52:32,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-03 09:52:32,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:32,793 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:32,800 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 09:52:32,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:32,994 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:32,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:32,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1506477255, now seen corresponding path program 1 times [2025-03-03 09:52:32,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:32,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510906832] [2025-03-03 09:52:32,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:32,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:33,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-03 09:52:33,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-03 09:52:33,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:33,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:33,177 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 09:52:33,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:33,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510906832] [2025-03-03 09:52:33,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510906832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:33,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:33,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324987033] [2025-03-03 09:52:33,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:33,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:33,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:33,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:33,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:33,180 INFO L87 Difference]: Start difference. First operand 9906 states and 12711 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:33,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:33,740 INFO L93 Difference]: Finished difference Result 26416 states and 33913 transitions. [2025-03-03 09:52:33,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:33,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2025-03-03 09:52:33,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:33,802 INFO L225 Difference]: With dead ends: 26416 [2025-03-03 09:52:33,802 INFO L226 Difference]: Without dead ends: 16512 [2025-03-03 09:52:33,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:33,809 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 202 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:33,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 117 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:52:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16512 states. [2025-03-03 09:52:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16512 to 16506. [2025-03-03 09:52:33,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16506 states, 16505 states have (on average 1.280763405028779) internal successors, (21139), 16505 states have internal predecessors, (21139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16506 states to 16506 states and 21139 transitions. [2025-03-03 09:52:33,939 INFO L78 Accepts]: Start accepts. Automaton has 16506 states and 21139 transitions. Word has length 220 [2025-03-03 09:52:33,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:33,939 INFO L471 AbstractCegarLoop]: Abstraction has 16506 states and 21139 transitions. [2025-03-03 09:52:33,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:33,939 INFO L276 IsEmpty]: Start isEmpty. Operand 16506 states and 21139 transitions. [2025-03-03 09:52:33,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 09:52:33,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:33,953 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:33,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 09:52:33,954 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:33,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash -643792742, now seen corresponding path program 1 times [2025-03-03 09:52:33,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:33,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511248240] [2025-03-03 09:52:33,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:33,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:33,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 09:52:33,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 09:52:33,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:33,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:34,638 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:52:34,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511248240] [2025-03-03 09:52:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511248240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575890319] [2025-03-03 09:52:34,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:34,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:34,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:34,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:34,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 09:52:34,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 09:52:34,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 09:52:34,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:34,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:34,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:52:34,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:34,931 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:52:34,932 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:34,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575890319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:34,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:34,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:52:34,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101661389] [2025-03-03 09:52:34,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:34,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:34,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:34,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:34,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:34,933 INFO L87 Difference]: Start difference. First operand 16506 states and 21139 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:35,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:35,473 INFO L93 Difference]: Finished difference Result 49274 states and 63090 transitions. [2025-03-03 09:52:35,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:35,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-03-03 09:52:35,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:35,517 INFO L225 Difference]: With dead ends: 49274 [2025-03-03 09:52:35,517 INFO L226 Difference]: Without dead ends: 32770 [2025-03-03 09:52:35,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:35,537 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 42 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:35,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 343 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:52:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32770 states. [2025-03-03 09:52:35,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32770 to 32746. [2025-03-03 09:52:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32746 states, 32745 states have (on average 1.1736448312719499) internal successors, (38431), 32745 states have internal predecessors, (38431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:35,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32746 states to 32746 states and 38431 transitions. [2025-03-03 09:52:35,890 INFO L78 Accepts]: Start accepts. Automaton has 32746 states and 38431 transitions. Word has length 221 [2025-03-03 09:52:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:35,890 INFO L471 AbstractCegarLoop]: Abstraction has 32746 states and 38431 transitions. [2025-03-03 09:52:35,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:35,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32746 states and 38431 transitions. [2025-03-03 09:52:35,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-03 09:52:35,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:35,901 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:35,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 09:52:36,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:52:36,102 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:36,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:36,103 INFO L85 PathProgramCache]: Analyzing trace with hash 279263168, now seen corresponding path program 1 times [2025-03-03 09:52:36,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:36,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907189756] [2025-03-03 09:52:36,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:36,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:36,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-03 09:52:36,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-03 09:52:36,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:36,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:36,308 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:36,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:36,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907189756] [2025-03-03 09:52:36,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907189756] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:36,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:36,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:36,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144673650] [2025-03-03 09:52:36,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:36,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:36,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:36,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:36,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:36,309 INFO L87 Difference]: Start difference. First operand 32746 states and 38431 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:36,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:36,880 INFO L93 Difference]: Finished difference Result 80106 states and 95598 transitions. [2025-03-03 09:52:36,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2025-03-03 09:52:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:36,927 INFO L225 Difference]: With dead ends: 80106 [2025-03-03 09:52:36,927 INFO L226 Difference]: Without dead ends: 47362 [2025-03-03 09:52:36,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:36,955 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:36,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 126 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:52:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47362 states. [2025-03-03 09:52:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47362 to 47362. [2025-03-03 09:52:37,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47362 states, 47361 states have (on average 1.1426912438504255) internal successors, (54119), 47361 states have internal predecessors, (54119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:37,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47362 states to 47362 states and 54119 transitions. [2025-03-03 09:52:37,659 INFO L78 Accepts]: Start accepts. Automaton has 47362 states and 54119 transitions. Word has length 221 [2025-03-03 09:52:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:37,659 INFO L471 AbstractCegarLoop]: Abstraction has 47362 states and 54119 transitions. [2025-03-03 09:52:37,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 47362 states and 54119 transitions. [2025-03-03 09:52:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-03 09:52:37,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:37,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:37,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 09:52:37,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:37,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:37,680 INFO L85 PathProgramCache]: Analyzing trace with hash -153775700, now seen corresponding path program 1 times [2025-03-03 09:52:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:37,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001813222] [2025-03-03 09:52:37,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:37,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:37,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-03 09:52:37,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-03 09:52:37,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:37,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:37,919 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001813222] [2025-03-03 09:52:37,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001813222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:37,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:52:37,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:52:37,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452433421] [2025-03-03 09:52:37,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:37,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:37,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:37,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:37,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:37,921 INFO L87 Difference]: Start difference. First operand 47362 states and 54119 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:38,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:38,655 INFO L93 Difference]: Finished difference Result 129415 states and 148034 transitions. [2025-03-03 09:52:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:38,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 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 252 [2025-03-03 09:52:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:38,748 INFO L225 Difference]: With dead ends: 129415 [2025-03-03 09:52:38,748 INFO L226 Difference]: Without dead ends: 82055 [2025-03-03 09:52:38,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 09:52:38,794 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 155 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:38,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 128 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:52:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82055 states. [2025-03-03 09:52:39,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82055 to 82049. [2025-03-03 09:52:39,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82049 states, 82048 states have (on average 1.1426238299531981) internal successors, (93750), 82048 states have internal predecessors, (93750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82049 states to 82049 states and 93750 transitions. [2025-03-03 09:52:39,609 INFO L78 Accepts]: Start accepts. Automaton has 82049 states and 93750 transitions. Word has length 252 [2025-03-03 09:52:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:39,609 INFO L471 AbstractCegarLoop]: Abstraction has 82049 states and 93750 transitions. [2025-03-03 09:52:39,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 2 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 82049 states and 93750 transitions. [2025-03-03 09:52:39,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-03 09:52:39,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:39,627 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:52:39,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 09:52:39,627 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:39,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1947479567, now seen corresponding path program 1 times [2025-03-03 09:52:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:39,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108163624] [2025-03-03 09:52:39,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:39,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:39,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 09:52:39,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 09:52:39,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:39,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:40,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:40,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108163624] [2025-03-03 09:52:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108163624] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806589307] [2025-03-03 09:52:40,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:40,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:40,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:40,650 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:40,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 09:52:40,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes. [2025-03-03 09:52:40,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements. [2025-03-03 09:52:40,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:40,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:40,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:52:40,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:40,902 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:52:40,902 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:40,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806589307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:40,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:40,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-03 09:52:40,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913194098] [2025-03-03 09:52:40,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:40,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:40,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:40,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:40,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:40,906 INFO L87 Difference]: Start difference. First operand 82049 states and 93750 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:41,946 INFO L93 Difference]: Finished difference Result 222141 states and 254108 transitions. [2025-03-03 09:52:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:41,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 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 259 [2025-03-03 09:52:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:42,141 INFO L225 Difference]: With dead ends: 222141 [2025-03-03 09:52:42,141 INFO L226 Difference]: Without dead ends: 140094 [2025-03-03 09:52:42,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:42,223 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:42,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 104 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:52:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140094 states. [2025-03-03 09:52:43,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140094 to 120631. [2025-03-03 09:52:43,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120631 states, 120630 states have (on average 1.1536682417309128) internal successors, (139167), 120630 states have internal predecessors, (139167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:44,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120631 states to 120631 states and 139167 transitions. [2025-03-03 09:52:44,092 INFO L78 Accepts]: Start accepts. Automaton has 120631 states and 139167 transitions. Word has length 259 [2025-03-03 09:52:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:44,093 INFO L471 AbstractCegarLoop]: Abstraction has 120631 states and 139167 transitions. [2025-03-03 09:52:44,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 2 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 120631 states and 139167 transitions. [2025-03-03 09:52:44,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-03 09:52:44,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:44,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:52:44,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 09:52:44,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:44,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:44,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -891024465, now seen corresponding path program 1 times [2025-03-03 09:52:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:44,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662677666] [2025-03-03 09:52:44,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:44,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 09:52:44,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 09:52:44,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:44,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 30 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662677666] [2025-03-03 09:52:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662677666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648097046] [2025-03-03 09:52:45,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:45,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:45,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:45,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:45,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 09:52:45,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-03 09:52:45,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-03 09:52:45,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:45,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:45,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 09:52:45,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:45,733 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:52:45,733 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:45,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648097046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:45,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:45,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 09:52:45,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956160590] [2025-03-03 09:52:45,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:45,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:45,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:45,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:45,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:45,735 INFO L87 Difference]: Start difference. First operand 120631 states and 139167 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:46,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:46,633 INFO L93 Difference]: Finished difference Result 240496 states and 277558 transitions. [2025-03-03 09:52:46,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:46,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2025-03-03 09:52:46,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:46,788 INFO L225 Difference]: With dead ends: 240496 [2025-03-03 09:52:46,788 INFO L226 Difference]: Without dead ends: 119867 [2025-03-03 09:52:46,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:46,869 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:46,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 277 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:52:47,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119867 states. [2025-03-03 09:52:48,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119867 to 118601. [2025-03-03 09:52:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118601 states, 118600 states have (on average 1.1427993254637436) internal successors, (135536), 118600 states have internal predecessors, (135536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118601 states to 118601 states and 135536 transitions. [2025-03-03 09:52:48,833 INFO L78 Accepts]: Start accepts. Automaton has 118601 states and 135536 transitions. Word has length 273 [2025-03-03 09:52:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:48,833 INFO L471 AbstractCegarLoop]: Abstraction has 118601 states and 135536 transitions. [2025-03-03 09:52:48,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 118601 states and 135536 transitions. [2025-03-03 09:52:48,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-03-03 09:52:48,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:48,864 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:48,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 09:52:49,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:49,065 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:49,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:49,065 INFO L85 PathProgramCache]: Analyzing trace with hash -995124928, now seen corresponding path program 1 times [2025-03-03 09:52:49,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:49,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884186687] [2025-03-03 09:52:49,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:49,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:49,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 09:52:49,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 09:52:49,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:49,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:49,416 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 09:52:49,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884186687] [2025-03-03 09:52:49,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884186687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:49,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667157758] [2025-03-03 09:52:49,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:49,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:49,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:49,419 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:49,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 09:52:49,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-03-03 09:52:49,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-03-03 09:52:49,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:49,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:49,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:52:49,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 09:52:49,621 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667157758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:49,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-03-03 09:52:49,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366681121] [2025-03-03 09:52:49,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:52:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:49,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:52:49,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:49,623 INFO L87 Difference]: Start difference. First operand 118601 states and 135536 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:51,259 INFO L93 Difference]: Finished difference Result 354109 states and 403024 transitions. [2025-03-03 09:52:51,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:52:51,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 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 287 [2025-03-03 09:52:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:51,605 INFO L225 Difference]: With dead ends: 354109 [2025-03-03 09:52:51,606 INFO L226 Difference]: Without dead ends: 235510 [2025-03-03 09:52:51,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:51,716 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 477 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:51,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 310 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 09:52:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235510 states. [2025-03-03 09:52:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235510 to 224502. [2025-03-03 09:52:54,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224502 states, 224501 states have (on average 1.1326809234702742) internal successors, (254288), 224501 states have internal predecessors, (254288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:55,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224502 states to 224502 states and 254288 transitions. [2025-03-03 09:52:55,024 INFO L78 Accepts]: Start accepts. Automaton has 224502 states and 254288 transitions. Word has length 287 [2025-03-03 09:52:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:52:55,025 INFO L471 AbstractCegarLoop]: Abstraction has 224502 states and 254288 transitions. [2025-03-03 09:52:55,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 224502 states and 254288 transitions. [2025-03-03 09:52:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2025-03-03 09:52:55,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:52:55,072 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:52:55,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:52:55,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:52:55,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:52:55,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:52:55,275 INFO L85 PathProgramCache]: Analyzing trace with hash 646970940, now seen corresponding path program 1 times [2025-03-03 09:52:55,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:52:55,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342847151] [2025-03-03 09:52:55,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:55,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:52:55,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 09:52:55,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 09:52:55,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:55,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:56,213 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2025-03-03 09:52:56,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:52:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342847151] [2025-03-03 09:52:56,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342847151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:52:56,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [261566217] [2025-03-03 09:52:56,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:52:56,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:52:56,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:52:56,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:52:56,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 09:52:56,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes. [2025-03-03 09:52:56,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements. [2025-03-03 09:52:56,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:52:56,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:52:56,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 09:52:56,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:52:56,410 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-03-03 09:52:56,410 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:52:56,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [261566217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:52:56,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:52:56,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 09:52:56,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316714699] [2025-03-03 09:52:56,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:52:56,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 09:52:56,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:52:56,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 09:52:56,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:56,412 INFO L87 Difference]: Start difference. First operand 224502 states and 254288 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:52:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:52:58,472 INFO L93 Difference]: Finished difference Result 531824 states and 603057 transitions. [2025-03-03 09:52:58,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 09:52:58,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 290 [2025-03-03 09:52:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:52:58,910 INFO L225 Difference]: With dead ends: 531824 [2025-03-03 09:52:58,911 INFO L226 Difference]: Without dead ends: 307324 [2025-03-03 09:52:59,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 09:52:59,011 INFO L435 NwaCegarLoop]: 282 mSDtfsCounter, 198 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 09:52:59,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 303 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 09:52:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307324 states. [2025-03-03 09:53:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307324 to 307260. [2025-03-03 09:53:02,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307260 states, 307259 states have (on average 1.1220468725082098) internal successors, (344759), 307259 states have internal predecessors, (344759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:53:03,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307260 states to 307260 states and 344759 transitions. [2025-03-03 09:53:03,384 INFO L78 Accepts]: Start accepts. Automaton has 307260 states and 344759 transitions. Word has length 290 [2025-03-03 09:53:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:03,384 INFO L471 AbstractCegarLoop]: Abstraction has 307260 states and 344759 transitions. [2025-03-03 09:53:03,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:53:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 307260 states and 344759 transitions. [2025-03-03 09:53:03,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-03-03 09:53:03,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:03,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:53:03,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:53:04,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 09:53:04,049 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:04,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:04,049 INFO L85 PathProgramCache]: Analyzing trace with hash 125374438, now seen corresponding path program 1 times [2025-03-03 09:53:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:04,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335341269] [2025-03-03 09:53:04,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:04,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:04,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-03-03 09:53:04,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-03-03 09:53:04,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:04,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:04,484 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 09:53:04,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:04,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335341269] [2025-03-03 09:53:04,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335341269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:04,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:04,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:04,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411037752] [2025-03-03 09:53:04,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:04,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:53:04,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:04,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:53:04,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:53:04,485 INFO L87 Difference]: Start difference. First operand 307260 states and 344759 transitions. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:53:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:53:07,032 INFO L93 Difference]: Finished difference Result 634565 states and 710519 transitions. [2025-03-03 09:53:07,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:53:07,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 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 332 [2025-03-03 09:53:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:53:07,465 INFO L225 Difference]: With dead ends: 634565 [2025-03-03 09:53:07,465 INFO L226 Difference]: Without dead ends: 327291 [2025-03-03 09:53:07,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:53:07,551 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 312 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:53:07,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 90 Invalid, 1189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 09:53:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327291 states. [2025-03-03 09:53:11,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327291 to 327221. [2025-03-03 09:53:11,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327221 states, 327220 states have (on average 1.0971120347167043) internal successors, (358997), 327220 states have internal predecessors, (358997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:53:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327221 states to 327221 states and 358997 transitions. [2025-03-03 09:53:12,672 INFO L78 Accepts]: Start accepts. Automaton has 327221 states and 358997 transitions. Word has length 332 [2025-03-03 09:53:12,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:53:12,675 INFO L471 AbstractCegarLoop]: Abstraction has 327221 states and 358997 transitions. [2025-03-03 09:53:12,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 09:53:12,676 INFO L276 IsEmpty]: Start isEmpty. Operand 327221 states and 358997 transitions. [2025-03-03 09:53:12,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 09:53:12,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:53:12,781 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 09:53:12,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 09:53:12,782 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:53:12,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:53:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash 2063873439, now seen corresponding path program 1 times [2025-03-03 09:53:12,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:53:12,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601589540] [2025-03-03 09:53:12,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:53:12,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:53:12,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 09:53:12,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 09:53:12,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:53:12,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:53:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2025-03-03 09:53:13,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:53:13,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601589540] [2025-03-03 09:53:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601589540] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:53:13,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:53:13,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 09:53:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333945391] [2025-03-03 09:53:13,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:53:13,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:53:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:53:13,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:53:13,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:53:13,024 INFO L87 Difference]: Start difference. First operand 327221 states and 358997 transitions. Second operand has 4 states, 4 states have (on average 70.0) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)