./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label30.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/Problem11_label30.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 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:32:42,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:32:42,416 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:32:42,420 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:32:42,423 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:32:42,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:32:42,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:32:42,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:32:42,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:32:42,448 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:32:42,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:32:42,449 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:32:42,449 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:32:42,449 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:32:42,450 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:42,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:32:42,450 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:32:42,450 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 -> 80c5c0aba72ae94b1a7faaff5d18dcb1975bca24b2cca6ada65386f045cad987 [2025-03-03 10:32:42,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:32:42,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:32:42,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:32:42,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:32:42,688 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:32:42,689 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2025-03-03 10:32:43,830 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e7303c8/8e43824619034cab9391f52aad931158/FLAG56bdd99a4 [2025-03-03 10:32:44,106 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:32:44,106 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2025-03-03 10:32:44,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e7303c8/8e43824619034cab9391f52aad931158/FLAG56bdd99a4 [2025-03-03 10:32:44,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0e7303c8/8e43824619034cab9391f52aad931158 [2025-03-03 10:32:44,408 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:32:44,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:32:44,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:44,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:32:44,413 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:32:44,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44, skipping insertion in model container [2025-03-03 10:32:44,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,448 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:32:44,552 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/Problem11_label30.c[4279,4292] [2025-03-03 10:32:44,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:44,684 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:32:44,695 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/Problem11_label30.c[4279,4292] [2025-03-03 10:32:44,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:44,793 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:32:44,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44 WrapperNode [2025-03-03 10:32:44,794 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:44,795 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:44,795 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:32:44,795 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:32:44,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,885 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:32:44,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:44,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:32:44,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:32:44,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:32:44,893 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,893 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,903 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,962 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 10:32:44,962 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,982 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,990 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:44,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:32:45,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:32:45,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:32:45,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:32:45,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (1/1) ... [2025-03-03 10:32:45,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:45,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:45,025 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 10:32:45,030 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 10:32:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:32:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:32:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:32:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:32:45,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:32:45,093 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:32:46,193 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:32:46,193 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:32:46,207 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:32:46,209 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:32:46,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:46 BoogieIcfgContainer [2025-03-03 10:32:46,210 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:32:46,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:32:46,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:32:46,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:32:46,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:32:44" (1/3) ... [2025-03-03 10:32:46,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3859f10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:46, skipping insertion in model container [2025-03-03 10:32:46,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:44" (2/3) ... [2025-03-03 10:32:46,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3859f10d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:46, skipping insertion in model container [2025-03-03 10:32:46,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:46" (3/3) ... [2025-03-03 10:32:46,218 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label30.c [2025-03-03 10:32:46,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:32:46,232 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label30.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:32:46,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:32:46,294 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;@41c2834a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:32:46,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:32:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:46,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 10:32:46,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:46,308 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] [2025-03-03 10:32:46,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:46,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:46,313 INFO L85 PathProgramCache]: Analyzing trace with hash -362269229, now seen corresponding path program 1 times [2025-03-03 10:32:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:46,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025391353] [2025-03-03 10:32:46,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:46,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 10:32:46,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 10:32:46,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:46,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:46,538 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 10:32:46,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:46,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025391353] [2025-03-03 10:32:46,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025391353] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:46,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:46,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:46,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977793713] [2025-03-03 10:32:46,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:46,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:46,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:46,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:46,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:46,557 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:47,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:47,422 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-03-03 10:32:47,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:47,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-03 10:32:47,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:47,431 INFO L225 Difference]: With dead ends: 761 [2025-03-03 10:32:47,431 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 10:32:47,434 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 10:32:47,435 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 199 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:47,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 10:32:47,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-03 10:32:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:47,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-03-03 10:32:47,475 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 29 [2025-03-03 10:32:47,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:47,476 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-03-03 10:32:47,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:47,476 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-03-03 10:32:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-03 10:32:47,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:47,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:32:47,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:32:47,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:47,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1515858429, now seen corresponding path program 1 times [2025-03-03 10:32:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222182667] [2025-03-03 10:32:47,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:47,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-03 10:32:47,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-03 10:32:47,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:47,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:47,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222182667] [2025-03-03 10:32:47,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222182667] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:47,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:47,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:47,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802885576] [2025-03-03 10:32:47,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:47,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:47,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:47,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:47,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:47,723 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:48,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:48,317 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-03-03 10:32:48,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:48,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2025-03-03 10:32:48,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:48,321 INFO L225 Difference]: With dead ends: 1211 [2025-03-03 10:32:48,321 INFO L226 Difference]: Without dead ends: 800 [2025-03-03 10:32:48,322 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 10:32:48,322 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:48,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-03 10:32:48,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-03-03 10:32:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-03-03 10:32:48,350 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 97 [2025-03-03 10:32:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:48,350 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-03-03 10:32:48,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-03-03 10:32:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 10:32:48,351 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:48,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:32:48,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:32:48,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:48,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1160047449, now seen corresponding path program 1 times [2025-03-03 10:32:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:48,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492024610] [2025-03-03 10:32:48,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:48,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 10:32:48,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 10:32:48,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:48,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:48,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:48,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492024610] [2025-03-03 10:32:48,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492024610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:48,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:48,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:48,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916133486] [2025-03-03 10:32:48,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:48,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:48,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:48,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:48,738 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:49,752 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-03-03 10:32:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:49,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-03-03 10:32:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:49,757 INFO L225 Difference]: With dead ends: 2505 [2025-03-03 10:32:49,757 INFO L226 Difference]: Without dead ends: 1718 [2025-03-03 10:32:49,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:32:49,759 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:49,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:32:49,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-03 10:32:49,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-03-03 10:32:49,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-03-03 10:32:49,781 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 98 [2025-03-03 10:32:49,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:49,782 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-03-03 10:32:49,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:49,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-03-03 10:32:49,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 10:32:49,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:49,783 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:32:49,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:32:49,784 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:49,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:49,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1295171761, now seen corresponding path program 1 times [2025-03-03 10:32:49,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:49,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815241229] [2025-03-03 10:32:49,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:49,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:49,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 10:32:49,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 10:32:49,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:49,961 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:49,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:49,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815241229] [2025-03-03 10:32:49,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815241229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:49,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:49,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:49,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719759310] [2025-03-03 10:32:49,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:49,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:49,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:49,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:49,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:49,962 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:50,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:50,936 INFO L93 Difference]: Finished difference Result 5296 states and 6687 transitions. [2025-03-03 10:32:50,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:50,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-03 10:32:50,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:50,949 INFO L225 Difference]: With dead ends: 5296 [2025-03-03 10:32:50,949 INFO L226 Difference]: Without dead ends: 3768 [2025-03-03 10:32:50,951 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 10:32:50,952 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 365 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 365 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:50,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [365 Valid, 87 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:32:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2025-03-03 10:32:50,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3767. [2025-03-03 10:32:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3767 states, 3766 states have (on average 1.2291556027615507) internal successors, (4629), 3766 states have internal predecessors, (4629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3767 states to 3767 states and 4629 transitions. [2025-03-03 10:32:51,007 INFO L78 Accepts]: Start accepts. Automaton has 3767 states and 4629 transitions. Word has length 156 [2025-03-03 10:32:51,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:51,008 INFO L471 AbstractCegarLoop]: Abstraction has 3767 states and 4629 transitions. [2025-03-03 10:32:51,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 3767 states and 4629 transitions. [2025-03-03 10:32:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 10:32:51,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:51,012 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:51,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:32:51,012 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:51,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:51,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1452132319, now seen corresponding path program 1 times [2025-03-03 10:32:51,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:51,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018999851] [2025-03-03 10:32:51,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:51,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 10:32:51,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 10:32:51,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:51,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:51,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:51,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018999851] [2025-03-03 10:32:51,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018999851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:51,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:51,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:51,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562615672] [2025-03-03 10:32:51,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:51,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:51,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:51,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:51,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:51,194 INFO L87 Difference]: Start difference. First operand 3767 states and 4629 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:51,770 INFO L93 Difference]: Finished difference Result 8652 states and 10854 transitions. [2025-03-03 10:32:51,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:51,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 209 [2025-03-03 10:32:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:51,784 INFO L225 Difference]: With dead ends: 8652 [2025-03-03 10:32:51,785 INFO L226 Difference]: Without dead ends: 5256 [2025-03-03 10:32:51,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:51,789 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:51,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 346 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2025-03-03 10:32:51,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 5241. [2025-03-03 10:32:51,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5241 states, 5240 states have (on average 1.208206106870229) internal successors, (6331), 5240 states have internal predecessors, (6331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5241 states to 5241 states and 6331 transitions. [2025-03-03 10:32:51,859 INFO L78 Accepts]: Start accepts. Automaton has 5241 states and 6331 transitions. Word has length 209 [2025-03-03 10:32:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:51,859 INFO L471 AbstractCegarLoop]: Abstraction has 5241 states and 6331 transitions. [2025-03-03 10:32:51,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:51,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5241 states and 6331 transitions. [2025-03-03 10:32:51,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-03-03 10:32:51,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:51,882 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:51,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:32:51,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:51,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:51,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1159410437, now seen corresponding path program 1 times [2025-03-03 10:32:51,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:51,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214664978] [2025-03-03 10:32:51,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:51,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:51,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-03-03 10:32:51,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-03-03 10:32:51,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:51,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:52,029 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:32:52,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:52,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214664978] [2025-03-03 10:32:52,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214664978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:52,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:52,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:52,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001562863] [2025-03-03 10:32:52,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:52,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:52,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:52,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:52,034 INFO L87 Difference]: Start difference. First operand 5241 states and 6331 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:52,609 INFO L93 Difference]: Finished difference Result 11049 states and 13480 transitions. [2025-03-03 10:32:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:52,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 210 [2025-03-03 10:32:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:52,626 INFO L225 Difference]: With dead ends: 11049 [2025-03-03 10:32:52,626 INFO L226 Difference]: Without dead ends: 6179 [2025-03-03 10:32:52,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:52,632 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 173 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:52,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 347 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6179 states. [2025-03-03 10:32:52,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6179 to 6161. [2025-03-03 10:32:52,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6161 states, 6160 states have (on average 1.2063311688311689) internal successors, (7431), 6160 states have internal predecessors, (7431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6161 states to 6161 states and 7431 transitions. [2025-03-03 10:32:52,708 INFO L78 Accepts]: Start accepts. Automaton has 6161 states and 7431 transitions. Word has length 210 [2025-03-03 10:32:52,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:52,709 INFO L471 AbstractCegarLoop]: Abstraction has 6161 states and 7431 transitions. [2025-03-03 10:32:52,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 6161 states and 7431 transitions. [2025-03-03 10:32:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-03 10:32:52,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:52,710 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:52,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:32:52,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:52,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash 2027221700, now seen corresponding path program 1 times [2025-03-03 10:32:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288419444] [2025-03-03 10:32:52,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:52,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-03 10:32:52,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-03 10:32:52,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:52,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:52,865 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:32:52,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:52,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288419444] [2025-03-03 10:32:52,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288419444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:52,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:52,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:52,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746811411] [2025-03-03 10:32:52,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:52,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:52,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:52,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:52,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:52,867 INFO L87 Difference]: Start difference. First operand 6161 states and 7431 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:53,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:53,451 INFO L93 Difference]: Finished difference Result 13249 states and 16226 transitions. [2025-03-03 10:32:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:53,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-03-03 10:32:53,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:53,469 INFO L225 Difference]: With dead ends: 13249 [2025-03-03 10:32:53,469 INFO L226 Difference]: Without dead ends: 7459 [2025-03-03 10:32:53,475 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:53,476 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 168 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:53,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:53,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7459 states. [2025-03-03 10:32:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7459 to 7265. [2025-03-03 10:32:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7265 states, 7264 states have (on average 1.2014041850220265) internal successors, (8727), 7264 states have internal predecessors, (8727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:53,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 8727 transitions. [2025-03-03 10:32:53,570 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 8727 transitions. Word has length 211 [2025-03-03 10:32:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:53,570 INFO L471 AbstractCegarLoop]: Abstraction has 7265 states and 8727 transitions. [2025-03-03 10:32:53,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:53,570 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 8727 transitions. [2025-03-03 10:32:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-03 10:32:53,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:53,572 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:53,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:32:53,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:53,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash -368895050, now seen corresponding path program 1 times [2025-03-03 10:32:53,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:53,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750724496] [2025-03-03 10:32:53,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:53,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:53,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-03 10:32:53,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-03 10:32:53,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:53,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:53,845 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:53,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:53,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750724496] [2025-03-03 10:32:53,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750724496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:53,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:53,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:53,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364539712] [2025-03-03 10:32:53,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:53,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:53,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:53,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:53,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:53,847 INFO L87 Difference]: Start difference. First operand 7265 states and 8727 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:54,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:54,858 INFO L93 Difference]: Finished difference Result 20643 states and 25402 transitions. [2025-03-03 10:32:54,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:54,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2025-03-03 10:32:54,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:54,881 INFO L225 Difference]: With dead ends: 20643 [2025-03-03 10:32:54,881 INFO L226 Difference]: Without dead ends: 13749 [2025-03-03 10:32:54,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:54,888 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 303 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:54,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 229 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:32:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13749 states. [2025-03-03 10:32:55,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13749 to 13745. [2025-03-03 10:32:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13745 states, 13744 states have (on average 1.1905558789289872) internal successors, (16363), 13744 states have internal predecessors, (16363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:55,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13745 states to 13745 states and 16363 transitions. [2025-03-03 10:32:55,079 INFO L78 Accepts]: Start accepts. Automaton has 13745 states and 16363 transitions. Word has length 231 [2025-03-03 10:32:55,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:55,079 INFO L471 AbstractCegarLoop]: Abstraction has 13745 states and 16363 transitions. [2025-03-03 10:32:55,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 4 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 13745 states and 16363 transitions. [2025-03-03 10:32:55,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2025-03-03 10:32:55,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:55,083 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:55,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:32:55,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:55,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:55,085 INFO L85 PathProgramCache]: Analyzing trace with hash 116105071, now seen corresponding path program 1 times [2025-03-03 10:32:55,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:55,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728310362] [2025-03-03 10:32:55,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:55,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-03-03 10:32:55,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-03-03 10:32:55,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:55,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:55,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:55,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728310362] [2025-03-03 10:32:55,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728310362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:55,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:55,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:32:55,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602741719] [2025-03-03 10:32:55,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:55,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:55,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:55,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:55,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:55,355 INFO L87 Difference]: Start difference. First operand 13745 states and 16363 transitions. Second operand has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:56,396 INFO L93 Difference]: Finished difference Result 32287 states and 39114 transitions. [2025-03-03 10:32:56,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:56,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 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 241 [2025-03-03 10:32:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:56,426 INFO L225 Difference]: With dead ends: 32287 [2025-03-03 10:32:56,426 INFO L226 Difference]: Without dead ends: 18913 [2025-03-03 10:32:56,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:56,438 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 316 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:56,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 131 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:32:56,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18913 states. [2025-03-03 10:32:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18913 to 18898. [2025-03-03 10:32:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18898 states, 18897 states have (on average 1.198179605228343) internal successors, (22642), 18897 states have internal predecessors, (22642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:56,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18898 states to 18898 states and 22642 transitions. [2025-03-03 10:32:56,608 INFO L78 Accepts]: Start accepts. Automaton has 18898 states and 22642 transitions. Word has length 241 [2025-03-03 10:32:56,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:56,608 INFO L471 AbstractCegarLoop]: Abstraction has 18898 states and 22642 transitions. [2025-03-03 10:32:56,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.25) internal successors, (241), 4 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:56,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18898 states and 22642 transitions. [2025-03-03 10:32:56,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-03 10:32:56,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:56,612 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:56,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:32:56,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:56,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:56,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1637469430, now seen corresponding path program 1 times [2025-03-03 10:32:56,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:56,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585389136] [2025-03-03 10:32:56,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:56,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:56,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-03 10:32:56,696 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-03 10:32:56,696 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:56,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:32:56,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:56,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585389136] [2025-03-03 10:32:56,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585389136] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:56,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:56,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:56,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181211743] [2025-03-03 10:32:56,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:56,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:56,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:56,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:56,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:56,795 INFO L87 Difference]: Start difference. First operand 18898 states and 22642 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:57,463 INFO L93 Difference]: Finished difference Result 37622 states and 45117 transitions. [2025-03-03 10:32:57,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:57,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2025-03-03 10:32:57,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:57,493 INFO L225 Difference]: With dead ends: 37622 [2025-03-03 10:32:57,493 INFO L226 Difference]: Without dead ends: 18910 [2025-03-03 10:32:57,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:57,508 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 172 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:57,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 378 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:57,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2025-03-03 10:32:57,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18713. [2025-03-03 10:32:57,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18713 states, 18712 states have (on average 1.1626763574177) internal successors, (21756), 18712 states have internal predecessors, (21756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:57,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18713 states to 18713 states and 21756 transitions. [2025-03-03 10:32:57,760 INFO L78 Accepts]: Start accepts. Automaton has 18713 states and 21756 transitions. Word has length 248 [2025-03-03 10:32:57,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:57,760 INFO L471 AbstractCegarLoop]: Abstraction has 18713 states and 21756 transitions. [2025-03-03 10:32:57,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:57,760 INFO L276 IsEmpty]: Start isEmpty. Operand 18713 states and 21756 transitions. [2025-03-03 10:32:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-03-03 10:32:57,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:57,764 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:32:57,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:32:57,764 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:57,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1943649273, now seen corresponding path program 1 times [2025-03-03 10:32:57,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552430718] [2025-03-03 10:32:57,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:57,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-03-03 10:32:57,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-03-03 10:32:57,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:57,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:57,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552430718] [2025-03-03 10:32:57,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552430718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:57,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:57,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:57,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297017862] [2025-03-03 10:32:57,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:57,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:57,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:57,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:57,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:57,985 INFO L87 Difference]: Start difference. First operand 18713 states and 21756 transitions. Second operand has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:58,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:58,927 INFO L93 Difference]: Finished difference Result 39443 states and 46209 transitions. [2025-03-03 10:32:58,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:58,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 262 [2025-03-03 10:32:58,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:58,961 INFO L225 Difference]: With dead ends: 39443 [2025-03-03 10:32:58,962 INFO L226 Difference]: Without dead ends: 20548 [2025-03-03 10:32:58,977 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 10:32:58,977 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 194 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 1162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:58,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 179 Invalid, 1162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:58,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20548 states. [2025-03-03 10:32:59,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20548 to 18323. [2025-03-03 10:32:59,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18323 states, 18322 states have (on average 1.1256413055343304) internal successors, (20624), 18322 states have internal predecessors, (20624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:59,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18323 states to 18323 states and 20624 transitions. [2025-03-03 10:32:59,183 INFO L78 Accepts]: Start accepts. Automaton has 18323 states and 20624 transitions. Word has length 262 [2025-03-03 10:32:59,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:59,184 INFO L471 AbstractCegarLoop]: Abstraction has 18323 states and 20624 transitions. [2025-03-03 10:32:59,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.5) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:59,184 INFO L276 IsEmpty]: Start isEmpty. Operand 18323 states and 20624 transitions. [2025-03-03 10:32:59,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-03 10:32:59,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:59,191 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:32:59,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:32:59,192 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:59,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:59,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1968632706, now seen corresponding path program 1 times [2025-03-03 10:32:59,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:59,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084735256] [2025-03-03 10:32:59,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:59,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:59,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-03 10:32:59,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-03 10:32:59,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:59,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 303 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-03 10:32:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:59,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084735256] [2025-03-03 10:32:59,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084735256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:59,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048503159] [2025-03-03 10:32:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:59,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:59,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:59,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:59,340 INFO L87 Difference]: Start difference. First operand 18323 states and 20624 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:59,820 INFO L93 Difference]: Finished difference Result 38295 states and 43086 transitions. [2025-03-03 10:32:59,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:59,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 296 [2025-03-03 10:32:59,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:59,848 INFO L225 Difference]: With dead ends: 38295 [2025-03-03 10:32:59,848 INFO L226 Difference]: Without dead ends: 22370 [2025-03-03 10:32:59,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:59,860 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 193 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:59,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 148 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:32:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22370 states. [2025-03-03 10:33:00,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22370 to 14082. [2025-03-03 10:33:00,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14082 states, 14081 states have (on average 1.1337973155315673) internal successors, (15965), 14081 states have internal predecessors, (15965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:00,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14082 states to 14082 states and 15965 transitions. [2025-03-03 10:33:00,104 INFO L78 Accepts]: Start accepts. Automaton has 14082 states and 15965 transitions. Word has length 296 [2025-03-03 10:33:00,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:00,105 INFO L471 AbstractCegarLoop]: Abstraction has 14082 states and 15965 transitions. [2025-03-03 10:33:00,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 14082 states and 15965 transitions. [2025-03-03 10:33:00,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-03 10:33:00,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:00,110 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:33:00,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:33:00,110 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:00,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1156186785, now seen corresponding path program 1 times [2025-03-03 10:33:00,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:00,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102637066] [2025-03-03 10:33:00,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:00,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 10:33:00,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 10:33:00,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:00,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 56 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:00,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102637066] [2025-03-03 10:33:00,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102637066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:00,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2129568425] [2025-03-03 10:33:00,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:00,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:00,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:00,430 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 10:33:00,432 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 10:33:00,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-03 10:33:00,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-03 10:33:00,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:00,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:00,562 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:33:00,570 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-03 10:33:00,638 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2129568425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:00,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:00,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 10:33:00,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647675040] [2025-03-03 10:33:00,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:00,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:00,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:00,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:00,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:33:00,640 INFO L87 Difference]: Start difference. First operand 14082 states and 15965 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:01,135 INFO L93 Difference]: Finished difference Result 28898 states and 32763 transitions. [2025-03-03 10:33:01,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:01,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 309 [2025-03-03 10:33:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:01,149 INFO L225 Difference]: With dead ends: 28898 [2025-03-03 10:33:01,149 INFO L226 Difference]: Without dead ends: 14818 [2025-03-03 10:33:01,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 309 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 10:33:01,159 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 162 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:01,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 382 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:01,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14818 states. [2025-03-03 10:33:01,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14818 to 14450. [2025-03-03 10:33:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14450 states, 14449 states have (on average 1.1314969894110318) internal successors, (16349), 14449 states have internal predecessors, (16349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14450 states to 14450 states and 16349 transitions. [2025-03-03 10:33:01,270 INFO L78 Accepts]: Start accepts. Automaton has 14450 states and 16349 transitions. Word has length 309 [2025-03-03 10:33:01,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:01,271 INFO L471 AbstractCegarLoop]: Abstraction has 14450 states and 16349 transitions. [2025-03-03 10:33:01,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:01,271 INFO L276 IsEmpty]: Start isEmpty. Operand 14450 states and 16349 transitions. [2025-03-03 10:33:01,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2025-03-03 10:33:01,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:01,275 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 10:33:01,282 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 10:33:01,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 10:33:01,476 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1078475730, now seen corresponding path program 1 times [2025-03-03 10:33:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471221675] [2025-03-03 10:33:01,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:01,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 10:33:01,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 10:33:01,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:01,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 225 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:33:01,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471221675] [2025-03-03 10:33:01,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471221675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:01,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63598796] [2025-03-03 10:33:01,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:01,923 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 10:33:01,925 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 10:33:01,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes. [2025-03-03 10:33:02,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements. [2025-03-03 10:33:02,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:02,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:02,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 10:33:02,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:02,424 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-03 10:33:02,424 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:33:02,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63598796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:02,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:33:02,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:33:02,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912943563] [2025-03-03 10:33:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:02,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:02,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:02,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:02,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:33:02,426 INFO L87 Difference]: Start difference. First operand 14450 states and 16349 transitions. Second operand has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:03,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:03,034 INFO L93 Difference]: Finished difference Result 33878 states and 38197 transitions. [2025-03-03 10:33:03,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:03,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 316 [2025-03-03 10:33:03,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:03,054 INFO L225 Difference]: With dead ends: 33878 [2025-03-03 10:33:03,055 INFO L226 Difference]: Without dead ends: 19430 [2025-03-03 10:33:03,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:33:03,063 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 294 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:03,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 156 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:33:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19430 states. [2025-03-03 10:33:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19430 to 19426. [2025-03-03 10:33:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19426 states, 19425 states have (on average 1.1233976833976833) internal successors, (21822), 19425 states have internal predecessors, (21822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19426 states to 19426 states and 21822 transitions. [2025-03-03 10:33:03,270 INFO L78 Accepts]: Start accepts. Automaton has 19426 states and 21822 transitions. Word has length 316 [2025-03-03 10:33:03,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:03,270 INFO L471 AbstractCegarLoop]: Abstraction has 19426 states and 21822 transitions. [2025-03-03 10:33:03,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.25) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:03,270 INFO L276 IsEmpty]: Start isEmpty. Operand 19426 states and 21822 transitions. [2025-03-03 10:33:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-03 10:33:03,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:03,278 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:33:03,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 10:33:03,479 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,SelfDestructingSolverStorable13 [2025-03-03 10:33:03,479 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:03,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:03,479 INFO L85 PathProgramCache]: Analyzing trace with hash 613154714, now seen corresponding path program 1 times [2025-03-03 10:33:03,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:03,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033189450] [2025-03-03 10:33:03,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:03,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:03,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-03 10:33:03,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-03 10:33:03,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:03,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-03 10:33:03,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033189450] [2025-03-03 10:33:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033189450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:03,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:03,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701073788] [2025-03-03 10:33:03,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:03,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:03,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:03,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:03,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:03,800 INFO L87 Difference]: Start difference. First operand 19426 states and 21822 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:04,379 INFO L93 Difference]: Finished difference Result 39785 states and 44748 transitions. [2025-03-03 10:33:04,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:04,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2025-03-03 10:33:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:04,399 INFO L225 Difference]: With dead ends: 39785 [2025-03-03 10:33:04,399 INFO L226 Difference]: Without dead ends: 22757 [2025-03-03 10:33:04,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:04,412 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:04,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 145 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:33:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22757 states. [2025-03-03 10:33:04,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22757 to 19238. [2025-03-03 10:33:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19238 states, 19237 states have (on average 1.1226282684410251) internal successors, (21596), 19237 states have internal predecessors, (21596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:04,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19238 states to 19238 states and 21596 transitions. [2025-03-03 10:33:04,568 INFO L78 Accepts]: Start accepts. Automaton has 19238 states and 21596 transitions. Word has length 327 [2025-03-03 10:33:04,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:04,568 INFO L471 AbstractCegarLoop]: Abstraction has 19238 states and 21596 transitions. [2025-03-03 10:33:04,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:04,568 INFO L276 IsEmpty]: Start isEmpty. Operand 19238 states and 21596 transitions. [2025-03-03 10:33:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-03 10:33:04,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:04,573 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:33:04,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:33:04,573 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:04,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:04,574 INFO L85 PathProgramCache]: Analyzing trace with hash -966157961, now seen corresponding path program 1 times [2025-03-03 10:33:04,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:04,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904395748] [2025-03-03 10:33:04,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:04,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:04,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-03 10:33:04,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-03 10:33:04,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:04,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-03-03 10:33:04,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:04,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904395748] [2025-03-03 10:33:04,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904395748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:04,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:04,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 10:33:04,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485162394] [2025-03-03 10:33:04,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 10:33:04,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:04,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 10:33:04,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:33:04,931 INFO L87 Difference]: Start difference. First operand 19238 states and 21596 transitions. Second operand has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:05,739 INFO L93 Difference]: Finished difference Result 36926 states and 41514 transitions. [2025-03-03 10:33:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 10:33:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 333 [2025-03-03 10:33:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:05,757 INFO L225 Difference]: With dead ends: 36926 [2025-03-03 10:33:05,758 INFO L226 Difference]: Without dead ends: 17748 [2025-03-03 10:33:05,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:33:05,770 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 217 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:05,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 133 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:33:05,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17748 states. [2025-03-03 10:33:05,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17748 to 17736. [2025-03-03 10:33:05,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17736 states, 17735 states have (on average 1.1225260783760924) internal successors, (19908), 17735 states have internal predecessors, (19908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:05,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17736 states to 17736 states and 19908 transitions. [2025-03-03 10:33:05,903 INFO L78 Accepts]: Start accepts. Automaton has 17736 states and 19908 transitions. Word has length 333 [2025-03-03 10:33:05,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:05,903 INFO L471 AbstractCegarLoop]: Abstraction has 17736 states and 19908 transitions. [2025-03-03 10:33:05,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:05,903 INFO L276 IsEmpty]: Start isEmpty. Operand 17736 states and 19908 transitions. [2025-03-03 10:33:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-03 10:33:05,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:05,908 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:33:05,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:33:05,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:05,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2033279819, now seen corresponding path program 1 times [2025-03-03 10:33:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:05,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043383355] [2025-03-03 10:33:05,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:05,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-03 10:33:05,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-03 10:33:05,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:05,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-03 10:33:06,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:06,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043383355] [2025-03-03 10:33:06,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043383355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:06,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:06,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:33:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291962887] [2025-03-03 10:33:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:06,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:06,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:06,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:06,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:06,180 INFO L87 Difference]: Start difference. First operand 17736 states and 19908 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:07,015 INFO L93 Difference]: Finished difference Result 38607 states and 43438 transitions. [2025-03-03 10:33:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 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 338 [2025-03-03 10:33:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:07,036 INFO L225 Difference]: With dead ends: 38607 [2025-03-03 10:33:07,036 INFO L226 Difference]: Without dead ends: 21606 [2025-03-03 10:33:07,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:07,047 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 302 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1382 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:07,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 341 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1382 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 10:33:07,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21606 states. [2025-03-03 10:33:07,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21606 to 17725. [2025-03-03 10:33:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17725 states, 17724 states have (on average 1.0964793500338523) internal successors, (19434), 17724 states have internal predecessors, (19434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 19434 transitions. [2025-03-03 10:33:07,181 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 19434 transitions. Word has length 338 [2025-03-03 10:33:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:07,181 INFO L471 AbstractCegarLoop]: Abstraction has 17725 states and 19434 transitions. [2025-03-03 10:33:07,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 19434 transitions. [2025-03-03 10:33:07,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-03 10:33:07,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:07,192 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:33:07,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:33:07,193 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:07,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:07,193 INFO L85 PathProgramCache]: Analyzing trace with hash 969621254, now seen corresponding path program 1 times [2025-03-03 10:33:07,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:07,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125463660] [2025-03-03 10:33:07,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:07,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:07,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-03 10:33:07,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-03 10:33:07,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:07,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 507 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-03 10:33:07,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125463660] [2025-03-03 10:33:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125463660] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:07,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:07,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325934644] [2025-03-03 10:33:07,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:07,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:07,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:07,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:07,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:07,397 INFO L87 Difference]: Start difference. First operand 17725 states and 19434 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:07,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:07,808 INFO L93 Difference]: Finished difference Result 37288 states and 40946 transitions. [2025-03-03 10:33:07,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:07,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 433 [2025-03-03 10:33:07,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:07,826 INFO L225 Difference]: With dead ends: 37288 [2025-03-03 10:33:07,826 INFO L226 Difference]: Without dead ends: 19933 [2025-03-03 10:33:07,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:07,837 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 107 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:07,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 351 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:33:07,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19933 states. [2025-03-03 10:33:07,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19933 to 18829. [2025-03-03 10:33:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18829 states, 18828 states have (on average 1.0929997875504567) internal successors, (20579), 18828 states have internal predecessors, (20579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:07,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18829 states to 18829 states and 20579 transitions. [2025-03-03 10:33:07,972 INFO L78 Accepts]: Start accepts. Automaton has 18829 states and 20579 transitions. Word has length 433 [2025-03-03 10:33:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:07,972 INFO L471 AbstractCegarLoop]: Abstraction has 18829 states and 20579 transitions. [2025-03-03 10:33:07,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:07,973 INFO L276 IsEmpty]: Start isEmpty. Operand 18829 states and 20579 transitions. [2025-03-03 10:33:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-03 10:33:07,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:07,982 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:07,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:33:07,982 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:07,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1525603539, now seen corresponding path program 1 times [2025-03-03 10:33:07,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:07,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976852670] [2025-03-03 10:33:07,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:07,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:08,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-03 10:33:08,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-03 10:33:08,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:08,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:08,754 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976852670] [2025-03-03 10:33:08,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976852670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:33:08,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917755127] [2025-03-03 10:33:08,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:08,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:08,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:33:08,757 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 10:33:08,758 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 10:33:08,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-03 10:33:08,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-03 10:33:08,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:08,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:08,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 10:33:08,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:33:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 154 proven. 259 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:10,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:33:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 170 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:33:12,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917755127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:33:12,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:33:12,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-03 10:33:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912949756] [2025-03-03 10:33:12,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:33:12,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 10:33:12,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:12,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 10:33:12,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-03 10:33:12,520 INFO L87 Difference]: Start difference. First operand 18829 states and 20579 transitions. Second operand has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:15,814 INFO L93 Difference]: Finished difference Result 41708 states and 45568 transitions. [2025-03-03 10:33:15,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-03 10:33:15,815 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 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 441 [2025-03-03 10:33:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:15,841 INFO L225 Difference]: With dead ends: 41708 [2025-03-03 10:33:15,841 INFO L226 Difference]: Without dead ends: 25275 [2025-03-03 10:33:15,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 874 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=245, Unknown=0, NotChecked=0, Total=380 [2025-03-03 10:33:15,856 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1383 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 6268 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1383 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 6268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:15,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1383 Valid, 212 Invalid, 6760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 6268 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-03-03 10:33:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25275 states. [2025-03-03 10:33:16,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25275 to 20113. [2025-03-03 10:33:16,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20113 states, 20112 states have (on average 1.0893993635640413) internal successors, (21910), 20112 states have internal predecessors, (21910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20113 states to 20113 states and 21910 transitions. [2025-03-03 10:33:16,041 INFO L78 Accepts]: Start accepts. Automaton has 20113 states and 21910 transitions. Word has length 441 [2025-03-03 10:33:16,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:16,041 INFO L471 AbstractCegarLoop]: Abstraction has 20113 states and 21910 transitions. [2025-03-03 10:33:16,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 99.53846153846153) internal successors, (1294), 12 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:16,041 INFO L276 IsEmpty]: Start isEmpty. Operand 20113 states and 21910 transitions. [2025-03-03 10:33:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2025-03-03 10:33:16,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:16,055 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:16,061 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 10:33:16,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:33:16,255 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:16,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:16,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1106472777, now seen corresponding path program 1 times [2025-03-03 10:33:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:16,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902178894] [2025-03-03 10:33:16,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:16,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 531 statements into 1 equivalence classes. [2025-03-03 10:33:16,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 531 of 531 statements. [2025-03-03 10:33:16,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:16,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-03 10:33:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902178894] [2025-03-03 10:33:16,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902178894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:16,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:16,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:16,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812315705] [2025-03-03 10:33:16,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:16,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:33:16,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:16,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:33:16,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:33:16,494 INFO L87 Difference]: Start difference. First operand 20113 states and 21910 transitions. Second operand has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:17,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:17,189 INFO L93 Difference]: Finished difference Result 39130 states and 42644 transitions. [2025-03-03 10:33:17,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:33:17,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 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 531 [2025-03-03 10:33:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:17,208 INFO L225 Difference]: With dead ends: 39130 [2025-03-03 10:33:17,208 INFO L226 Difference]: Without dead ends: 21781 [2025-03-03 10:33:17,218 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 10:33:17,218 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 166 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:17,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 63 Invalid, 1117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:33:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21781 states. [2025-03-03 10:33:17,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21781 to 19929. [2025-03-03 10:33:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19929 states, 19928 states have (on average 1.0882677639502207) internal successors, (21687), 19928 states have internal predecessors, (21687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:17,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19929 states to 19929 states and 21687 transitions. [2025-03-03 10:33:17,372 INFO L78 Accepts]: Start accepts. Automaton has 19929 states and 21687 transitions. Word has length 531 [2025-03-03 10:33:17,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:17,372 INFO L471 AbstractCegarLoop]: Abstraction has 19929 states and 21687 transitions. [2025-03-03 10:33:17,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.5) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:17,373 INFO L276 IsEmpty]: Start isEmpty. Operand 19929 states and 21687 transitions. [2025-03-03 10:33:17,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-03-03 10:33:17,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:17,383 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:17,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:33:17,384 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:17,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:17,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1102497269, now seen corresponding path program 1 times [2025-03-03 10:33:17,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:17,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846150399] [2025-03-03 10:33:17,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:17,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:17,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-03-03 10:33:17,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-03-03 10:33:17,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:17,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:17,624 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-03 10:33:17,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:17,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846150399] [2025-03-03 10:33:17,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846150399] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:17,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:17,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:17,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684976645] [2025-03-03 10:33:17,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:17,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:17,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:17,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:17,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:17,626 INFO L87 Difference]: Start difference. First operand 19929 states and 21687 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:18,053 INFO L93 Difference]: Finished difference Result 37845 states and 41169 transitions. [2025-03-03 10:33:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:18,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 545 [2025-03-03 10:33:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:18,070 INFO L225 Difference]: With dead ends: 37845 [2025-03-03 10:33:18,070 INFO L226 Difference]: Without dead ends: 20496 [2025-03-03 10:33:18,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:18,079 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 105 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:18,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 150 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:18,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20496 states. [2025-03-03 10:33:18,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20496 to 12931. [2025-03-03 10:33:18,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12931 states, 12930 states have (on average 1.0876256767208043) internal successors, (14063), 12930 states have internal predecessors, (14063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:18,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12931 states to 12931 states and 14063 transitions. [2025-03-03 10:33:18,184 INFO L78 Accepts]: Start accepts. Automaton has 12931 states and 14063 transitions. Word has length 545 [2025-03-03 10:33:18,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:18,184 INFO L471 AbstractCegarLoop]: Abstraction has 12931 states and 14063 transitions. [2025-03-03 10:33:18,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:18,184 INFO L276 IsEmpty]: Start isEmpty. Operand 12931 states and 14063 transitions. [2025-03-03 10:33:18,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-03-03 10:33:18,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:18,191 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:18,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 10:33:18,191 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:18,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:18,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1589998242, now seen corresponding path program 1 times [2025-03-03 10:33:18,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:18,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001763592] [2025-03-03 10:33:18,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:18,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-03-03 10:33:18,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-03-03 10:33:18,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:18,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:18,344 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2025-03-03 10:33:18,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:18,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001763592] [2025-03-03 10:33:18,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001763592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:18,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:18,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:18,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236037943] [2025-03-03 10:33:18,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:18,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:18,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:18,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:18,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:18,346 INFO L87 Difference]: Start difference. First operand 12931 states and 14063 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:18,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:18,743 INFO L93 Difference]: Finished difference Result 27148 states and 29461 transitions. [2025-03-03 10:33:18,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:18,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 546 [2025-03-03 10:33:18,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:18,755 INFO L225 Difference]: With dead ends: 27148 [2025-03-03 10:33:18,755 INFO L226 Difference]: Without dead ends: 14035 [2025-03-03 10:33:18,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:18,763 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 100 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:18,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 129 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:33:18,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14035 states. [2025-03-03 10:33:18,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14035 to 11821. [2025-03-03 10:33:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11821 states, 11820 states have (on average 1.0866328257191202) internal successors, (12844), 11820 states have internal predecessors, (12844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:18,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11821 states to 11821 states and 12844 transitions. [2025-03-03 10:33:18,847 INFO L78 Accepts]: Start accepts. Automaton has 11821 states and 12844 transitions. Word has length 546 [2025-03-03 10:33:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:18,847 INFO L471 AbstractCegarLoop]: Abstraction has 11821 states and 12844 transitions. [2025-03-03 10:33:18,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 11821 states and 12844 transitions. [2025-03-03 10:33:18,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-03 10:33:18,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:18,855 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:33:18,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 10:33:18,855 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:18,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:18,856 INFO L85 PathProgramCache]: Analyzing trace with hash 640882642, now seen corresponding path program 1 times [2025-03-03 10:33:18,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:18,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077022437] [2025-03-03 10:33:18,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:18,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:18,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-03 10:33:18,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-03 10:33:18,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:18,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1103 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2025-03-03 10:33:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077022437] [2025-03-03 10:33:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077022437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152740919] [2025-03-03 10:33:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:19,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:19,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:19,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:19,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:19,062 INFO L87 Difference]: Start difference. First operand 11821 states and 12844 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) 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) [2025-03-03 10:33:19,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:19,463 INFO L93 Difference]: Finished difference Result 22899 states and 24838 transitions. [2025-03-03 10:33:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:19,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) 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) Word has length 596 [2025-03-03 10:33:19,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:19,471 INFO L225 Difference]: With dead ends: 22899 [2025-03-03 10:33:19,471 INFO L226 Difference]: Without dead ends: 11080 [2025-03-03 10:33:19,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:19,478 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 190 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:19,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 316 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 10:33:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11080 states. [2025-03-03 10:33:19,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11080 to 11080. [2025-03-03 10:33:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11080 states, 11079 states have (on average 1.0778951168878057) internal successors, (11942), 11079 states have internal predecessors, (11942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11080 states to 11080 states and 11942 transitions. [2025-03-03 10:33:19,547 INFO L78 Accepts]: Start accepts. Automaton has 11080 states and 11942 transitions. Word has length 596 [2025-03-03 10:33:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:19,547 INFO L471 AbstractCegarLoop]: Abstraction has 11080 states and 11942 transitions. [2025-03-03 10:33:19,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) 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) [2025-03-03 10:33:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 11080 states and 11942 transitions. [2025-03-03 10:33:19,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2025-03-03 10:33:19,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:33:19,555 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:19,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 10:33:19,555 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:33:19,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:33:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash 500796150, now seen corresponding path program 1 times [2025-03-03 10:33:19,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:33:19,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341954665] [2025-03-03 10:33:19,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:33:19,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:33:19,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 679 statements into 1 equivalence classes. [2025-03-03 10:33:19,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 679 of 679 statements. [2025-03-03 10:33:19,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:33:19,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:33:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 979 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-03-03 10:33:19,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:33:19,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341954665] [2025-03-03 10:33:19,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341954665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:33:19,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:33:19,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:33:19,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250541250] [2025-03-03 10:33:19,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:33:19,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:33:19,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:33:19,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:33:19,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:19,738 INFO L87 Difference]: Start difference. First operand 11080 states and 11942 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:20,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:33:20,126 INFO L93 Difference]: Finished difference Result 22155 states and 23845 transitions. [2025-03-03 10:33:20,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:33:20,126 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 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 679 [2025-03-03 10:33:20,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:33:20,127 INFO L225 Difference]: With dead ends: 22155 [2025-03-03 10:33:20,127 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:33:20,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:33:20,135 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 52 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:33:20,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 306 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 10:33:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:33:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:33:20,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:33:20,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 679 [2025-03-03 10:33:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:33:20,137 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:33:20,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:33:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:33:20,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:33:20,139 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:33:20,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 10:33:20,141 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:33:20,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:33:26,620 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:33:26,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:33:26 BoogieIcfgContainer [2025-03-03 10:33:26,637 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:33:26,637 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:33:26,637 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:33:26,637 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:33:26,638 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:46" (3/4) ... [2025-03-03 10:33:26,639 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:33:26,659 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:33:26,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:33:26,660 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:33:26,662 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:33:26,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:33:26,777 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:33:26,779 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:33:26,779 INFO L158 Benchmark]: Toolchain (without parser) took 42370.44ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 109.8MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 354.2MB. Max. memory is 16.1GB. [2025-03-03 10:33:26,779 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:33:26,780 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.85ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 67.0MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:33:26,780 INFO L158 Benchmark]: Boogie Procedure Inliner took 91.12ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 50.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:33:26,780 INFO L158 Benchmark]: Boogie Preprocessor took 113.20ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 88.4MB in the end (delta: -38.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2025-03-03 10:33:26,780 INFO L158 Benchmark]: IcfgBuilder took 1209.60ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 88.4MB in the beginning and 270.1MB in the end (delta: -181.7MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. [2025-03-03 10:33:26,780 INFO L158 Benchmark]: TraceAbstraction took 40424.98ms. Allocated memory was 427.8MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 269.0MB in the beginning and 1.2GB in the end (delta: -923.0MB). Peak memory consumption was 903.7MB. Max. memory is 16.1GB. [2025-03-03 10:33:26,780 INFO L158 Benchmark]: Witness Printer took 141.32ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:33:26,781 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.85ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 67.0MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 91.12ms. Allocated memory is still 142.6MB. Free memory was 67.0MB in the beginning and 50.3MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 113.20ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 88.4MB in the end (delta: -38.1MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1209.60ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 88.4MB in the beginning and 270.1MB in the end (delta: -181.7MB). Peak memory consumption was 109.9MB. Max. memory is 16.1GB. * TraceAbstraction took 40424.98ms. Allocated memory was 427.8MB in the beginning and 1.6GB in the end (delta: 1.1GB). Free memory was 269.0MB in the beginning and 1.2GB in the end (delta: -923.0MB). Peak memory consumption was 903.7MB. Max. memory is 16.1GB. * Witness Printer took 141.32ms. Allocated memory is still 1.6GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 103]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 33.9s, OverallIterations: 24, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6123 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6123 mSDsluCounter, 5460 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 915 mSDsCounter, 2603 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24108 IncrementalHoareTripleChecker+Invalid, 26711 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2603 mSolverCounterUnsat, 4545 mSDtfsCounter, 24108 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1593 GetRequests, 1532 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20113occurred in iteration=19, InterpolantAutomatonStates: 94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 24 MinimizatonAttempts, 36653 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 8748 NumberOfCodeBlocks, 8748 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 9161 ConstructedInterpolants, 0 QuantifiedInterpolants, 37968 SizeOfPredicates, 1 NumberOfNonLiveVariables, 1442 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 28 InterpolantComputations, 23 PerfectInterpolantSequences, 9583/10506 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((a23 <= 262) && (a3 == 1)) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) || (((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15))) || (((((((long long) a23 + 43) <= 0) && (a29 <= 140)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a29 + 275802) <= 0) && (a25 == 9)) && (a4 == 1)) && (a23 <= 312))) || ((((a25 == 11) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15))) || ((((((long long) a23 + 43) <= 0) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || ((((((long long) a23 + 127601) <= 0) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a3 == 1) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (13 <= a25))) || (((((((570382 <= a29) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751)))) || ((((((long long) a23 + 127601) <= 0) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || ((((a25 == 9) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 245) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a3 == 1) && (a8 == 15)) && (a25 == 10)) && (a29 <= 130))) || ((((((a29 <= 140) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && (a25 == 10))) || (((((a25 == 12) && (a3 == 1)) && (a23 <= 138)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 9) && (((long long) a23 + 599772) <= 0)) && (a4 == 1))) || (((((307 <= a23) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((a29 <= 275) && (a25 == 12)) && (a3 == 1)) && (a8 == 15))) || ((((((a3 == 1) && ((((a25 != 13) || (a23 < 307)) && ((a23 < 307) || (a25 != 12))) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 138080))) && (a4 == 1)) && (a8 == 15)) && ((a23 < 307) || (((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)) < 483751))) && (13 <= a25))) || (((((a25 <= 10) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a8 == 15)) && (a29 <= 130))) || ((((a25 == 12) && (((long long) a23 + 127601) <= 0)) && (a3 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:33:26,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE