./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label05.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 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 01:41:10,977 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 01:41:11,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 01:41:11,028 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 01:41:11,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 01:41:11,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 01:41:11,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 01:41:11,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 01:41:11,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 01:41:11,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 01:41:11,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 01:41:11,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 01:41:11,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 01:41:11,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 01:41:11,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:41:11,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 01:41:11,056 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 01:41:11,056 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 -> 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 [2025-03-08 01:41:11,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 01:41:11,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 01:41:11,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 01:41:11,300 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 01:41:11,300 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 01:41:11,301 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2025-03-08 01:41:12,474 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95dde1c82/c870949d122e4ea59ca35ab0df35d682/FLAG4cad6a726 [2025-03-08 01:41:12,840 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 01:41:12,842 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2025-03-08 01:41:12,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95dde1c82/c870949d122e4ea59ca35ab0df35d682/FLAG4cad6a726 [2025-03-08 01:41:13,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95dde1c82/c870949d122e4ea59ca35ab0df35d682 [2025-03-08 01:41:13,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 01:41:13,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 01:41:13,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 01:41:13,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 01:41:13,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 01:41:13,083 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bad044d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13, skipping insertion in model container [2025-03-08 01:41:13,084 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 01:41:13,346 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_label05.c[9225,9238] [2025-03-08 01:41:13,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:41:13,520 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 01:41:13,558 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_label05.c[9225,9238] [2025-03-08 01:41:13,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 01:41:13,660 INFO L204 MainTranslator]: Completed translation [2025-03-08 01:41:13,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13 WrapperNode [2025-03-08 01:41:13,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 01:41:13,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 01:41:13,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 01:41:13,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 01:41:13,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,767 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-08 01:41:13,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 01:41:13,768 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 01:41:13,768 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 01:41:13,768 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 01:41:13,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,774 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,830 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 01:41:13,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,857 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,878 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 01:41:13,889 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 01:41:13,889 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 01:41:13,890 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 01:41:13,891 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (1/1) ... [2025-03-08 01:41:13,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 01:41:13,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:13,951 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 01:41:13,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 01:41:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 01:41:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 01:41:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 01:41:13,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 01:41:14,024 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 01:41:14,026 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 01:41:15,303 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-08 01:41:15,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 01:41:15,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 01:41:15,321 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 01:41:15,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:15 BoogieIcfgContainer [2025-03-08 01:41:15,322 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 01:41:15,323 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 01:41:15,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 01:41:15,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 01:41:15,327 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 01:41:13" (1/3) ... [2025-03-08 01:41:15,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fa70aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:15, skipping insertion in model container [2025-03-08 01:41:15,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 01:41:13" (2/3) ... [2025-03-08 01:41:15,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40fa70aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 01:41:15, skipping insertion in model container [2025-03-08 01:41:15,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 01:41:15" (3/3) ... [2025-03-08 01:41:15,330 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label05.c [2025-03-08 01:41:15,343 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 01:41:15,344 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label05.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 01:41:15,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 01:41:15,406 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;@2bf4312c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 01:41:15,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 01:41:15,410 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-08 01:41:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-08 01:41:15,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:15,416 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:15,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2110101337, now seen corresponding path program 1 times [2025-03-08 01:41:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:15,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286900405] [2025-03-08 01:41:15,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:15,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:15,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 01:41:15,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 01:41:15,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:15,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:15,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:15,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:15,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286900405] [2025-03-08 01:41:15,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286900405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:15,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:15,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119371387] [2025-03-08 01:41:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:15,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:15,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:15,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:15,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:15,758 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 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:16,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:16,689 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-03-08 01:41:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-03-08 01:41:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:16,698 INFO L225 Difference]: With dead ends: 761 [2025-03-08 01:41:16,698 INFO L226 Difference]: Without dead ends: 413 [2025-03-08 01:41:16,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:16,702 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 164 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 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.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:16,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:41:16,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-08 01:41:16,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-08 01:41:16,736 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-08 01:41:16,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-03-08 01:41:16,740 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 64 [2025-03-08 01:41:16,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:16,741 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-03-08 01:41:16,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-03-08 01:41:16,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 01:41:16,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:16,744 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:16,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 01:41:16,744 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:16,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:16,745 INFO L85 PathProgramCache]: Analyzing trace with hash -616546564, now seen corresponding path program 1 times [2025-03-08 01:41:16,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:16,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780289919] [2025-03-08 01:41:16,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:16,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:16,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 01:41:16,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 01:41:16,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:16,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:16,990 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:16,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780289919] [2025-03-08 01:41:16,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780289919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:16,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:16,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 01:41:16,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59654394] [2025-03-08 01:41:16,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:16,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:16,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:16,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:16,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:16,995 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:17,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:17,607 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-03-08 01:41:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-03-08 01:41:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:17,612 INFO L225 Difference]: With dead ends: 1211 [2025-03-08 01:41:17,612 INFO L226 Difference]: Without dead ends: 800 [2025-03-08 01:41:17,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:17,616 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-08 01:41:17,617 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-08 01:41:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-08 01:41:17,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-03-08 01:41:17,636 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-08 01:41:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-03-08 01:41:17,641 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 132 [2025-03-08 01:41:17,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:17,641 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-03-08 01:41:17,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-03-08 01:41:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 01:41:17,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:17,645 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:17,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 01:41:17,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:17,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:17,646 INFO L85 PathProgramCache]: Analyzing trace with hash 1894368884, now seen corresponding path program 1 times [2025-03-08 01:41:17,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:17,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757663759] [2025-03-08 01:41:17,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:17,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:17,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 01:41:17,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 01:41:17,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:17,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:18,090 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:18,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757663759] [2025-03-08 01:41:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757663759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:18,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:18,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:18,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163780968] [2025-03-08 01:41:18,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:18,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:18,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:18,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:18,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:18,092 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:19,166 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-03-08 01:41:19,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:19,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-03-08 01:41:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:19,181 INFO L225 Difference]: With dead ends: 2505 [2025-03-08 01:41:19,181 INFO L226 Difference]: Without dead ends: 1718 [2025-03-08 01:41:19,182 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-08 01:41:19,182 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-08 01:41:19,183 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-08 01:41:19,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-03-08 01:41:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-03-08 01:41:19,207 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-08 01:41:19,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-03-08 01:41:19,212 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 133 [2025-03-08 01:41:19,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:19,212 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-03-08 01:41:19,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:19,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-03-08 01:41:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-08 01:41:19,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:19,215 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:19,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 01:41:19,215 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:19,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:19,216 INFO L85 PathProgramCache]: Analyzing trace with hash 747631338, now seen corresponding path program 1 times [2025-03-08 01:41:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:19,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054645283] [2025-03-08 01:41:19,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:19,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-08 01:41:19,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-08 01:41:19,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:19,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:19,418 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:19,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:19,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054645283] [2025-03-08 01:41:19,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054645283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:19,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:19,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:19,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545192536] [2025-03-08 01:41:19,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:19,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:19,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:19,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:19,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:19,420 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:20,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:20,064 INFO L93 Difference]: Finished difference Result 4005 states and 5048 transitions. [2025-03-08 01:41:20,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2025-03-08 01:41:20,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:20,072 INFO L225 Difference]: With dead ends: 4005 [2025-03-08 01:41:20,072 INFO L226 Difference]: Without dead ends: 2477 [2025-03-08 01:41:20,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:20,077 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 171 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:20,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:20,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2025-03-08 01:41:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 2474. [2025-03-08 01:41:20,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2473 states have (on average 1.2308936514355033) internal successors, (3044), 2473 states have internal predecessors, (3044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:20,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 3044 transitions. [2025-03-08 01:41:20,116 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 3044 transitions. Word has length 191 [2025-03-08 01:41:20,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:20,118 INFO L471 AbstractCegarLoop]: Abstraction has 2474 states and 3044 transitions. [2025-03-08 01:41:20,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:20,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 3044 transitions. [2025-03-08 01:41:20,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-08 01:41:20,120 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:20,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:20,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 01:41:20,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:20,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:20,121 INFO L85 PathProgramCache]: Analyzing trace with hash 773111449, now seen corresponding path program 1 times [2025-03-08 01:41:20,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:20,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928791345] [2025-03-08 01:41:20,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:20,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:20,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-08 01:41:20,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-08 01:41:20,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:20,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:20,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:20,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928791345] [2025-03-08 01:41:20,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928791345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:20,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:20,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:20,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640109527] [2025-03-08 01:41:20,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:20,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:20,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:20,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:20,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:20,321 INFO L87 Difference]: Start difference. First operand 2474 states and 3044 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:20,946 INFO L93 Difference]: Finished difference Result 5885 states and 7350 transitions. [2025-03-08 01:41:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 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 244 [2025-03-08 01:41:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:20,956 INFO L225 Difference]: With dead ends: 5885 [2025-03-08 01:41:20,956 INFO L226 Difference]: Without dead ends: 3597 [2025-03-08 01:41:20,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:20,959 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:20,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:20,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3597 states. [2025-03-08 01:41:20,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3597 to 3397. [2025-03-08 01:41:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.2105418138987043) internal successors, (4111), 3396 states have internal predecessors, (4111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4111 transitions. [2025-03-08 01:41:21,008 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4111 transitions. Word has length 244 [2025-03-08 01:41:21,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:21,009 INFO L471 AbstractCegarLoop]: Abstraction has 3397 states and 4111 transitions. [2025-03-08 01:41:21,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4111 transitions. [2025-03-08 01:41:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-03-08 01:41:21,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:21,011 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-08 01:41:21,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 01:41:21,012 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:21,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:21,012 INFO L85 PathProgramCache]: Analyzing trace with hash 2024094327, now seen corresponding path program 1 times [2025-03-08 01:41:21,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:21,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66276648] [2025-03-08 01:41:21,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:21,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:21,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-03-08 01:41:21,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-03-08 01:41:21,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:21,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:21,204 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-08 01:41:21,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:21,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66276648] [2025-03-08 01:41:21,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66276648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:21,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:21,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:21,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767640081] [2025-03-08 01:41:21,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:21,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:21,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:21,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:21,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:21,205 INFO L87 Difference]: Start difference. First operand 3397 states and 4111 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:22,113 INFO L93 Difference]: Finished difference Result 7359 states and 8963 transitions. [2025-03-08 01:41:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:22,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 245 [2025-03-08 01:41:22,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:22,132 INFO L225 Difference]: With dead ends: 7359 [2025-03-08 01:41:22,132 INFO L226 Difference]: Without dead ends: 3964 [2025-03-08 01:41:22,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-08 01:41:22,136 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:22,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 346 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:41:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-03-08 01:41:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 3949. [2025-03-08 01:41:22,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3949 states, 3948 states have (on average 1.2099797365754812) internal successors, (4777), 3948 states have internal predecessors, (4777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3949 states to 3949 states and 4777 transitions. [2025-03-08 01:41:22,187 INFO L78 Accepts]: Start accepts. Automaton has 3949 states and 4777 transitions. Word has length 245 [2025-03-08 01:41:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:22,187 INFO L471 AbstractCegarLoop]: Abstraction has 3949 states and 4777 transitions. [2025-03-08 01:41:22,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3949 states and 4777 transitions. [2025-03-08 01:41:22,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-03-08 01:41:22,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:22,190 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:22,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 01:41:22,190 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:22,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1817716204, now seen corresponding path program 1 times [2025-03-08 01:41:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:22,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378659862] [2025-03-08 01:41:22,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:22,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:22,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-08 01:41:22,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-08 01:41:22,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:22,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:22,420 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-08 01:41:22,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:22,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378659862] [2025-03-08 01:41:22,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378659862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:22,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:22,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:22,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715654828] [2025-03-08 01:41:22,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:22,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:22,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:22,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:22,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:22,423 INFO L87 Difference]: Start difference. First operand 3949 states and 4777 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:23,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:23,066 INFO L93 Difference]: Finished difference Result 8827 states and 10787 transitions. [2025-03-08 01:41:23,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:23,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 246 [2025-03-08 01:41:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:23,077 INFO L225 Difference]: With dead ends: 8827 [2025-03-08 01:41:23,077 INFO L226 Difference]: Without dead ends: 4880 [2025-03-08 01:41:23,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 01:41:23,081 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 133 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:23,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 379 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2025-03-08 01:41:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4869. [2025-03-08 01:41:23,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4869 states, 4868 states have (on average 1.1949465899753493) internal successors, (5817), 4868 states have internal predecessors, (5817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4869 states to 4869 states and 5817 transitions. [2025-03-08 01:41:23,164 INFO L78 Accepts]: Start accepts. Automaton has 4869 states and 5817 transitions. Word has length 246 [2025-03-08 01:41:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:23,164 INFO L471 AbstractCegarLoop]: Abstraction has 4869 states and 5817 transitions. [2025-03-08 01:41:23,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4869 states and 5817 transitions. [2025-03-08 01:41:23,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-03-08 01:41:23,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:23,169 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:23,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 01:41:23,169 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:23,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash -147582750, now seen corresponding path program 1 times [2025-03-08 01:41:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:23,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466302921] [2025-03-08 01:41:23,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:23,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-03-08 01:41:23,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-03-08 01:41:23,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:23,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:23,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466302921] [2025-03-08 01:41:23,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466302921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:23,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:23,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:41:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399333567] [2025-03-08 01:41:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:23,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:23,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:23,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:23,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:23,496 INFO L87 Difference]: Start difference. First operand 4869 states and 5817 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 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-08 01:41:24,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:24,524 INFO L93 Difference]: Finished difference Result 15489 states and 18737 transitions. [2025-03-08 01:41:24,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:24,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 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 266 [2025-03-08 01:41:24,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:24,558 INFO L225 Difference]: With dead ends: 15489 [2025-03-08 01:41:24,558 INFO L226 Difference]: Without dead ends: 10622 [2025-03-08 01:41:24,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:24,566 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 274 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1076 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:24,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 211 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1076 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 01:41:24,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10622 states. [2025-03-08 01:41:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10622 to 10248. [2025-03-08 01:41:24,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10248 states, 10247 states have (on average 1.1747828632770567) internal successors, (12038), 10247 states have internal predecessors, (12038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:24,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10248 states to 10248 states and 12038 transitions. [2025-03-08 01:41:24,718 INFO L78 Accepts]: Start accepts. Automaton has 10248 states and 12038 transitions. Word has length 266 [2025-03-08 01:41:24,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:24,718 INFO L471 AbstractCegarLoop]: Abstraction has 10248 states and 12038 transitions. [2025-03-08 01:41:24,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 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-08 01:41:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 10248 states and 12038 transitions. [2025-03-08 01:41:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-08 01:41:24,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:24,723 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:24,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 01:41:24,724 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:24,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:24,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1009625143, now seen corresponding path program 1 times [2025-03-08 01:41:24,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:24,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25836198] [2025-03-08 01:41:24,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:24,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:24,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-08 01:41:24,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-08 01:41:24,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:24,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:25,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25836198] [2025-03-08 01:41:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25836198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:25,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:25,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 01:41:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134363063] [2025-03-08 01:41:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:25,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:25,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:25,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:25,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:25,016 INFO L87 Difference]: Start difference. First operand 10248 states and 12038 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:26,158 INFO L93 Difference]: Finished difference Result 25302 states and 30140 transitions. [2025-03-08 01:41:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 276 [2025-03-08 01:41:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:26,196 INFO L225 Difference]: With dead ends: 25302 [2025-03-08 01:41:26,196 INFO L226 Difference]: Without dead ends: 15056 [2025-03-08 01:41:26,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:26,208 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 278 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1195 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 1195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:26,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 132 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 1195 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 01:41:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15056 states. [2025-03-08 01:41:26,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15056 to 14673. [2025-03-08 01:41:26,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14673 states, 14672 states have (on average 1.1808887677208288) internal successors, (17326), 14672 states have internal predecessors, (17326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:26,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14673 states to 14673 states and 17326 transitions. [2025-03-08 01:41:26,402 INFO L78 Accepts]: Start accepts. Automaton has 14673 states and 17326 transitions. Word has length 276 [2025-03-08 01:41:26,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:26,402 INFO L471 AbstractCegarLoop]: Abstraction has 14673 states and 17326 transitions. [2025-03-08 01:41:26,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 14673 states and 17326 transitions. [2025-03-08 01:41:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-03-08 01:41:26,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:26,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 01:41:26,407 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:26,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:26,410 INFO L85 PathProgramCache]: Analyzing trace with hash -429354556, now seen corresponding path program 1 times [2025-03-08 01:41:26,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:26,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588846749] [2025-03-08 01:41:26,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:26,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:26,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 01:41:26,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 01:41:26,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:26,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 197 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:26,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588846749] [2025-03-08 01:41:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588846749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145541342] [2025-03-08 01:41:26,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:26,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:26,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:41:26,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 01:41:26,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-03-08 01:41:27,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-03-08 01:41:27,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:27,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:27,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-08 01:41:27,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:27,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:41:28,922 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:28,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145541342] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:41:28,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:41:28,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 01:41:28,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728755192] [2025-03-08 01:41:28,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:41:28,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 01:41:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:28,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 01:41:28,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-08 01:41:28,925 INFO L87 Difference]: Start difference. First operand 14673 states and 17326 transitions. Second operand has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:31,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:31,825 INFO L93 Difference]: Finished difference Result 31817 states and 38074 transitions. [2025-03-08 01:41:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 01:41:31,825 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-03-08 01:41:31,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:31,853 INFO L225 Difference]: With dead ends: 31817 [2025-03-08 01:41:31,853 INFO L226 Difference]: Without dead ends: 17134 [2025-03-08 01:41:31,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=200, Unknown=0, NotChecked=0, Total=306 [2025-03-08 01:41:31,866 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1220 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 4757 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 5384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 4757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:31,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 153 Invalid, 5384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 4757 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-08 01:41:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17134 states. [2025-03-08 01:41:31,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17134 to 15737. [2025-03-08 01:41:32,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15737 states, 15736 states have (on average 1.152325876970005) internal successors, (18133), 15736 states have internal predecessors, (18133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:32,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15737 states to 15737 states and 18133 transitions. [2025-03-08 01:41:32,021 INFO L78 Accepts]: Start accepts. Automaton has 15737 states and 18133 transitions. Word has length 278 [2025-03-08 01:41:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:32,021 INFO L471 AbstractCegarLoop]: Abstraction has 15737 states and 18133 transitions. [2025-03-08 01:41:32,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 15737 states and 18133 transitions. [2025-03-08 01:41:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-03-08 01:41:32,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:32,027 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:32,035 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-08 01:41:32,227 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,SelfDestructingSolverStorable9 [2025-03-08 01:41:32,227 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:32,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:32,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1371446559, now seen corresponding path program 1 times [2025-03-08 01:41:32,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:32,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596289703] [2025-03-08 01:41:32,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:32,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:32,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-03-08 01:41:32,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-03-08 01:41:32,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:32,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:32,520 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:32,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:32,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596289703] [2025-03-08 01:41:32,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596289703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:32,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:32,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 01:41:32,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761465817] [2025-03-08 01:41:32,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:32,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:32,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:32,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:32,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 01:41:32,521 INFO L87 Difference]: Start difference. First operand 15737 states and 18133 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:33,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:33,348 INFO L93 Difference]: Finished difference Result 30520 states and 35154 transitions. [2025-03-08 01:41:33,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:33,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 297 [2025-03-08 01:41:33,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:33,370 INFO L225 Difference]: With dead ends: 30520 [2025-03-08 01:41:33,370 INFO L226 Difference]: Without dead ends: 14601 [2025-03-08 01:41:33,383 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-08 01:41:33,383 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 205 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:33,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 150 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 01:41:33,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2025-03-08 01:41:33,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 12937. [2025-03-08 01:41:33,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.1011904761904763) internal successors, (14245), 12936 states have internal predecessors, (14245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:33,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 14245 transitions. [2025-03-08 01:41:33,506 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 14245 transitions. Word has length 297 [2025-03-08 01:41:33,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:33,506 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 14245 transitions. [2025-03-08 01:41:33,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:33,506 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 14245 transitions. [2025-03-08 01:41:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-03-08 01:41:33,514 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:33,514 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:33,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 01:41:33,515 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:33,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:33,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1495634003, now seen corresponding path program 1 times [2025-03-08 01:41:33,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:33,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113476556] [2025-03-08 01:41:33,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:33,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:33,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-08 01:41:33,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 01:41:33,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:33,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 199 proven. 160 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 01:41:34,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:34,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113476556] [2025-03-08 01:41:34,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113476556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:34,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000177857] [2025-03-08 01:41:34,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:34,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:34,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:41:34,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 01:41:34,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-03-08 01:41:34,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-03-08 01:41:34,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:34,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:34,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:41:34,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:34,487 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 01:41:34,488 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:41:34,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000177857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:34,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:41:34,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-08 01:41:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881115781] [2025-03-08 01:41:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:34,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 01:41:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:34,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 01:41:34,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:41:34,489 INFO L87 Difference]: Start difference. First operand 12937 states and 14245 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:35,117 INFO L93 Difference]: Finished difference Result 26243 states and 28871 transitions. [2025-03-08 01:41:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 01:41:35,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 351 [2025-03-08 01:41:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:35,132 INFO L225 Difference]: With dead ends: 26243 [2025-03-08 01:41:35,133 INFO L226 Difference]: Without dead ends: 13308 [2025-03-08 01:41:35,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-08 01:41:35,141 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 191 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 842 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:35,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 161 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 842 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 01:41:35,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13308 states. [2025-03-08 01:41:35,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13308 to 12385. [2025-03-08 01:41:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12385 states, 12384 states have (on average 1.1013404392764858) internal successors, (13639), 12384 states have internal predecessors, (13639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12385 states to 12385 states and 13639 transitions. [2025-03-08 01:41:35,246 INFO L78 Accepts]: Start accepts. Automaton has 12385 states and 13639 transitions. Word has length 351 [2025-03-08 01:41:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:35,247 INFO L471 AbstractCegarLoop]: Abstraction has 12385 states and 13639 transitions. [2025-03-08 01:41:35,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:35,247 INFO L276 IsEmpty]: Start isEmpty. Operand 12385 states and 13639 transitions. [2025-03-08 01:41:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-08 01:41:35,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:35,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:41:35,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 01:41:35,456 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,SelfDestructingSolverStorable11 [2025-03-08 01:41:35,456 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:35,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:35,457 INFO L85 PathProgramCache]: Analyzing trace with hash 368660832, now seen corresponding path program 1 times [2025-03-08 01:41:35,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:35,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757689306] [2025-03-08 01:41:35,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:35,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:35,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-08 01:41:35,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-08 01:41:35,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:35,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:35,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757689306] [2025-03-08 01:41:35,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757689306] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:35,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142040249] [2025-03-08 01:41:35,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:35,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:35,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:35,749 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:41:35,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 01:41:35,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-08 01:41:35,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-08 01:41:35,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:35,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:35,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-08 01:41:35,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:36,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:41:37,358 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:37,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142040249] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:41:37,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:41:37,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-03-08 01:41:37,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803022428] [2025-03-08 01:41:37,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:41:37,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 01:41:37,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:37,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 01:41:37,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-08 01:41:37,363 INFO L87 Difference]: Start difference. First operand 12385 states and 13639 transitions. Second operand has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:39,534 INFO L93 Difference]: Finished difference Result 39506 states and 43331 transitions. [2025-03-08 01:41:39,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 01:41:39,534 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 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 362 [2025-03-08 01:41:39,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:39,563 INFO L225 Difference]: With dead ends: 39506 [2025-03-08 01:41:39,563 INFO L226 Difference]: Without dead ends: 26939 [2025-03-08 01:41:39,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-03-08 01:41:39,575 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 809 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 809 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:39,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [809 Valid, 128 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 3266 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-08 01:41:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26939 states. [2025-03-08 01:41:39,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26939 to 24356. [2025-03-08 01:41:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24356 states, 24355 states have (on average 1.0910695955655922) internal successors, (26573), 24355 states have internal predecessors, (26573), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24356 states to 24356 states and 26573 transitions. [2025-03-08 01:41:39,822 INFO L78 Accepts]: Start accepts. Automaton has 24356 states and 26573 transitions. Word has length 362 [2025-03-08 01:41:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:39,822 INFO L471 AbstractCegarLoop]: Abstraction has 24356 states and 26573 transitions. [2025-03-08 01:41:39,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 24356 states and 26573 transitions. [2025-03-08 01:41:39,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-03-08 01:41:39,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:39,830 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 01:41:39,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 01:41:40,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:40,031 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:40,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:40,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2100332154, now seen corresponding path program 1 times [2025-03-08 01:41:40,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:40,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837521833] [2025-03-08 01:41:40,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:40,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:40,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 01:41:40,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 01:41:40,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:40,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:40,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837521833] [2025-03-08 01:41:40,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837521833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991793562] [2025-03-08 01:41:40,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:40,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:40,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:41:40,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 01:41:40,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-03-08 01:41:40,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-03-08 01:41:40,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:40,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:40,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 01:41:40,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:44,293 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 96 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:44,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:41:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:45,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991793562] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:41:45,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:41:45,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-08 01:41:45,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542676118] [2025-03-08 01:41:45,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:41:45,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 01:41:45,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:45,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 01:41:45,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-03-08 01:41:45,425 INFO L87 Difference]: Start difference. First operand 24356 states and 26573 transitions. Second operand has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:52,444 INFO L93 Difference]: Finished difference Result 60873 states and 66520 transitions. [2025-03-08 01:41:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 01:41:52,445 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 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 373 [2025-03-08 01:41:52,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:52,486 INFO L225 Difference]: With dead ends: 60873 [2025-03-08 01:41:52,486 INFO L226 Difference]: Without dead ends: 36335 [2025-03-08 01:41:52,499 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-03-08 01:41:52,500 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 3139 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 5200 mSolverCounterSat, 966 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3139 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 6166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 966 IncrementalHoareTripleChecker+Valid, 5200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:52,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3139 Valid, 145 Invalid, 6166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [966 Valid, 5200 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2025-03-08 01:41:52,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36335 states. [2025-03-08 01:41:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36335 to 23616. [2025-03-08 01:41:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 23615 states have (on average 1.0774084268473427) internal successors, (25443), 23615 states have internal predecessors, (25443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:52,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 25443 transitions. [2025-03-08 01:41:52,916 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 25443 transitions. Word has length 373 [2025-03-08 01:41:52,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:52,916 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 25443 transitions. [2025-03-08 01:41:52,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 25443 transitions. [2025-03-08 01:41:52,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-03-08 01:41:52,926 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:52,927 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 01:41:52,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 01:41:53,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:53,128 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:53,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1099104655, now seen corresponding path program 1 times [2025-03-08 01:41:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727994262] [2025-03-08 01:41:53,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:53,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-03-08 01:41:53,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-03-08 01:41:53,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:53,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:53,950 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:41:53,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:53,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727994262] [2025-03-08 01:41:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727994262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 01:41:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889007102] [2025-03-08 01:41:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:53,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 01:41:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:53,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 01:41:53,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:41:53,953 INFO L87 Difference]: Start difference. First operand 23616 states and 25443 transitions. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:55,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:55,459 INFO L93 Difference]: Finished difference Result 52394 states and 56386 transitions. [2025-03-08 01:41:55,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 01:41:55,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 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 459 [2025-03-08 01:41:55,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:55,488 INFO L225 Difference]: With dead ends: 52394 [2025-03-08 01:41:55,488 INFO L226 Difference]: Without dead ends: 28964 [2025-03-08 01:41:55,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:41:55,504 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 323 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:55,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 74 Invalid, 1745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 01:41:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28964 states. [2025-03-08 01:41:55,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28964 to 24356. [2025-03-08 01:41:55,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24356 states, 24355 states have (on average 1.0759597618558818) internal successors, (26205), 24355 states have internal predecessors, (26205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:55,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24356 states to 24356 states and 26205 transitions. [2025-03-08 01:41:55,840 INFO L78 Accepts]: Start accepts. Automaton has 24356 states and 26205 transitions. Word has length 459 [2025-03-08 01:41:55,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:55,841 INFO L471 AbstractCegarLoop]: Abstraction has 24356 states and 26205 transitions. [2025-03-08 01:41:55,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:55,841 INFO L276 IsEmpty]: Start isEmpty. Operand 24356 states and 26205 transitions. [2025-03-08 01:41:55,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-03-08 01:41:55,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:55,864 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:41:55,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 01:41:55,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:55,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:55,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1743892131, now seen corresponding path program 1 times [2025-03-08 01:41:55,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:55,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85050967] [2025-03-08 01:41:55,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:55,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:55,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-03-08 01:41:55,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-03-08 01:41:55,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:55,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:56,359 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 01:41:56,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:56,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85050967] [2025-03-08 01:41:56,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85050967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:56,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 01:41:56,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 01:41:56,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922808487] [2025-03-08 01:41:56,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:56,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 01:41:56,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:56,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 01:41:56,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:41:56,361 INFO L87 Difference]: Start difference. First operand 24356 states and 26205 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:57,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:57,310 INFO L93 Difference]: Finished difference Result 50558 states and 54340 transitions. [2025-03-08 01:41:57,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 01:41:57,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 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 548 [2025-03-08 01:41:57,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:57,339 INFO L225 Difference]: With dead ends: 50558 [2025-03-08 01:41:57,339 INFO L226 Difference]: Without dead ends: 26388 [2025-03-08 01:41:57,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-08 01:41:57,352 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 430 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 1194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:57,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 53 Invalid, 1194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 01:41:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26388 states. [2025-03-08 01:41:57,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26388 to 20856. [2025-03-08 01:41:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20856 states, 20855 states have (on average 1.0759530088707745) internal successors, (22439), 20855 states have internal predecessors, (22439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:57,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20856 states to 20856 states and 22439 transitions. [2025-03-08 01:41:57,564 INFO L78 Accepts]: Start accepts. Automaton has 20856 states and 22439 transitions. Word has length 548 [2025-03-08 01:41:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:57,565 INFO L471 AbstractCegarLoop]: Abstraction has 20856 states and 22439 transitions. [2025-03-08 01:41:57,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:57,565 INFO L276 IsEmpty]: Start isEmpty. Operand 20856 states and 22439 transitions. [2025-03-08 01:41:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-03-08 01:41:57,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:57,586 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:41:57,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 01:41:57,586 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:41:57,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:41:57,587 INFO L85 PathProgramCache]: Analyzing trace with hash -559334575, now seen corresponding path program 1 times [2025-03-08 01:41:57,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:41:57,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037418195] [2025-03-08 01:41:57,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:57,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:41:57,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-08 01:41:57,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-08 01:41:57,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:57,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:58,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 557 proven. 651 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-03-08 01:41:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:41:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037418195] [2025-03-08 01:41:58,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037418195] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:41:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044204886] [2025-03-08 01:41:58,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:41:58,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:41:58,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:41:58,904 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:41:58,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 01:41:58,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-03-08 01:41:59,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-03-08 01:41:59,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:41:59,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:41:59,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 01:41:59,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:41:59,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 777 proven. 0 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-03-08 01:41:59,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 01:41:59,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044204886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 01:41:59,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 01:41:59,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-08 01:41:59,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432374119] [2025-03-08 01:41:59,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 01:41:59,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 01:41:59,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:41:59,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 01:41:59,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 01:41:59,270 INFO L87 Difference]: Start difference. First operand 20856 states and 22439 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:41:59,696 INFO L93 Difference]: Finished difference Result 42093 states and 45287 transitions. [2025-03-08 01:41:59,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 01:41:59,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 693 [2025-03-08 01:41:59,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:41:59,716 INFO L225 Difference]: With dead ends: 42093 [2025-03-08 01:41:59,716 INFO L226 Difference]: Without dead ends: 21423 [2025-03-08 01:41:59,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-08 01:41:59,729 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 104 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:41:59,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 313 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 01:41:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21423 states. [2025-03-08 01:41:59,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21423 to 21230. [2025-03-08 01:41:59,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21230 states, 21229 states have (on average 1.0742380705638512) internal successors, (22805), 21229 states have internal predecessors, (22805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21230 states to 21230 states and 22805 transitions. [2025-03-08 01:41:59,926 INFO L78 Accepts]: Start accepts. Automaton has 21230 states and 22805 transitions. Word has length 693 [2025-03-08 01:41:59,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:41:59,926 INFO L471 AbstractCegarLoop]: Abstraction has 21230 states and 22805 transitions. [2025-03-08 01:41:59,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:41:59,926 INFO L276 IsEmpty]: Start isEmpty. Operand 21230 states and 22805 transitions. [2025-03-08 01:41:59,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-03-08 01:41:59,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 01:41:59,940 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 01:41:59,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 01:42:00,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 01:42:00,141 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 01:42:00,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 01:42:00,142 INFO L85 PathProgramCache]: Analyzing trace with hash -497540732, now seen corresponding path program 1 times [2025-03-08 01:42:00,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 01:42:00,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143327766] [2025-03-08 01:42:00,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:00,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 01:42:00,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-08 01:42:00,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-08 01:42:00,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:00,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:00,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 186 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:00,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 01:42:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143327766] [2025-03-08 01:42:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143327766] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 01:42:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452495116] [2025-03-08 01:42:00,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 01:42:00,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 01:42:00,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 01:42:00,946 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 01:42:00,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 01:42:01,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-03-08 01:42:01,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-03-08 01:42:01,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 01:42:01,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 01:42:01,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 01:42:01,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 01:42:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 62 proven. 1066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 01:42:01,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 01:42:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 771 proven. 233 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-03-08 01:42:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452495116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 01:42:05,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 01:42:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-03-08 01:42:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238687969] [2025-03-08 01:42:05,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 01:42:05,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 01:42:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 01:42:05,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 01:42:05,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-03-08 01:42:05,598 INFO L87 Difference]: Start difference. First operand 21230 states and 22805 transitions. Second operand has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:10,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 01:42:10,377 INFO L93 Difference]: Finished difference Result 77125 states and 82798 transitions. [2025-03-08 01:42:10,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 01:42:10,378 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 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 705 [2025-03-08 01:42:10,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 01:42:10,379 INFO L225 Difference]: With dead ends: 77125 [2025-03-08 01:42:10,379 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 01:42:10,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1434 GetRequests, 1409 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2025-03-08 01:42:10,403 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 2119 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 7922 mSolverCounterSat, 980 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 8902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 980 IncrementalHoareTripleChecker+Valid, 7922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-08 01:42:10,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 255 Invalid, 8902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [980 Valid, 7922 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-03-08 01:42:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 01:42:10,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 01:42:10,403 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-08 01:42:10,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 01:42:10,404 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 705 [2025-03-08 01:42:10,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 01:42:10,404 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 01:42:10,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 01:42:10,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 01:42:10,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 01:42:10,407 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 01:42:10,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 01:42:10,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-08 01:42:10,610 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 01:42:10,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 01:42:33,494 WARN L286 SmtUtils]: Spent 22.88s on a formula simplification. DAG size of input: 873 DAG size of output: 973 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)