./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label53.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/Problem14_label53.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 f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:07:06,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:07:07,015 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:07:07,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:07:07,019 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:07:07,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:07:07,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:07:07,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:07:07,032 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:07:07,032 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:07:07,032 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:07:07,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:07:07,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:07:07,033 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:07:07,034 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:07,034 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:07:07,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:07:07,034 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 -> f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 [2025-03-16 15:07:07,259 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:07:07,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:07:07,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:07:07,268 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:07:07,268 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:07:07,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2025-03-16 15:07:08,434 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f0b48e1/af5337bcea9a46a59c1d216db2e7a28c/FLAGdc9e26697 [2025-03-16 15:07:08,742 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:07:08,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2025-03-16 15:07:08,761 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f0b48e1/af5337bcea9a46a59c1d216db2e7a28c/FLAGdc9e26697 [2025-03-16 15:07:08,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4f0b48e1/af5337bcea9a46a59c1d216db2e7a28c [2025-03-16 15:07:08,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:07:08,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:07:08,782 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:08,783 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:07:08,786 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:07:08,787 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:08" (1/1) ... [2025-03-16 15:07:08,787 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77f39ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:08, skipping insertion in model container [2025-03-16 15:07:08,789 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:07:08" (1/1) ... [2025-03-16 15:07:08,823 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:07:08,958 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/Problem14_label53.c[5103,5116] [2025-03-16 15:07:09,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:09,130 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:07:09,148 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/Problem14_label53.c[5103,5116] [2025-03-16 15:07:09,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:07:09,235 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:07:09,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09 WrapperNode [2025-03-16 15:07:09,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:07:09,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:09,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:07:09,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:07:09,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,311 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-03-16 15:07:09,311 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:07:09,312 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:07:09,312 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:07:09,312 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:07:09,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,356 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-16 15:07:09,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,360 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,383 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,389 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,393 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:07:09,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:07:09,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:07:09,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:07:09,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (1/1) ... [2025-03-16 15:07:09,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:07:09,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:09,427 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-16 15:07:09,432 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-16 15:07:09,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:07:09,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:07:09,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:07:09,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:07:09,488 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:07:09,489 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:07:10,313 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-03-16 15:07:10,314 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:07:10,325 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:07:10,327 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:07:10,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:10 BoogieIcfgContainer [2025-03-16 15:07:10,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:07:10,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:07:10,330 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:07:10,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:07:10,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:07:08" (1/3) ... [2025-03-16 15:07:10,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff64602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:10, skipping insertion in model container [2025-03-16 15:07:10,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:07:09" (2/3) ... [2025-03-16 15:07:10,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff64602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:07:10, skipping insertion in model container [2025-03-16 15:07:10,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:07:10" (3/3) ... [2025-03-16 15:07:10,335 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2025-03-16 15:07:10,346 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:07:10,347 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label53.c that has 1 procedures, 184 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:07:10,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:07:10,404 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;@7ef31804, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:07:10,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:07:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:10,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 15:07:10,413 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:10,414 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] [2025-03-16 15:07:10,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:10,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:10,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1304831671, now seen corresponding path program 1 times [2025-03-16 15:07:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619325320] [2025-03-16 15:07:10,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:10,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:10,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 15:07:10,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 15:07:10,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:10,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:10,522 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-16 15:07:10,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:10,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619325320] [2025-03-16 15:07:10,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619325320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:10,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:10,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:10,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840341350] [2025-03-16 15:07:10,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:10,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:07:10,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:10,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:07:10,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:10,542 INFO L87 Difference]: Start difference. First operand has 184 states, 182 states have (on average 1.978021978021978) internal successors, (360), 183 states have internal predecessors, (360), 0 states have call successors, (0), 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 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:10,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:10,561 INFO L93 Difference]: Finished difference Result 367 states and 719 transitions. [2025-03-16 15:07:10,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:07:10,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 15:07:10,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:10,567 INFO L225 Difference]: With dead ends: 367 [2025-03-16 15:07:10,568 INFO L226 Difference]: Without dead ends: 181 [2025-03-16 15:07:10,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:07:10,571 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:10,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:07:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-16 15:07:10,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-16 15:07:10,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2025-03-16 15:07:10,599 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 48 [2025-03-16 15:07:10,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:10,599 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2025-03-16 15:07:10,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:10,600 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2025-03-16 15:07:10,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-16 15:07:10,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:10,600 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] [2025-03-16 15:07:10,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:07:10,600 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:10,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1617606961, now seen corresponding path program 1 times [2025-03-16 15:07:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511711079] [2025-03-16 15:07:10,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:10,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-16 15:07:10,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-16 15:07:10,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:10,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:10,814 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-16 15:07:10,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:10,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511711079] [2025-03-16 15:07:10,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511711079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:10,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:10,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:10,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056428972] [2025-03-16 15:07:10,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:10,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:10,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:10,816 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:11,440 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2025-03-16 15:07:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:11,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2025-03-16 15:07:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:11,444 INFO L225 Difference]: With dead ends: 539 [2025-03-16 15:07:11,444 INFO L226 Difference]: Without dead ends: 359 [2025-03-16 15:07:11,445 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-16 15:07:11,445 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 133 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:11,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 52 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:11,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-16 15:07:11,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-16 15:07:11,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.5223463687150838) internal successors, (545), 358 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:11,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 545 transitions. [2025-03-16 15:07:11,464 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 545 transitions. Word has length 48 [2025-03-16 15:07:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:11,464 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 545 transitions. [2025-03-16 15:07:11,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 545 transitions. [2025-03-16 15:07:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-16 15:07:11,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:11,467 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:07:11,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:07:11,467 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:11,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:11,469 INFO L85 PathProgramCache]: Analyzing trace with hash -520376883, now seen corresponding path program 1 times [2025-03-16 15:07:11,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:11,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319209368] [2025-03-16 15:07:11,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:11,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:11,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-16 15:07:11,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-16 15:07:11,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:11,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319209368] [2025-03-16 15:07:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319209368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:11,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:11,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:07:11,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696453759] [2025-03-16 15:07:11,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:11,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:11,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:11,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:11,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:11,646 INFO L87 Difference]: Start difference. First operand 359 states and 545 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:12,226 INFO L93 Difference]: Finished difference Result 1073 states and 1632 transitions. [2025-03-16 15:07:12,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:12,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-03-16 15:07:12,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:12,230 INFO L225 Difference]: With dead ends: 1073 [2025-03-16 15:07:12,230 INFO L226 Difference]: Without dead ends: 715 [2025-03-16 15:07:12,231 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-16 15:07:12,231 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:12,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 94 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:12,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-03-16 15:07:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2025-03-16 15:07:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2025-03-16 15:07:12,251 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 123 [2025-03-16 15:07:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:12,251 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2025-03-16 15:07:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2025-03-16 15:07:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-16 15:07:12,254 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:12,254 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 15:07:12,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:07:12,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:12,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1083214505, now seen corresponding path program 1 times [2025-03-16 15:07:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:12,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415673337] [2025-03-16 15:07:12,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:12,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-16 15:07:12,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-16 15:07:12,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:12,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:12,608 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:12,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415673337] [2025-03-16 15:07:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415673337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:12,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:12,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099665690] [2025-03-16 15:07:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:12,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:12,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:12,610 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:13,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:13,295 INFO L93 Difference]: Finished difference Result 1963 states and 2569 transitions. [2025-03-16 15:07:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:13,297 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 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 127 [2025-03-16 15:07:13,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:13,301 INFO L225 Difference]: With dead ends: 1963 [2025-03-16 15:07:13,301 INFO L226 Difference]: Without dead ends: 1249 [2025-03-16 15:07:13,302 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-16 15:07:13,302 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:13,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 120 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2025-03-16 15:07:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2025-03-16 15:07:13,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.236378205128205) internal successors, (1543), 1248 states have internal predecessors, (1543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1543 transitions. [2025-03-16 15:07:13,329 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1543 transitions. Word has length 127 [2025-03-16 15:07:13,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:13,329 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1543 transitions. [2025-03-16 15:07:13,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1543 transitions. [2025-03-16 15:07:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2025-03-16 15:07:13,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:13,335 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 15:07:13,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:07:13,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:13,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:13,336 INFO L85 PathProgramCache]: Analyzing trace with hash 8966670, now seen corresponding path program 1 times [2025-03-16 15:07:13,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:13,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797184258] [2025-03-16 15:07:13,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:13,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:13,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-03-16 15:07:13,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-03-16 15:07:13,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:13,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:13,608 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 15:07:13,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797184258] [2025-03-16 15:07:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797184258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:13,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:13,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880850025] [2025-03-16 15:07:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:13,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:13,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:13,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:13,610 INFO L87 Difference]: Start difference. First operand 1249 states and 1543 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:14,150 INFO L93 Difference]: Finished difference Result 2704 states and 3352 transitions. [2025-03-16 15:07:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:14,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 207 [2025-03-16 15:07:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:14,157 INFO L225 Difference]: With dead ends: 2704 [2025-03-16 15:07:14,157 INFO L226 Difference]: Without dead ends: 1605 [2025-03-16 15:07:14,158 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-16 15:07:14,160 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 116 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:14,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 117 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:07:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2025-03-16 15:07:14,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1605. [2025-03-16 15:07:14,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1221945137157108) internal successors, (1800), 1604 states have internal predecessors, (1800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:14,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1800 transitions. [2025-03-16 15:07:14,184 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1800 transitions. Word has length 207 [2025-03-16 15:07:14,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:14,185 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1800 transitions. [2025-03-16 15:07:14,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:14,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1800 transitions. [2025-03-16 15:07:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-16 15:07:14,187 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:14,188 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:14,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:07:14,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:14,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:14,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1402949714, now seen corresponding path program 1 times [2025-03-16 15:07:14,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:14,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799728499] [2025-03-16 15:07:14,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:14,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:14,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-16 15:07:14,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-16 15:07:14,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:14,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:14,559 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 188 proven. 130 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 15:07:14,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799728499] [2025-03-16 15:07:14,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799728499] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:14,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341562858] [2025-03-16 15:07:14,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:14,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:14,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:14,562 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-16 15:07:14,563 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-16 15:07:14,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-03-16 15:07:14,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-03-16 15:07:14,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:14,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:14,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:14,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:14,752 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-03-16 15:07:14,752 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:14,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341562858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:14,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:14,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:14,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454366415] [2025-03-16 15:07:14,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:14,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:14,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:14,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:14,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:14,753 INFO L87 Difference]: Start difference. First operand 1605 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:15,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:15,211 INFO L93 Difference]: Finished difference Result 3387 states and 3900 transitions. [2025-03-16 15:07:15,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:15,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 334 [2025-03-16 15:07:15,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:15,216 INFO L225 Difference]: With dead ends: 3387 [2025-03-16 15:07:15,217 INFO L226 Difference]: Without dead ends: 1961 [2025-03-16 15:07:15,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:15,218 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 136 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:15,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 252 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2025-03-16 15:07:15,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1961. [2025-03-16 15:07:15,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1961 states, 1960 states have (on average 1.1321428571428571) internal successors, (2219), 1960 states have internal predecessors, (2219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:15,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1961 states to 1961 states and 2219 transitions. [2025-03-16 15:07:15,246 INFO L78 Accepts]: Start accepts. Automaton has 1961 states and 2219 transitions. Word has length 334 [2025-03-16 15:07:15,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:15,246 INFO L471 AbstractCegarLoop]: Abstraction has 1961 states and 2219 transitions. [2025-03-16 15:07:15,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:15,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1961 states and 2219 transitions. [2025-03-16 15:07:15,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-03-16 15:07:15,249 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:15,249 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 15:07:15,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:15,453 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,SelfDestructingSolverStorable5 [2025-03-16 15:07:15,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:15,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:15,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1791925944, now seen corresponding path program 1 times [2025-03-16 15:07:15,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:15,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113056334] [2025-03-16 15:07:15,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:15,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:15,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-16 15:07:15,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-16 15:07:15,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:15,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:15,935 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 271 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:07:15,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:15,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113056334] [2025-03-16 15:07:15,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113056334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:15,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839844532] [2025-03-16 15:07:15,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:15,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:15,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:15,938 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-16 15:07:15,939 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-16 15:07:15,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-03-16 15:07:16,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-03-16 15:07:16,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:16,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:16,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:16,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-03-16 15:07:16,095 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:16,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839844532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:16,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:16,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:16,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774834021] [2025-03-16 15:07:16,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:16,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:16,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:16,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:16,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:16,097 INFO L87 Difference]: Start difference. First operand 1961 states and 2219 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:16,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:16,511 INFO L93 Difference]: Finished difference Result 4277 states and 4948 transitions. [2025-03-16 15:07:16,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:16,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2025-03-16 15:07:16,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:16,517 INFO L225 Difference]: With dead ends: 4277 [2025-03-16 15:07:16,517 INFO L226 Difference]: Without dead ends: 2317 [2025-03-16 15:07:16,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:16,520 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:16,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 263 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:16,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2025-03-16 15:07:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1605. [2025-03-16 15:07:16,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1246882793017456) internal successors, (1804), 1604 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:16,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1804 transitions. [2025-03-16 15:07:16,545 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1804 transitions. Word has length 338 [2025-03-16 15:07:16,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:16,545 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1804 transitions. [2025-03-16 15:07:16,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:16,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1804 transitions. [2025-03-16 15:07:16,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2025-03-16 15:07:16,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:16,549 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:16,557 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-16 15:07:16,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-16 15:07:16,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:16,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:16,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1344098332, now seen corresponding path program 1 times [2025-03-16 15:07:16,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:16,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639061882] [2025-03-16 15:07:16,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:16,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:16,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-16 15:07:16,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-16 15:07:16,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:16,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:17,085 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 195 proven. 130 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:07:17,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:17,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639061882] [2025-03-16 15:07:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639061882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:17,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132612776] [2025-03-16 15:07:17,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:17,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:17,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:17,087 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-16 15:07:17,089 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-16 15:07:17,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes. [2025-03-16 15:07:17,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements. [2025-03-16 15:07:17,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:17,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:17,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:17,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:17,433 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2025-03-16 15:07:17,433 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:17,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132612776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:17,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:17,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 15:07:17,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512849593] [2025-03-16 15:07:17,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:17,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:17,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:17,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:17,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:17,435 INFO L87 Difference]: Start difference. First operand 1605 states and 1804 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:17,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:17,859 INFO L93 Difference]: Finished difference Result 3387 states and 3918 transitions. [2025-03-16 15:07:17,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:17,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 341 [2025-03-16 15:07:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:17,864 INFO L225 Difference]: With dead ends: 3387 [2025-03-16 15:07:17,864 INFO L226 Difference]: Without dead ends: 2139 [2025-03-16 15:07:17,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:17,866 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 82 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:17,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 46 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-03-16 15:07:17,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2025-03-16 15:07:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.1117867165575304) internal successors, (2377), 2138 states have internal predecessors, (2377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2377 transitions. [2025-03-16 15:07:17,890 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2377 transitions. Word has length 341 [2025-03-16 15:07:17,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:17,890 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2377 transitions. [2025-03-16 15:07:17,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2377 transitions. [2025-03-16 15:07:17,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-03-16 15:07:17,893 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:17,893 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1] [2025-03-16 15:07:17,900 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-16 15:07:18,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:18,094 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:18,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:18,094 INFO L85 PathProgramCache]: Analyzing trace with hash -492657448, now seen corresponding path program 1 times [2025-03-16 15:07:18,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:18,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694899039] [2025-03-16 15:07:18,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:18,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:18,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-03-16 15:07:18,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-03-16 15:07:18,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:18,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:07:18,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:18,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694899039] [2025-03-16 15:07:18,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694899039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:18,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:18,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:18,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098349102] [2025-03-16 15:07:18,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:18,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:18,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:18,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:18,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:18,234 INFO L87 Difference]: Start difference. First operand 2139 states and 2377 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:18,644 INFO L93 Difference]: Finished difference Result 4455 states and 5045 transitions. [2025-03-16 15:07:18,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:18,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 365 [2025-03-16 15:07:18,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:18,651 INFO L225 Difference]: With dead ends: 4455 [2025-03-16 15:07:18,651 INFO L226 Difference]: Without dead ends: 2673 [2025-03-16 15:07:18,653 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-16 15:07:18,653 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:18,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 77 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-16 15:07:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2495. [2025-03-16 15:07:18,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.1170809943865276) internal successors, (2786), 2494 states have internal predecessors, (2786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 2786 transitions. [2025-03-16 15:07:18,695 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 2786 transitions. Word has length 365 [2025-03-16 15:07:18,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:18,695 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 2786 transitions. [2025-03-16 15:07:18,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:18,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2786 transitions. [2025-03-16 15:07:18,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2025-03-16 15:07:18,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:18,698 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:18,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:07:18,698 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:18,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:18,699 INFO L85 PathProgramCache]: Analyzing trace with hash 2029107341, now seen corresponding path program 1 times [2025-03-16 15:07:18,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:18,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369015495] [2025-03-16 15:07:18,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:18,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:18,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 372 statements into 1 equivalence classes. [2025-03-16 15:07:18,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 372 of 372 statements. [2025-03-16 15:07:18,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:18,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-03-16 15:07:18,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:18,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369015495] [2025-03-16 15:07:18,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369015495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:18,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:18,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:18,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041361833] [2025-03-16 15:07:18,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:18,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:18,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:18,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:18,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:18,811 INFO L87 Difference]: Start difference. First operand 2495 states and 2786 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:19,212 INFO L93 Difference]: Finished difference Result 3387 states and 3848 transitions. [2025-03-16 15:07:19,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:19,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 372 [2025-03-16 15:07:19,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:19,220 INFO L225 Difference]: With dead ends: 3387 [2025-03-16 15:07:19,220 INFO L226 Difference]: Without dead ends: 3385 [2025-03-16 15:07:19,221 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-16 15:07:19,221 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:19,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 17 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:19,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2025-03-16 15:07:19,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2851. [2025-03-16 15:07:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.1410526315789473) internal successors, (3252), 2850 states have internal predecessors, (3252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3252 transitions. [2025-03-16 15:07:19,255 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3252 transitions. Word has length 372 [2025-03-16 15:07:19,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:19,255 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3252 transitions. [2025-03-16 15:07:19,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3252 transitions. [2025-03-16 15:07:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-16 15:07:19,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:19,258 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:19,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:07:19,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:19,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:19,259 INFO L85 PathProgramCache]: Analyzing trace with hash -217606645, now seen corresponding path program 1 times [2025-03-16 15:07:19,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:19,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033304960] [2025-03-16 15:07:19,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:19,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:19,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-16 15:07:19,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-16 15:07:19,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:19,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:19,495 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-03-16 15:07:19,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:19,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033304960] [2025-03-16 15:07:19,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033304960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:19,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:19,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:19,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944423521] [2025-03-16 15:07:19,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:19,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:19,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:19,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:19,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:19,497 INFO L87 Difference]: Start difference. First operand 2851 states and 3252 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:19,868 INFO L93 Difference]: Finished difference Result 5879 states and 6730 transitions. [2025-03-16 15:07:19,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:19,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 449 [2025-03-16 15:07:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:19,875 INFO L225 Difference]: With dead ends: 5879 [2025-03-16 15:07:19,875 INFO L226 Difference]: Without dead ends: 3207 [2025-03-16 15:07:19,881 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-16 15:07:19,881 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:19,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 75 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:19,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2025-03-16 15:07:19,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3207. [2025-03-16 15:07:19,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.1303805364940736) internal successors, (3624), 3206 states have internal predecessors, (3624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3624 transitions. [2025-03-16 15:07:19,914 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3624 transitions. Word has length 449 [2025-03-16 15:07:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:19,914 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3624 transitions. [2025-03-16 15:07:19,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:19,914 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3624 transitions. [2025-03-16 15:07:19,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-16 15:07:19,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:19,917 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, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:19,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:07:19,917 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:19,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:19,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1209224852, now seen corresponding path program 1 times [2025-03-16 15:07:19,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:19,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823760988] [2025-03-16 15:07:19,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:19,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:19,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-16 15:07:19,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-16 15:07:19,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:19,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:20,027 INFO L134 CoverageAnalysis]: Checked inductivity of 731 backedges. 370 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:20,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:20,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823760988] [2025-03-16 15:07:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823760988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:20,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:20,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:20,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495381519] [2025-03-16 15:07:20,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:20,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:20,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:20,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:20,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:20,029 INFO L87 Difference]: Start difference. First operand 3207 states and 3624 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:20,434 INFO L93 Difference]: Finished difference Result 6947 states and 7939 transitions. [2025-03-16 15:07:20,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:20,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 449 [2025-03-16 15:07:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:20,444 INFO L225 Difference]: With dead ends: 6947 [2025-03-16 15:07:20,444 INFO L226 Difference]: Without dead ends: 4097 [2025-03-16 15:07:20,447 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-16 15:07:20,448 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 113 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:20,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 56 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-03-16 15:07:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 3563. [2025-03-16 15:07:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.1165075800112296) internal successors, (3977), 3562 states have internal predecessors, (3977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3977 transitions. [2025-03-16 15:07:20,505 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3977 transitions. Word has length 449 [2025-03-16 15:07:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:20,506 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3977 transitions. [2025-03-16 15:07:20,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3977 transitions. [2025-03-16 15:07:20,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2025-03-16 15:07:20,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:20,512 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:20,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 15:07:20,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:20,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:20,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1249268340, now seen corresponding path program 1 times [2025-03-16 15:07:20,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:20,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276723885] [2025-03-16 15:07:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:20,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:20,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 529 statements into 1 equivalence classes. [2025-03-16 15:07:20,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 529 of 529 statements. [2025-03-16 15:07:20,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:20,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-03-16 15:07:20,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:20,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276723885] [2025-03-16 15:07:20,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276723885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:20,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:20,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429162026] [2025-03-16 15:07:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:20,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:20,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:20,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:20,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:20,776 INFO L87 Difference]: Start difference. First operand 3563 states and 3977 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:21,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:21,203 INFO L93 Difference]: Finished difference Result 6976 states and 7806 transitions. [2025-03-16 15:07:21,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:21,204 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 529 [2025-03-16 15:07:21,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:21,211 INFO L225 Difference]: With dead ends: 6976 [2025-03-16 15:07:21,211 INFO L226 Difference]: Without dead ends: 3741 [2025-03-16 15:07:21,213 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-16 15:07:21,214 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:21,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 15 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:21,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-03-16 15:07:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3563. [2025-03-16 15:07:21,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0791690061763055) internal successors, (3844), 3562 states have internal predecessors, (3844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3844 transitions. [2025-03-16 15:07:21,255 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3844 transitions. Word has length 529 [2025-03-16 15:07:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:21,255 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3844 transitions. [2025-03-16 15:07:21,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:21,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3844 transitions. [2025-03-16 15:07:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-03-16 15:07:21,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:21,260 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:21,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:07:21,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:21,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:21,260 INFO L85 PathProgramCache]: Analyzing trace with hash 286324181, now seen corresponding path program 2 times [2025-03-16 15:07:21,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:21,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202016083] [2025-03-16 15:07:21,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:07:21,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:21,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 555 statements into 2 equivalence classes. [2025-03-16 15:07:21,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 555 of 555 statements. [2025-03-16 15:07:21,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 15:07:21,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 819 proven. 11 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:21,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:21,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202016083] [2025-03-16 15:07:21,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202016083] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:21,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947098889] [2025-03-16 15:07:21,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 15:07:21,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:21,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:21,586 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-16 15:07:21,588 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-16 15:07:21,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 555 statements into 2 equivalence classes. [2025-03-16 15:07:21,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 555 of 555 statements. [2025-03-16 15:07:21,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 15:07:21,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:21,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 713 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:07:21,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:22,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:22,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:22,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947098889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:22,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:22,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2025-03-16 15:07:22,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480944165] [2025-03-16 15:07:22,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:22,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:22,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:22,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:22,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:22,524 INFO L87 Difference]: Start difference. First operand 3563 states and 3844 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:22,971 INFO L93 Difference]: Finished difference Result 7154 states and 7723 transitions. [2025-03-16 15:07:22,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:07:22,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 555 [2025-03-16 15:07:22,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:22,979 INFO L225 Difference]: With dead ends: 7154 [2025-03-16 15:07:22,980 INFO L226 Difference]: Without dead ends: 3741 [2025-03-16 15:07:22,982 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 552 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:22,983 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 368 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:22,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 15 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2025-03-16 15:07:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3385. [2025-03-16 15:07:23,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0765366430260048) internal successors, (3643), 3384 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3643 transitions. [2025-03-16 15:07:23,011 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3643 transitions. Word has length 555 [2025-03-16 15:07:23,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:23,011 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3643 transitions. [2025-03-16 15:07:23,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 4 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3643 transitions. [2025-03-16 15:07:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2025-03-16 15:07:23,015 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:23,015 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:23,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:07:23,215 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-16 15:07:23,216 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:23,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:23,216 INFO L85 PathProgramCache]: Analyzing trace with hash -286983478, now seen corresponding path program 1 times [2025-03-16 15:07:23,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:23,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274964920] [2025-03-16 15:07:23,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:23,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 562 statements into 1 equivalence classes. [2025-03-16 15:07:23,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 562 of 562 statements. [2025-03-16 15:07:23,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:23,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:23,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:23,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:23,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274964920] [2025-03-16 15:07:23,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274964920] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:23,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:23,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:23,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427848972] [2025-03-16 15:07:23,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:23,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:23,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:23,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:23,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:23,499 INFO L87 Difference]: Start difference. First operand 3385 states and 3643 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:23,830 INFO L93 Difference]: Finished difference Result 7303 states and 7906 transitions. [2025-03-16 15:07:23,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:23,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 562 [2025-03-16 15:07:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:23,837 INFO L225 Difference]: With dead ends: 7303 [2025-03-16 15:07:23,837 INFO L226 Difference]: Without dead ends: 4097 [2025-03-16 15:07:23,839 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-16 15:07:23,840 INFO L435 NwaCegarLoop]: 224 mSDtfsCounter, 74 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:23,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 228 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:23,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2025-03-16 15:07:23,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4097. [2025-03-16 15:07:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.0693359375) internal successors, (4380), 4096 states have internal predecessors, (4380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4380 transitions. [2025-03-16 15:07:23,871 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4380 transitions. Word has length 562 [2025-03-16 15:07:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:23,871 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4380 transitions. [2025-03-16 15:07:23,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4380 transitions. [2025-03-16 15:07:23,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 658 [2025-03-16 15:07:23,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:23,876 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:23,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:07:23,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:23,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:23,876 INFO L85 PathProgramCache]: Analyzing trace with hash 273515870, now seen corresponding path program 1 times [2025-03-16 15:07:23,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:23,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166991741] [2025-03-16 15:07:23,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:23,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:23,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 657 statements into 1 equivalence classes. [2025-03-16 15:07:23,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 657 of 657 statements. [2025-03-16 15:07:23,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:23,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1629 backedges. 1268 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:24,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:24,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166991741] [2025-03-16 15:07:24,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166991741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:24,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:24,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:07:24,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760150935] [2025-03-16 15:07:24,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:24,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:07:24,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:24,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:07:24,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:24,305 INFO L87 Difference]: Start difference. First operand 4097 states and 4380 transitions. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:25,142 INFO L93 Difference]: Finished difference Result 8549 states and 9169 transitions. [2025-03-16 15:07:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:07:25,142 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 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 657 [2025-03-16 15:07:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:25,150 INFO L225 Difference]: With dead ends: 8549 [2025-03-16 15:07:25,150 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:07:25,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:25,154 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 284 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1688 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:25,154 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 62 Invalid, 1721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1688 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 15:07:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:07:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2025-03-16 15:07:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.065010799136069) internal successors, (4931), 4630 states have internal predecessors, (4931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:25,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4931 transitions. [2025-03-16 15:07:25,190 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4931 transitions. Word has length 657 [2025-03-16 15:07:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4931 transitions. [2025-03-16 15:07:25,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 5 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:25,190 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4931 transitions. [2025-03-16 15:07:25,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-03-16 15:07:25,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:25,195 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:07:25,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:07:25,196 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:25,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1897347661, now seen corresponding path program 1 times [2025-03-16 15:07:25,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:25,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412770525] [2025-03-16 15:07:25,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:25,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:25,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-03-16 15:07:25,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-03-16 15:07:25,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:25,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:25,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412770525] [2025-03-16 15:07:25,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412770525] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361059978] [2025-03-16 15:07:25,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:25,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:25,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:25,495 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-16 15:07:25,497 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-16 15:07:25,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-03-16 15:07:25,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-03-16 15:07:25,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:25,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:25,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:25,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:25,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:26,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2025-03-16 15:07:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361059978] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:07:26,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:07:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-03-16 15:07:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987945416] [2025-03-16 15:07:26,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:07:26,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 15:07:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:26,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 15:07:26,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:26,239 INFO L87 Difference]: Start difference. First operand 4631 states and 4931 transitions. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:26,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:26,890 INFO L93 Difference]: Finished difference Result 9973 states and 10649 transitions. [2025-03-16 15:07:26,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:07:26,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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 784 [2025-03-16 15:07:26,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:26,898 INFO L225 Difference]: With dead ends: 9973 [2025-03-16 15:07:26,898 INFO L226 Difference]: Without dead ends: 5699 [2025-03-16 15:07:26,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1570 GetRequests, 1566 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:26,902 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 51 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:26,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 54 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 15:07:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5699 states. [2025-03-16 15:07:26,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5699 to 4987. [2025-03-16 15:07:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.0659847573204975) internal successors, (5315), 4986 states have internal predecessors, (5315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:26,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5315 transitions. [2025-03-16 15:07:26,943 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5315 transitions. Word has length 784 [2025-03-16 15:07:26,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:26,944 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5315 transitions. [2025-03-16 15:07:26,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:26,944 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5315 transitions. [2025-03-16 15:07:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2025-03-16 15:07:26,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:26,949 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:26,957 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-16 15:07:27,149 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-16 15:07:27,149 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:27,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:27,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1087944960, now seen corresponding path program 1 times [2025-03-16 15:07:27,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:27,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171963752] [2025-03-16 15:07:27,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:27,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:27,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 804 statements into 1 equivalence classes. [2025-03-16 15:07:27,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 804 of 804 statements. [2025-03-16 15:07:27,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:27,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:27,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2236 backedges. 1423 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2025-03-16 15:07:27,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:27,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171963752] [2025-03-16 15:07:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171963752] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:27,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:27,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081407841] [2025-03-16 15:07:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:27,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:27,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:27,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:27,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:27,508 INFO L87 Difference]: Start difference. First operand 4987 states and 5315 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:27,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:27,797 INFO L93 Difference]: Finished difference Result 10329 states and 11062 transitions. [2025-03-16 15:07:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:27,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 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 804 [2025-03-16 15:07:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:27,804 INFO L225 Difference]: With dead ends: 10329 [2025-03-16 15:07:27,804 INFO L226 Difference]: Without dead ends: 5521 [2025-03-16 15:07:27,807 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-16 15:07:27,807 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:27,807 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 220 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:27,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2025-03-16 15:07:27,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 5165. [2025-03-16 15:07:27,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.0497676219984509) internal successors, (5421), 5164 states have internal predecessors, (5421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5421 transitions. [2025-03-16 15:07:27,848 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5421 transitions. Word has length 804 [2025-03-16 15:07:27,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:27,848 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5421 transitions. [2025-03-16 15:07:27,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:27,849 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5421 transitions. [2025-03-16 15:07:27,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2025-03-16 15:07:27,854 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:27,854 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-16 15:07:27,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:07:27,855 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:27,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:27,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1844631726, now seen corresponding path program 1 times [2025-03-16 15:07:27,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:27,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244974532] [2025-03-16 15:07:27,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:27,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:27,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 951 statements into 1 equivalence classes. [2025-03-16 15:07:27,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 951 of 951 statements. [2025-03-16 15:07:27,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:27,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:28,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:07:28,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244974532] [2025-03-16 15:07:28,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244974532] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:28,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101110737] [2025-03-16 15:07:28,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:28,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:28,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:28,677 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-16 15:07:28,679 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-16 15:07:28,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 951 statements into 1 equivalence classes. [2025-03-16 15:07:28,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 951 of 951 statements. [2025-03-16 15:07:28,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:28,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:28,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 15:07:28,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 625 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-03-16 15:07:29,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:07:29,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1937 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-03-16 15:07:29,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101110737] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:29,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:07:29,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 9 [2025-03-16 15:07:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639260518] [2025-03-16 15:07:29,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:29,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:29,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:29,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:29,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:29,867 INFO L87 Difference]: Start difference. First operand 5165 states and 5421 transitions. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:30,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:30,241 INFO L93 Difference]: Finished difference Result 10151 states and 10665 transitions. [2025-03-16 15:07:30,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:30,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 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 951 [2025-03-16 15:07:30,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:30,248 INFO L225 Difference]: With dead ends: 10151 [2025-03-16 15:07:30,248 INFO L226 Difference]: Without dead ends: 5343 [2025-03-16 15:07:30,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1905 GetRequests, 1897 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:30,251 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 130 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:30,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 8 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:30,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2025-03-16 15:07:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 4809. [2025-03-16 15:07:30,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0467970049916806) internal successors, (5033), 4808 states have internal predecessors, (5033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:30,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5033 transitions. [2025-03-16 15:07:30,286 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5033 transitions. Word has length 951 [2025-03-16 15:07:30,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:30,287 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5033 transitions. [2025-03-16 15:07:30,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:30,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5033 transitions. [2025-03-16 15:07:30,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2025-03-16 15:07:30,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:30,293 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 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] [2025-03-16 15:07:30,300 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-16 15:07:30,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:30,494 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:30,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:30,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1424089095, now seen corresponding path program 1 times [2025-03-16 15:07:30,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:30,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603691470] [2025-03-16 15:07:30,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:30,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:30,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 973 statements into 1 equivalence classes. [2025-03-16 15:07:30,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 973 of 973 statements. [2025-03-16 15:07:30,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:30,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:31,045 INFO L134 CoverageAnalysis]: Checked inductivity of 3038 backedges. 1500 proven. 0 refuted. 0 times theorem prover too weak. 1538 trivial. 0 not checked. [2025-03-16 15:07:31,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:31,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603691470] [2025-03-16 15:07:31,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603691470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:31,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:31,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 15:07:31,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286778001] [2025-03-16 15:07:31,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:31,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 15:07:31,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:31,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 15:07:31,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:31,047 INFO L87 Difference]: Start difference. First operand 4809 states and 5033 transitions. Second operand has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:31,412 INFO L93 Difference]: Finished difference Result 9489 states and 9939 transitions. [2025-03-16 15:07:31,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 15:07:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 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 973 [2025-03-16 15:07:31,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:31,423 INFO L225 Difference]: With dead ends: 9489 [2025-03-16 15:07:31,423 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:07:31,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:31,427 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:31,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 18 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:07:31,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4809. [2025-03-16 15:07:31,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.035981697171381) internal successors, (4981), 4808 states have internal predecessors, (4981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:31,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 4981 transitions. [2025-03-16 15:07:31,468 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 4981 transitions. Word has length 973 [2025-03-16 15:07:31,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:31,469 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 4981 transitions. [2025-03-16 15:07:31,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 50.57142857142857) internal successors, (354), 6 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:31,469 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 4981 transitions. [2025-03-16 15:07:31,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2025-03-16 15:07:31,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:31,476 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:31,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:07:31,476 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:31,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:31,476 INFO L85 PathProgramCache]: Analyzing trace with hash -484729410, now seen corresponding path program 1 times [2025-03-16 15:07:31,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:31,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609439713] [2025-03-16 15:07:31,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:31,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:31,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1074 statements into 1 equivalence classes. [2025-03-16 15:07:31,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1074 of 1074 statements. [2025-03-16 15:07:31,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:31,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 2665 proven. 72 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2025-03-16 15:07:32,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609439713] [2025-03-16 15:07:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609439713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:32,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437083304] [2025-03-16 15:07:32,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:32,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:32,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:32,402 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:32,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:07:32,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1074 statements into 1 equivalence classes. [2025-03-16 15:07:32,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1074 of 1074 statements. [2025-03-16 15:07:32,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:32,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:32,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:32,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:32,683 INFO L134 CoverageAnalysis]: Checked inductivity of 3728 backedges. 1062 proven. 0 refuted. 0 times theorem prover too weak. 2666 trivial. 0 not checked. [2025-03-16 15:07:32,683 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:32,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437083304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:32,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:32,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:07:32,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910785743] [2025-03-16 15:07:32,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:32,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:32,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:32,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:32,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:32,685 INFO L87 Difference]: Start difference. First operand 4809 states and 4981 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:32,960 INFO L93 Difference]: Finished difference Result 9439 states and 9785 transitions. [2025-03-16 15:07:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:32,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 1074 [2025-03-16 15:07:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:32,965 INFO L225 Difference]: With dead ends: 9439 [2025-03-16 15:07:32,965 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:07:32,972 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1078 GetRequests, 1074 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:32,972 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 97 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:32,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 222 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:32,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:07:33,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4809. [2025-03-16 15:07:33,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0345257903494176) internal successors, (4974), 4808 states have internal predecessors, (4974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 4974 transitions. [2025-03-16 15:07:33,010 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 4974 transitions. Word has length 1074 [2025-03-16 15:07:33,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:33,011 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 4974 transitions. [2025-03-16 15:07:33,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:33,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 4974 transitions. [2025-03-16 15:07:33,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1178 [2025-03-16 15:07:33,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:33,020 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:33,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:07:33,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:33,221 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:33,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash -278562775, now seen corresponding path program 1 times [2025-03-16 15:07:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812446390] [2025-03-16 15:07:33,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:33,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1177 statements into 1 equivalence classes. [2025-03-16 15:07:33,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1177 of 1177 statements. [2025-03-16 15:07:33,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:33,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4611 backedges. 1883 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-16 15:07:33,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:33,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812446390] [2025-03-16 15:07:33,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812446390] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:33,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278330495] [2025-03-16 15:07:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:33,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:33,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:33,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:33,789 INFO L87 Difference]: Start difference. First operand 4809 states and 4974 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:34,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:34,102 INFO L93 Difference]: Finished difference Result 9461 states and 9793 transitions. [2025-03-16 15:07:34,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:34,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 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 1177 [2025-03-16 15:07:34,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:34,107 INFO L225 Difference]: With dead ends: 9461 [2025-03-16 15:07:34,107 INFO L226 Difference]: Without dead ends: 4987 [2025-03-16 15:07:34,110 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-16 15:07:34,111 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 34 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:34,111 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 15 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2025-03-16 15:07:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4809. [2025-03-16 15:07:34,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0343178036605658) internal successors, (4973), 4808 states have internal predecessors, (4973), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:34,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 4973 transitions. [2025-03-16 15:07:34,142 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 4973 transitions. Word has length 1177 [2025-03-16 15:07:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:34,142 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 4973 transitions. [2025-03-16 15:07:34,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:34,143 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 4973 transitions. [2025-03-16 15:07:34,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1196 [2025-03-16 15:07:34,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:34,151 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:34,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:07:34,151 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:34,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:34,152 INFO L85 PathProgramCache]: Analyzing trace with hash -937036531, now seen corresponding path program 1 times [2025-03-16 15:07:34,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275981887] [2025-03-16 15:07:34,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:34,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:34,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1195 statements into 1 equivalence classes. [2025-03-16 15:07:34,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1195 of 1195 statements. [2025-03-16 15:07:34,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:34,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3500 proven. 72 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2025-03-16 15:07:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275981887] [2025-03-16 15:07:35,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275981887] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:35,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045519736] [2025-03-16 15:07:35,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:35,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:35,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:35,258 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:35,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:07:35,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1195 statements into 1 equivalence classes. [2025-03-16 15:07:35,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1195 of 1195 statements. [2025-03-16 15:07:35,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:35,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:35,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 1462 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:07:35,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 3213 proven. 0 refuted. 0 times theorem prover too weak. 1479 trivial. 0 not checked. [2025-03-16 15:07:35,767 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:35,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045519736] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:35,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:35,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-16 15:07:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884766922] [2025-03-16 15:07:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:35,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:35,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:35,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:35,769 INFO L87 Difference]: Start difference. First operand 4809 states and 4973 transitions. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:36,222 INFO L93 Difference]: Finished difference Result 10329 states and 10682 transitions. [2025-03-16 15:07:36,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:36,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 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 1195 [2025-03-16 15:07:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:36,228 INFO L225 Difference]: With dead ends: 10329 [2025-03-16 15:07:36,228 INFO L226 Difference]: Without dead ends: 5877 [2025-03-16 15:07:36,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1199 GetRequests, 1194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:07:36,231 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:36,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 42 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:36,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2025-03-16 15:07:36,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 5165. [2025-03-16 15:07:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.032532920216886) internal successors, (5332), 5164 states have internal predecessors, (5332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5332 transitions. [2025-03-16 15:07:36,267 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5332 transitions. Word has length 1195 [2025-03-16 15:07:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:36,268 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5332 transitions. [2025-03-16 15:07:36,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5332 transitions. [2025-03-16 15:07:36,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1327 [2025-03-16 15:07:36,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:36,278 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:36,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:36,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-16 15:07:36,479 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:36,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash 780228172, now seen corresponding path program 1 times [2025-03-16 15:07:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:36,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450064642] [2025-03-16 15:07:36,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:36,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:36,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1326 statements into 1 equivalence classes. [2025-03-16 15:07:36,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1326 of 1326 statements. [2025-03-16 15:07:36,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:36,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:37,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5421 backedges. 3424 proven. 495 refuted. 0 times theorem prover too weak. 1502 trivial. 0 not checked. [2025-03-16 15:07:37,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450064642] [2025-03-16 15:07:37,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450064642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:37,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894377318] [2025-03-16 15:07:37,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:37,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:37,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:37,827 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:37,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-16 15:07:37,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1326 statements into 1 equivalence classes. [2025-03-16 15:07:38,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1326 of 1326 statements. [2025-03-16 15:07:38,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:38,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:38,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 1594 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:38,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5421 backedges. 3507 proven. 0 refuted. 0 times theorem prover too weak. 1914 trivial. 0 not checked. [2025-03-16 15:07:38,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:38,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894377318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:38,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:38,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-16 15:07:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77191470] [2025-03-16 15:07:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:38,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:38,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:38,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:38,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:38,757 INFO L87 Difference]: Start difference. First operand 5165 states and 5332 transitions. Second operand has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:39,171 INFO L93 Difference]: Finished difference Result 10151 states and 10487 transitions. [2025-03-16 15:07:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 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 1326 [2025-03-16 15:07:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:39,174 INFO L225 Difference]: With dead ends: 10151 [2025-03-16 15:07:39,174 INFO L226 Difference]: Without dead ends: 5165 [2025-03-16 15:07:39,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1332 GetRequests, 1325 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:39,177 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 67 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:39,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 44 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5165 states. [2025-03-16 15:07:39,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5165 to 4987. [2025-03-16 15:07:39,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4987 states, 4986 states have (on average 1.0326915363016447) internal successors, (5149), 4986 states have internal predecessors, (5149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4987 states to 4987 states and 5149 transitions. [2025-03-16 15:07:39,221 INFO L78 Accepts]: Start accepts. Automaton has 4987 states and 5149 transitions. Word has length 1326 [2025-03-16 15:07:39,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:39,221 INFO L471 AbstractCegarLoop]: Abstraction has 4987 states and 5149 transitions. [2025-03-16 15:07:39,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.75) internal successors, (483), 3 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 4987 states and 5149 transitions. [2025-03-16 15:07:39,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1356 [2025-03-16 15:07:39,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:39,241 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:39,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:39,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-16 15:07:39,442 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:39,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:39,442 INFO L85 PathProgramCache]: Analyzing trace with hash 818287875, now seen corresponding path program 1 times [2025-03-16 15:07:39,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:39,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191645830] [2025-03-16 15:07:39,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:39,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:39,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-03-16 15:07:39,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-03-16 15:07:39,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:39,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:40,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5505 backedges. 3233 proven. 95 refuted. 0 times theorem prover too weak. 2177 trivial. 0 not checked. [2025-03-16 15:07:40,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:40,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191645830] [2025-03-16 15:07:40,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191645830] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:40,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408566927] [2025-03-16 15:07:40,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:40,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:40,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:40,261 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:40,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-16 15:07:40,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1355 statements into 1 equivalence classes. [2025-03-16 15:07:40,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1355 of 1355 statements. [2025-03-16 15:07:40,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:40,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:40,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 1623 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:07:40,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5505 backedges. 3328 proven. 0 refuted. 0 times theorem prover too weak. 2177 trivial. 0 not checked. [2025-03-16 15:07:40,635 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:40,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408566927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:40,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:40,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 15:07:40,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394315106] [2025-03-16 15:07:40,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:40,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:40,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:40,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:40,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:40,637 INFO L87 Difference]: Start difference. First operand 4987 states and 5149 transitions. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:40,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:40,917 INFO L93 Difference]: Finished difference Result 9973 states and 10301 transitions. [2025-03-16 15:07:40,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:40,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 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 1355 [2025-03-16 15:07:40,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:40,921 INFO L225 Difference]: With dead ends: 9973 [2025-03-16 15:07:40,921 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:07:40,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1358 GetRequests, 1354 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:07:40,923 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:40,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 212 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:07:40,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 3919. [2025-03-16 15:07:40,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0237366003062787) internal successors, (4011), 3918 states have internal predecessors, (4011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4011 transitions. [2025-03-16 15:07:40,948 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4011 transitions. Word has length 1355 [2025-03-16 15:07:40,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:40,948 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4011 transitions. [2025-03-16 15:07:40,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:40,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4011 transitions. [2025-03-16 15:07:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1506 [2025-03-16 15:07:40,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:40,959 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:40,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-16 15:07:41,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-16 15:07:41,159 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:41,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:41,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1343523105, now seen corresponding path program 1 times [2025-03-16 15:07:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972243853] [2025-03-16 15:07:41,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:41,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1505 statements into 1 equivalence classes. [2025-03-16 15:07:41,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1505 of 1505 statements. [2025-03-16 15:07:41,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:41,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 7115 backedges. 2492 proven. 0 refuted. 0 times theorem prover too weak. 4623 trivial. 0 not checked. [2025-03-16 15:07:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972243853] [2025-03-16 15:07:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972243853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:41,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:41,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846816638] [2025-03-16 15:07:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:41,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:07:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:41,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:07:41,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:07:41,843 INFO L87 Difference]: Start difference. First operand 3919 states and 4011 transitions. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:42,130 INFO L93 Difference]: Finished difference Result 7837 states and 8025 transitions. [2025-03-16 15:07:42,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:07:42,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 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 1505 [2025-03-16 15:07:42,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:42,133 INFO L225 Difference]: With dead ends: 7837 [2025-03-16 15:07:42,133 INFO L226 Difference]: Without dead ends: 3919 [2025-03-16 15:07:42,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-16 15:07:42,135 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 55 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:42,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 216 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:42,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2025-03-16 15:07:42,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3919. [2025-03-16 15:07:42,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0191424196018377) internal successors, (3993), 3918 states have internal predecessors, (3993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 3993 transitions. [2025-03-16 15:07:42,157 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 3993 transitions. Word has length 1505 [2025-03-16 15:07:42,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:42,157 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 3993 transitions. [2025-03-16 15:07:42,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:42,158 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 3993 transitions. [2025-03-16 15:07:42,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1680 [2025-03-16 15:07:42,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:42,170 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:42,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-16 15:07:42,170 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:42,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:42,171 INFO L85 PathProgramCache]: Analyzing trace with hash -809751213, now seen corresponding path program 1 times [2025-03-16 15:07:42,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:42,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53269660] [2025-03-16 15:07:42,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:42,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:42,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1679 statements into 1 equivalence classes. [2025-03-16 15:07:42,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1679 of 1679 statements. [2025-03-16 15:07:42,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:42,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:43,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 2190 proven. 557 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2025-03-16 15:07:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53269660] [2025-03-16 15:07:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53269660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479038507] [2025-03-16 15:07:43,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:43,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:43,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:43,285 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:43,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-16 15:07:43,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1679 statements into 1 equivalence classes. [2025-03-16 15:07:43,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1679 of 1679 statements. [2025-03-16 15:07:43,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:43,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:43,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:07:43,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 8613 backedges. 2747 proven. 0 refuted. 0 times theorem prover too weak. 5866 trivial. 0 not checked. [2025-03-16 15:07:44,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479038507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 15:07:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133504605] [2025-03-16 15:07:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:44,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:44,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:44,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:44,680 INFO L87 Difference]: Start difference. First operand 3919 states and 3993 transitions. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:45,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:45,082 INFO L93 Difference]: Finished difference Result 8193 states and 8357 transitions. [2025-03-16 15:07:45,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:45,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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 1679 [2025-03-16 15:07:45,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:45,086 INFO L225 Difference]: With dead ends: 8193 [2025-03-16 15:07:45,086 INFO L226 Difference]: Without dead ends: 4275 [2025-03-16 15:07:45,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1683 GetRequests, 1677 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:07:45,088 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 80 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:45,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 15 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:45,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2025-03-16 15:07:45,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4097. [2025-03-16 15:07:45,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.018310546875) internal successors, (4171), 4096 states have internal predecessors, (4171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:45,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4171 transitions. [2025-03-16 15:07:45,109 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4171 transitions. Word has length 1679 [2025-03-16 15:07:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:45,109 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4171 transitions. [2025-03-16 15:07:45,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:45,110 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4171 transitions. [2025-03-16 15:07:45,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1733 [2025-03-16 15:07:45,122 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:45,122 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:45,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-16 15:07:45,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-16 15:07:45,323 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:45,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:45,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1344014043, now seen corresponding path program 1 times [2025-03-16 15:07:45,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:45,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185572112] [2025-03-16 15:07:45,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:45,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:45,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1732 statements into 1 equivalence classes. [2025-03-16 15:07:45,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1732 of 1732 statements. [2025-03-16 15:07:45,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:45,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2025-03-16 15:07:47,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:47,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185572112] [2025-03-16 15:07:47,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185572112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:47,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:47,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:07:47,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24374609] [2025-03-16 15:07:47,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:47,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:07:47,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:47,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:07:47,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:07:47,359 INFO L87 Difference]: Start difference. First operand 4097 states and 4171 transitions. Second operand has 5 states, 5 states have (on average 64.2) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:47,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:47,778 INFO L93 Difference]: Finished difference Result 9808 states and 10000 transitions. [2025-03-16 15:07:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:07:47,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.2) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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 1732 [2025-03-16 15:07:47,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:47,783 INFO L225 Difference]: With dead ends: 9808 [2025-03-16 15:07:47,783 INFO L226 Difference]: Without dead ends: 5877 [2025-03-16 15:07:47,785 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-16 15:07:47,786 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 139 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:47,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 18 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 15:07:47,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2025-03-16 15:07:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 4631. [2025-03-16 15:07:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0196544276457884) internal successors, (4721), 4630 states have internal predecessors, (4721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:47,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4721 transitions. [2025-03-16 15:07:47,819 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4721 transitions. Word has length 1732 [2025-03-16 15:07:47,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:47,819 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4721 transitions. [2025-03-16 15:07:47,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.2) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:47,819 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4721 transitions. [2025-03-16 15:07:47,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1903 [2025-03-16 15:07:47,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:47,835 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:47,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-16 15:07:47,835 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:47,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:47,836 INFO L85 PathProgramCache]: Analyzing trace with hash 848314895, now seen corresponding path program 1 times [2025-03-16 15:07:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:47,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572968566] [2025-03-16 15:07:47,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:47,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:47,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1902 statements into 1 equivalence classes. [2025-03-16 15:07:47,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1902 of 1902 statements. [2025-03-16 15:07:47,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:47,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:49,228 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 2425 proven. 812 refuted. 0 times theorem prover too weak. 8272 trivial. 0 not checked. [2025-03-16 15:07:49,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:49,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572968566] [2025-03-16 15:07:49,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572968566] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:07:49,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199527084] [2025-03-16 15:07:49,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:49,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:07:49,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:07:49,230 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:07:49,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-16 15:07:49,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1902 statements into 1 equivalence classes. [2025-03-16 15:07:49,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1902 of 1902 statements. [2025-03-16 15:07:49,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:49,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:49,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 2273 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 15:07:49,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:07:50,857 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 3204 proven. 0 refuted. 0 times theorem prover too weak. 8305 trivial. 0 not checked. [2025-03-16 15:07:50,857 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:07:50,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199527084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:50,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:07:50,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 8 [2025-03-16 15:07:50,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855092050] [2025-03-16 15:07:50,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 15:07:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:50,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 15:07:50,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:50,858 INFO L87 Difference]: Start difference. First operand 4631 states and 4721 transitions. Second operand has 7 states, 7 states have (on average 52.714285714285715) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:51,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:51,226 INFO L93 Difference]: Finished difference Result 9310 states and 9493 transitions. [2025-03-16 15:07:51,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 15:07:51,226 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 52.714285714285715) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 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 1902 [2025-03-16 15:07:51,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:51,230 INFO L225 Difference]: With dead ends: 9310 [2025-03-16 15:07:51,230 INFO L226 Difference]: Without dead ends: 4809 [2025-03-16 15:07:51,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1906 GetRequests, 1899 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:07:51,232 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:51,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:51,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2025-03-16 15:07:51,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4631. [2025-03-16 15:07:51,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.0187904967602592) internal successors, (4717), 4630 states have internal predecessors, (4717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4717 transitions. [2025-03-16 15:07:51,258 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4717 transitions. Word has length 1902 [2025-03-16 15:07:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:51,259 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4717 transitions. [2025-03-16 15:07:51,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.714285714285715) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:51,259 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4717 transitions. [2025-03-16 15:07:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1946 [2025-03-16 15:07:51,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:51,290 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:51,298 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-16 15:07:51,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-16 15:07:51,491 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:51,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -28495315, now seen corresponding path program 1 times [2025-03-16 15:07:51,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:51,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331052173] [2025-03-16 15:07:51,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:51,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1945 statements into 1 equivalence classes. [2025-03-16 15:07:51,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1945 of 1945 statements. [2025-03-16 15:07:51,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:51,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:52,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12676 backedges. 3343 proven. 0 refuted. 0 times theorem prover too weak. 9333 trivial. 0 not checked. [2025-03-16 15:07:52,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:52,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331052173] [2025-03-16 15:07:52,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331052173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:52,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:52,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:07:52,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682286541] [2025-03-16 15:07:52,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:52,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:52,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:52,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:52,491 INFO L87 Difference]: Start difference. First operand 4631 states and 4717 transitions. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:52,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:52,795 INFO L93 Difference]: Finished difference Result 9095 states and 9266 transitions. [2025-03-16 15:07:52,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:52,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 1945 [2025-03-16 15:07:52,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:52,799 INFO L225 Difference]: With dead ends: 9095 [2025-03-16 15:07:52,799 INFO L226 Difference]: Without dead ends: 4631 [2025-03-16 15:07:52,802 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-16 15:07:52,802 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 15 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:52,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 15 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:52,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2025-03-16 15:07:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4631. [2025-03-16 15:07:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4631 states, 4630 states have (on average 1.01792656587473) internal successors, (4713), 4630 states have internal predecessors, (4713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4631 states to 4631 states and 4713 transitions. [2025-03-16 15:07:52,832 INFO L78 Accepts]: Start accepts. Automaton has 4631 states and 4713 transitions. Word has length 1945 [2025-03-16 15:07:52,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:52,832 INFO L471 AbstractCegarLoop]: Abstraction has 4631 states and 4713 transitions. [2025-03-16 15:07:52,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:52,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4631 states and 4713 transitions. [2025-03-16 15:07:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2035 [2025-03-16 15:07:52,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:07:52,849 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:07:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-16 15:07:52,850 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:07:52,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:07:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash -677553478, now seen corresponding path program 1 times [2025-03-16 15:07:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:07:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771643260] [2025-03-16 15:07:52,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:07:52,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:07:52,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2034 statements into 1 equivalence classes. [2025-03-16 15:07:52,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2034 of 2034 statements. [2025-03-16 15:07:52,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:07:52,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:07:55,418 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2025-03-16 15:07:55,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:07:55,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771643260] [2025-03-16 15:07:55,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771643260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:07:55,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:07:55,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:07:55,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731200118] [2025-03-16 15:07:55,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:07:55,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:07:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:07:55,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:07:55,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:07:55,420 INFO L87 Difference]: Start difference. First operand 4631 states and 4713 transitions. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:07:55,717 INFO L93 Difference]: Finished difference Result 8916 states and 9073 transitions. [2025-03-16 15:07:55,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:07:55,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 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 2034 [2025-03-16 15:07:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:07:55,718 INFO L225 Difference]: With dead ends: 8916 [2025-03-16 15:07:55,718 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 15:07:55,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-16 15:07:55,721 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 108 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:07:55,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 13 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 15:07:55,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 15:07:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 15:07:55,721 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-16 15:07:55,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 15:07:55,722 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2034 [2025-03-16 15:07:55,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:07:55,722 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 15:07:55,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:07:55,722 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 15:07:55,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 15:07:55,724 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 15:07:55,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-16 15:07:55,726 INFO L422 BasicCegarLoop]: Path program histogram: [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-16 15:07:55,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.