./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 8bae34b88b69e395b0952f9a7e7405cfa96e2c3307dff9bcbb01737f33e4d41e --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 00:00:03,969 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 00:00:04,007 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-02-08 00:00:04,011 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 00:00:04,012 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 00:00:04,031 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 00:00:04,032 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 00:00:04,032 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 00:00:04,033 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 00:00:04,033 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 00:00:04,033 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 00:00:04,033 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 00:00:04,033 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 00:00:04,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 00:00:04,033 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 00:00:04,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 00:00:04,034 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 00:00:04,035 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:04,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 00:00:04,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 00:00:04,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 00:00:04,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 00:00:04,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 00:00:04,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 00:00:04,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 00:00:04,036 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8bae34b88b69e395b0952f9a7e7405cfa96e2c3307dff9bcbb01737f33e4d41e [2025-02-08 00:00:04,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 00:00:04,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 00:00:04,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 00:00:04,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 00:00:04,263 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 00:00:04,268 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c [2025-02-08 00:00:06,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b46bb324/d1f30bb51c974b968010d6f014a8bb68/FLAG7ac52bcc6 [2025-02-08 00:00:07,022 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 00:00:07,023 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c [2025-02-08 00:00:07,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b46bb324/d1f30bb51c974b968010d6f014a8bb68/FLAG7ac52bcc6 [2025-02-08 00:00:07,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0b46bb324/d1f30bb51c974b968010d6f014a8bb68 [2025-02-08 00:00:07,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 00:00:07,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 00:00:07,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:07,105 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 00:00:07,109 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 00:00:07,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,113 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b76a420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07, skipping insertion in model container [2025-02-08 00:00:07,113 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 00:00:07,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c[1247,1260] [2025-02-08 00:00:07,552 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:07,563 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 00:00:07,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.sw_loop.c[1247,1260] [2025-02-08 00:00:07,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 00:00:07,664 INFO L204 MainTranslator]: Completed translation [2025-02-08 00:00:07,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07 WrapperNode [2025-02-08 00:00:07,665 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 00:00:07,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:07,666 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 00:00:07,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 00:00:07,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,697 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,797 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1012 [2025-02-08 00:00:07,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 00:00:07,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 00:00:07,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 00:00:07,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 00:00:07,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,880 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-02-08 00:00:07,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,930 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 00:00:07,975 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 00:00:07,975 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 00:00:07,975 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 00:00:07,976 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (1/1) ... [2025-02-08 00:00:07,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 00:00:07,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:08,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 00:00:08,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 00:00:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 00:00:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 00:00:08,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 00:00:08,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 00:00:08,183 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 00:00:08,184 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 00:00:09,749 INFO L? ?]: Removed 645 outVars from TransFormulas that were not future-live. [2025-02-08 00:00:09,749 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 00:00:09,829 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 00:00:09,832 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 00:00:09,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:09 BoogieIcfgContainer [2025-02-08 00:00:09,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 00:00:09,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 00:00:09,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 00:00:09,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 00:00:09,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 12:00:07" (1/3) ... [2025-02-08 00:00:09,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1c54cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:09, skipping insertion in model container [2025-02-08 00:00:09,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 12:00:07" (2/3) ... [2025-02-08 00:00:09,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c1c54cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 12:00:09, skipping insertion in model container [2025-02-08 00:00:09,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 12:00:09" (3/3) ... [2025-02-08 00:00:09,843 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.sw_loop.c [2025-02-08 00:00:09,858 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 00:00:09,861 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.sw_loop.c that has 1 procedures, 296 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-08 00:00:09,928 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 00:00:09,940 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;@1cd3f587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 00:00:09,941 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-08 00:00:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 296 states, 294 states have (on average 1.5) internal successors, (441), 295 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 00:00:09,953 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:09,953 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] [2025-02-08 00:00:09,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:09,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash -367877977, now seen corresponding path program 1 times [2025-02-08 00:00:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549804345] [2025-02-08 00:00:09,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:10,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 00:00:10,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 00:00:10,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:10,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:10,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:10,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:10,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549804345] [2025-02-08 00:00:10,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549804345] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:10,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:10,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:10,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330754603] [2025-02-08 00:00:10,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:10,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:10,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:10,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:10,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:10,564 INFO L87 Difference]: Start difference. First operand has 296 states, 294 states have (on average 1.5) internal successors, (441), 295 states have internal predecessors, (441), 0 states have call successors, (0), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:10,875 INFO L93 Difference]: Finished difference Result 555 states and 829 transitions. [2025-02-08 00:00:10,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:10,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2025-02-08 00:00:10,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:10,897 INFO L225 Difference]: With dead ends: 555 [2025-02-08 00:00:10,901 INFO L226 Difference]: Without dead ends: 296 [2025-02-08 00:00:10,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:10,910 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:10,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1087 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:10,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-08 00:00:10,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-02-08 00:00:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 295 states have (on average 1.4915254237288136) internal successors, (440), 295 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:10,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 440 transitions. [2025-02-08 00:00:10,971 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 440 transitions. Word has length 26 [2025-02-08 00:00:10,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:10,972 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 440 transitions. [2025-02-08 00:00:10,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:10,972 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 440 transitions. [2025-02-08 00:00:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 00:00:10,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:10,974 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] [2025-02-08 00:00:10,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 00:00:10,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:10,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:10,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1485364171, now seen corresponding path program 1 times [2025-02-08 00:00:10,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:10,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143865900] [2025-02-08 00:00:10,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:10,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:10,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 00:00:11,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 00:00:11,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:11,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:11,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:11,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143865900] [2025-02-08 00:00:11,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143865900] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:11,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:11,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:11,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30131125] [2025-02-08 00:00:11,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:11,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 00:00:11,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:11,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 00:00:11,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:11,118 INFO L87 Difference]: Start difference. First operand 296 states and 440 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:11,278 INFO L93 Difference]: Finished difference Result 557 states and 828 transitions. [2025-02-08 00:00:11,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 00:00:11,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2025-02-08 00:00:11,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:11,280 INFO L225 Difference]: With dead ends: 557 [2025-02-08 00:00:11,280 INFO L226 Difference]: Without dead ends: 298 [2025-02-08 00:00:11,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 00:00:11,281 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:11,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1084 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 00:00:11,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2025-02-08 00:00:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2025-02-08 00:00:11,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 297 states have (on average 1.4882154882154883) internal successors, (442), 297 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 442 transitions. [2025-02-08 00:00:11,292 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 442 transitions. Word has length 27 [2025-02-08 00:00:11,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:11,292 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 442 transitions. [2025-02-08 00:00:11,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 442 transitions. [2025-02-08 00:00:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 00:00:11,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:11,293 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] [2025-02-08 00:00:11,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 00:00:11,293 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:11,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:11,294 INFO L85 PathProgramCache]: Analyzing trace with hash 733158690, now seen corresponding path program 1 times [2025-02-08 00:00:11,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:11,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67208082] [2025-02-08 00:00:11,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:11,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 00:00:11,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 00:00:11,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:11,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:11,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:11,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67208082] [2025-02-08 00:00:11,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67208082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:11,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:11,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:11,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823422980] [2025-02-08 00:00:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:11,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:11,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:11,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:11,429 INFO L87 Difference]: Start difference. First operand 298 states and 442 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:11,686 INFO L93 Difference]: Finished difference Result 794 states and 1179 transitions. [2025-02-08 00:00:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-02-08 00:00:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:11,689 INFO L225 Difference]: With dead ends: 794 [2025-02-08 00:00:11,689 INFO L226 Difference]: Without dead ends: 533 [2025-02-08 00:00:11,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:11,690 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1117 mSDsluCounter, 702 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1117 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:11,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1117 Valid, 1056 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:11,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2025-02-08 00:00:11,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 300. [2025-02-08 00:00:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 299 states have (on average 1.4849498327759196) internal successors, (444), 299 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 444 transitions. [2025-02-08 00:00:11,703 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 444 transitions. Word has length 28 [2025-02-08 00:00:11,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:11,703 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 444 transitions. [2025-02-08 00:00:11,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:11,704 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 444 transitions. [2025-02-08 00:00:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-08 00:00:11,708 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:11,709 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:11,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 00:00:11,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:11,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash -417502192, now seen corresponding path program 1 times [2025-02-08 00:00:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:11,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843908676] [2025-02-08 00:00:11,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:11,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-08 00:00:12,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-08 00:00:12,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:12,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:12,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:12,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:12,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843908676] [2025-02-08 00:00:12,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843908676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:12,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:12,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:12,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815361814] [2025-02-08 00:00:12,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:12,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:12,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:12,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:12,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:12,829 INFO L87 Difference]: Start difference. First operand 300 states and 444 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 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-02-08 00:00:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:13,124 INFO L93 Difference]: Finished difference Result 777 states and 1153 transitions. [2025-02-08 00:00:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 00:00:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 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 157 [2025-02-08 00:00:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:13,128 INFO L225 Difference]: With dead ends: 777 [2025-02-08 00:00:13,128 INFO L226 Difference]: Without dead ends: 516 [2025-02-08 00:00:13,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:00:13,129 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 1048 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:13,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 1404 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:13,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-08 00:00:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 325. [2025-02-08 00:00:13,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 1.4753086419753085) internal successors, (478), 324 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 478 transitions. [2025-02-08 00:00:13,140 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 478 transitions. Word has length 157 [2025-02-08 00:00:13,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:13,140 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 478 transitions. [2025-02-08 00:00:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 5 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-02-08 00:00:13,140 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 478 transitions. [2025-02-08 00:00:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-08 00:00:13,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:13,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:13,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 00:00:13,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:13,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:13,145 INFO L85 PathProgramCache]: Analyzing trace with hash 497385831, now seen corresponding path program 1 times [2025-02-08 00:00:13,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:13,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271868240] [2025-02-08 00:00:13,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:13,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:13,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-08 00:00:13,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-08 00:00:13,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:13,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:14,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:14,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271868240] [2025-02-08 00:00:14,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271868240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:14,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:14,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:14,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410323532] [2025-02-08 00:00:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:14,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:14,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:14,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:14,158 INFO L87 Difference]: Start difference. First operand 325 states and 478 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:14,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:14,396 INFO L93 Difference]: Finished difference Result 777 states and 1151 transitions. [2025-02-08 00:00:14,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:14,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 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 158 [2025-02-08 00:00:14,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:14,398 INFO L225 Difference]: With dead ends: 777 [2025-02-08 00:00:14,398 INFO L226 Difference]: Without dead ends: 516 [2025-02-08 00:00:14,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:14,399 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 1026 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:14,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1045 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:14,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-08 00:00:14,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 354. [2025-02-08 00:00:14,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.4730878186968839) internal successors, (520), 353 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 520 transitions. [2025-02-08 00:00:14,408 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 520 transitions. Word has length 158 [2025-02-08 00:00:14,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:14,408 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 520 transitions. [2025-02-08 00:00:14,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:14,408 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 520 transitions. [2025-02-08 00:00:14,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-08 00:00:14,412 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:14,412 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:14,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 00:00:14,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:14,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:14,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1470085917, now seen corresponding path program 1 times [2025-02-08 00:00:14,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:14,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250399723] [2025-02-08 00:00:14,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:14,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:14,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-08 00:00:14,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-08 00:00:14,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:14,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250399723] [2025-02-08 00:00:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250399723] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:15,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502815784] [2025-02-08 00:00:15,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:15,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:15,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:15,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:15,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:15,531 INFO L87 Difference]: Start difference. First operand 354 states and 520 transitions. Second operand has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:15,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:15,787 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2025-02-08 00:00:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 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 160 [2025-02-08 00:00:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:15,791 INFO L225 Difference]: With dead ends: 777 [2025-02-08 00:00:15,791 INFO L226 Difference]: Without dead ends: 516 [2025-02-08 00:00:15,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:15,793 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 996 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:15,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1044 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-08 00:00:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 405. [2025-02-08 00:00:15,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 404 states have (on average 1.4727722772277227) internal successors, (595), 404 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 595 transitions. [2025-02-08 00:00:15,806 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 595 transitions. Word has length 160 [2025-02-08 00:00:15,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:15,806 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 595 transitions. [2025-02-08 00:00:15,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.0) internal successors, (160), 4 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:15,807 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 595 transitions. [2025-02-08 00:00:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-08 00:00:15,815 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:15,815 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:15,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 00:00:15,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:15,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:15,816 INFO L85 PathProgramCache]: Analyzing trace with hash -108505261, now seen corresponding path program 1 times [2025-02-08 00:00:15,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:15,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838676988] [2025-02-08 00:00:15,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:15,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-08 00:00:16,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-08 00:00:16,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:16,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:16,784 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:16,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:16,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838676988] [2025-02-08 00:00:16,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838676988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:16,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084849761] [2025-02-08 00:00:16,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:16,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:16,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:16,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:16,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:16,787 INFO L87 Difference]: Start difference. First operand 405 states and 595 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:17,032 INFO L93 Difference]: Finished difference Result 777 states and 1148 transitions. [2025-02-08 00:00:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:17,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 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 161 [2025-02-08 00:00:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:17,035 INFO L225 Difference]: With dead ends: 777 [2025-02-08 00:00:17,035 INFO L226 Difference]: Without dead ends: 516 [2025-02-08 00:00:17,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:17,036 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 979 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:17,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1044 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:17,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-02-08 00:00:17,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 433. [2025-02-08 00:00:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 432 states have (on average 1.4722222222222223) internal successors, (636), 432 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 636 transitions. [2025-02-08 00:00:17,053 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 636 transitions. Word has length 161 [2025-02-08 00:00:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:17,054 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 636 transitions. [2025-02-08 00:00:17,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 4 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 636 transitions. [2025-02-08 00:00:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-08 00:00:17,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:17,056 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:17,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 00:00:17,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash -307049274, now seen corresponding path program 1 times [2025-02-08 00:00:17,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:17,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861034931] [2025-02-08 00:00:17,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:17,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:17,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-08 00:00:17,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-08 00:00:17,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:17,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:17,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:17,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861034931] [2025-02-08 00:00:17,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861034931] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:17,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:17,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:17,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733865327] [2025-02-08 00:00:17,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:17,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:17,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:17,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:17,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:17,851 INFO L87 Difference]: Start difference. First operand 433 states and 636 transitions. Second operand has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:18,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:18,251 INFO L93 Difference]: Finished difference Result 785 states and 1159 transitions. [2025-02-08 00:00:18,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:18,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 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 162 [2025-02-08 00:00:18,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:18,254 INFO L225 Difference]: With dead ends: 785 [2025-02-08 00:00:18,254 INFO L226 Difference]: Without dead ends: 524 [2025-02-08 00:00:18,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:18,255 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 999 mSDsluCounter, 1302 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:18,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1653 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:18,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2025-02-08 00:00:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 436. [2025-02-08 00:00:18,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 1.471264367816092) internal successors, (640), 435 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 640 transitions. [2025-02-08 00:00:18,271 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 640 transitions. Word has length 162 [2025-02-08 00:00:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:18,272 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 640 transitions. [2025-02-08 00:00:18,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.142857142857142) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 640 transitions. [2025-02-08 00:00:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-08 00:00:18,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:18,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:18,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 00:00:18,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:18,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:18,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1322236840, now seen corresponding path program 1 times [2025-02-08 00:00:18,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:18,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581932565] [2025-02-08 00:00:18,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:18,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:18,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-08 00:00:18,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-08 00:00:18,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:18,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:19,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:19,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:19,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581932565] [2025-02-08 00:00:19,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581932565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:19,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:19,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75738090] [2025-02-08 00:00:19,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:19,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:19,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:19,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:19,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:19,110 INFO L87 Difference]: Start difference. First operand 436 states and 640 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:19,461 INFO L93 Difference]: Finished difference Result 779 states and 1149 transitions. [2025-02-08 00:00:19,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:19,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 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 163 [2025-02-08 00:00:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:19,464 INFO L225 Difference]: With dead ends: 779 [2025-02-08 00:00:19,464 INFO L226 Difference]: Without dead ends: 518 [2025-02-08 00:00:19,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:19,465 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 961 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:19,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [961 Valid, 1044 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2025-02-08 00:00:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 463. [2025-02-08 00:00:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 462 states have (on average 1.4696969696969697) internal successors, (679), 462 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 679 transitions. [2025-02-08 00:00:19,481 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 679 transitions. Word has length 163 [2025-02-08 00:00:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:19,482 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 679 transitions. [2025-02-08 00:00:19,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 4 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 679 transitions. [2025-02-08 00:00:19,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-02-08 00:00:19,486 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:19,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:19,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 00:00:19,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:19,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1027502980, now seen corresponding path program 1 times [2025-02-08 00:00:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:19,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239915667] [2025-02-08 00:00:19,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:19,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:19,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-02-08 00:00:19,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-02-08 00:00:19,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:19,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:20,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:20,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239915667] [2025-02-08 00:00:20,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239915667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:20,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:20,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973346018] [2025-02-08 00:00:20,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:20,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:20,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:20,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:20,206 INFO L87 Difference]: Start difference. First operand 463 states and 679 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 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-02-08 00:00:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:20,600 INFO L93 Difference]: Finished difference Result 787 states and 1160 transitions. [2025-02-08 00:00:20,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:20,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 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 164 [2025-02-08 00:00:20,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:20,603 INFO L225 Difference]: With dead ends: 787 [2025-02-08 00:00:20,603 INFO L226 Difference]: Without dead ends: 526 [2025-02-08 00:00:20,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:20,604 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 981 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1652 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:20,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1652 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:20,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-02-08 00:00:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 466. [2025-02-08 00:00:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 465 states have (on average 1.4688172043010752) internal successors, (683), 465 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:20,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 683 transitions. [2025-02-08 00:00:20,615 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 683 transitions. Word has length 164 [2025-02-08 00:00:20,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:20,615 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 683 transitions. [2025-02-08 00:00:20,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 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-02-08 00:00:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 683 transitions. [2025-02-08 00:00:20,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-08 00:00:20,617 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:20,618 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:20,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 00:00:20,618 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:20,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1078704493, now seen corresponding path program 1 times [2025-02-08 00:00:20,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:20,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527602266] [2025-02-08 00:00:20,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:20,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:20,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-08 00:00:20,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-08 00:00:20,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:20,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:21,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:21,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:21,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527602266] [2025-02-08 00:00:21,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527602266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:21,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:21,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:21,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141286219] [2025-02-08 00:00:21,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:21,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:21,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:21,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:21,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:21,347 INFO L87 Difference]: Start difference. First operand 466 states and 683 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:21,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:21,595 INFO L93 Difference]: Finished difference Result 781 states and 1150 transitions. [2025-02-08 00:00:21,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:21,596 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2025-02-08 00:00:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:21,598 INFO L225 Difference]: With dead ends: 781 [2025-02-08 00:00:21,598 INFO L226 Difference]: Without dead ends: 520 [2025-02-08 00:00:21,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:21,601 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 943 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 943 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:21,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [943 Valid, 1044 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2025-02-08 00:00:21,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 493. [2025-02-08 00:00:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 492 states have (on average 1.467479674796748) internal successors, (722), 492 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 722 transitions. [2025-02-08 00:00:21,615 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 722 transitions. Word has length 165 [2025-02-08 00:00:21,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:21,616 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 722 transitions. [2025-02-08 00:00:21,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 4 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 722 transitions. [2025-02-08 00:00:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-08 00:00:21,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:21,619 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:21,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 00:00:21,619 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:21,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1503559026, now seen corresponding path program 1 times [2025-02-08 00:00:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807061809] [2025-02-08 00:00:21,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:21,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-08 00:00:21,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-08 00:00:21,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:21,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:22,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:22,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807061809] [2025-02-08 00:00:22,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807061809] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:22,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:22,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:22,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013109548] [2025-02-08 00:00:22,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:22,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:22,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:22,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:22,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:22,338 INFO L87 Difference]: Start difference. First operand 493 states and 722 transitions. Second operand has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:22,643 INFO L93 Difference]: Finished difference Result 789 states and 1161 transitions. [2025-02-08 00:00:22,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 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 166 [2025-02-08 00:00:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:22,646 INFO L225 Difference]: With dead ends: 789 [2025-02-08 00:00:22,646 INFO L226 Difference]: Without dead ends: 528 [2025-02-08 00:00:22,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:22,647 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 963 mSDsluCounter, 1300 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:22,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [963 Valid, 1651 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:22,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-02-08 00:00:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 496. [2025-02-08 00:00:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 495 states have (on average 1.4666666666666666) internal successors, (726), 495 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:22,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 726 transitions. [2025-02-08 00:00:22,658 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 726 transitions. Word has length 166 [2025-02-08 00:00:22,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:22,658 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 726 transitions. [2025-02-08 00:00:22,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.714285714285715) internal successors, (166), 6 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:22,659 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 726 transitions. [2025-02-08 00:00:22,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:00:22,659 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:22,660 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:22,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 00:00:22,660 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:22,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:22,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1639128878, now seen corresponding path program 1 times [2025-02-08 00:00:22,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:22,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80037967] [2025-02-08 00:00:22,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:22,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:22,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:00:22,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:00:22,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:22,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:23,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:23,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:23,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80037967] [2025-02-08 00:00:23,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80037967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:23,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:23,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:23,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138673490] [2025-02-08 00:00:23,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:23,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:23,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:23,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:23,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:23,302 INFO L87 Difference]: Start difference. First operand 496 states and 726 transitions. Second operand has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:23,596 INFO L93 Difference]: Finished difference Result 795 states and 1169 transitions. [2025-02-08 00:00:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:00:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:23,598 INFO L225 Difference]: With dead ends: 795 [2025-02-08 00:00:23,598 INFO L226 Difference]: Without dead ends: 534 [2025-02-08 00:00:23,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:23,599 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 971 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:23,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 1655 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-02-08 00:00:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 502. [2025-02-08 00:00:23,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.4650698602794412) internal successors, (734), 501 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:23,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 734 transitions. [2025-02-08 00:00:23,611 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 734 transitions. Word has length 167 [2025-02-08 00:00:23,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:23,611 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 734 transitions. [2025-02-08 00:00:23,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.857142857142858) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 734 transitions. [2025-02-08 00:00:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-08 00:00:23,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:23,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:23,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 00:00:23,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:23,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:23,614 INFO L85 PathProgramCache]: Analyzing trace with hash 436572818, now seen corresponding path program 1 times [2025-02-08 00:00:23,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:23,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976699088] [2025-02-08 00:00:23,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:23,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:23,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-08 00:00:23,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-08 00:00:23,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:23,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:24,197 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:24,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:24,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976699088] [2025-02-08 00:00:24,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976699088] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:24,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:24,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:24,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945741086] [2025-02-08 00:00:24,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:24,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:24,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:24,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:24,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:24,199 INFO L87 Difference]: Start difference. First operand 502 states and 734 transitions. Second operand has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:24,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:24,427 INFO L93 Difference]: Finished difference Result 788 states and 1158 transitions. [2025-02-08 00:00:24,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:24,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 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 167 [2025-02-08 00:00:24,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:24,430 INFO L225 Difference]: With dead ends: 788 [2025-02-08 00:00:24,430 INFO L226 Difference]: Without dead ends: 527 [2025-02-08 00:00:24,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:24,431 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 931 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:24,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 1041 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:24,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2025-02-08 00:00:24,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2025-02-08 00:00:24,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.463740458015267) internal successors, (767), 524 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:24,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 767 transitions. [2025-02-08 00:00:24,445 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 767 transitions. Word has length 167 [2025-02-08 00:00:24,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:24,446 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 767 transitions. [2025-02-08 00:00:24,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.4) internal successors, (167), 4 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:24,446 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 767 transitions. [2025-02-08 00:00:24,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-08 00:00:24,447 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:24,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:24,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 00:00:24,448 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash 298368656, now seen corresponding path program 1 times [2025-02-08 00:00:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:24,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465012109] [2025-02-08 00:00:24,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:24,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:24,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-08 00:00:24,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-08 00:00:24,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:24,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:25,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465012109] [2025-02-08 00:00:25,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465012109] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:25,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:25,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:25,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998549527] [2025-02-08 00:00:25,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:25,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:25,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:25,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:25,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:25,171 INFO L87 Difference]: Start difference. First operand 525 states and 767 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:25,448 INFO L93 Difference]: Finished difference Result 793 states and 1164 transitions. [2025-02-08 00:00:25,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:25,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-02-08 00:00:25,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:25,450 INFO L225 Difference]: With dead ends: 793 [2025-02-08 00:00:25,450 INFO L226 Difference]: Without dead ends: 532 [2025-02-08 00:00:25,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:25,451 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 940 mSDsluCounter, 1205 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 940 SdHoareTripleChecker+Valid, 1556 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:25,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [940 Valid, 1556 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-08 00:00:25,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 528. [2025-02-08 00:00:25,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.462998102466793) internal successors, (771), 527 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 771 transitions. [2025-02-08 00:00:25,462 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 771 transitions. Word has length 168 [2025-02-08 00:00:25,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:25,462 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 771 transitions. [2025-02-08 00:00:25,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 6 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 771 transitions. [2025-02-08 00:00:25,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 00:00:25,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:25,465 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:25,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 00:00:25,465 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:25,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:25,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1846199767, now seen corresponding path program 1 times [2025-02-08 00:00:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122425023] [2025-02-08 00:00:25,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:25,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:25,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 00:00:25,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 00:00:25,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:25,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122425023] [2025-02-08 00:00:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122425023] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:26,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:26,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:26,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989450987] [2025-02-08 00:00:26,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:26,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:26,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:26,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:26,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:26,090 INFO L87 Difference]: Start difference. First operand 528 states and 771 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:26,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:26,383 INFO L93 Difference]: Finished difference Result 799 states and 1172 transitions. [2025-02-08 00:00:26,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:26,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-02-08 00:00:26,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:26,386 INFO L225 Difference]: With dead ends: 799 [2025-02-08 00:00:26,386 INFO L226 Difference]: Without dead ends: 538 [2025-02-08 00:00:26,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-08 00:00:26,387 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 948 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:26,387 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1744 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:26,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-02-08 00:00:26,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 534. [2025-02-08 00:00:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 533 states have (on average 1.4615384615384615) internal successors, (779), 533 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 779 transitions. [2025-02-08 00:00:26,398 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 779 transitions. Word has length 169 [2025-02-08 00:00:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:26,399 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 779 transitions. [2025-02-08 00:00:26,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 779 transitions. [2025-02-08 00:00:26,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-08 00:00:26,400 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:26,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:26,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 00:00:26,400 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:26,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:26,401 INFO L85 PathProgramCache]: Analyzing trace with hash -372462649, now seen corresponding path program 1 times [2025-02-08 00:00:26,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:26,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667259817] [2025-02-08 00:00:26,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:26,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 00:00:26,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 00:00:26,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:26,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:27,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:27,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:27,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667259817] [2025-02-08 00:00:27,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667259817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:27,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062007408] [2025-02-08 00:00:27,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:27,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:27,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:27,130 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:00:27,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 00:00:27,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-08 00:00:27,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-08 00:00:27,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:27,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:27,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 1089 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-08 00:00:27,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:27,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 00:00:27,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062007408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:27,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 00:00:27,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 12 [2025-02-08 00:00:27,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669970576] [2025-02-08 00:00:27,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:27,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:27,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:27,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:27,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:00:27,820 INFO L87 Difference]: Start difference. First operand 534 states and 779 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:28,201 INFO L93 Difference]: Finished difference Result 998 states and 1458 transitions. [2025-02-08 00:00:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:28,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-02-08 00:00:28,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:28,203 INFO L225 Difference]: With dead ends: 998 [2025-02-08 00:00:28,203 INFO L226 Difference]: Without dead ends: 537 [2025-02-08 00:00:28,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-02-08 00:00:28,205 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 1033 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:28,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 1455 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:28,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-08 00:00:28,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-02-08 00:00:28,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.458955223880597) internal successors, (782), 536 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 782 transitions. [2025-02-08 00:00:28,215 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 782 transitions. Word has length 169 [2025-02-08 00:00:28,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:28,215 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 782 transitions. [2025-02-08 00:00:28,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:28,215 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 782 transitions. [2025-02-08 00:00:28,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-08 00:00:28,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:28,216 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:28,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 00:00:28,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 00:00:28,421 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:28,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:28,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1084201799, now seen corresponding path program 1 times [2025-02-08 00:00:28,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:28,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966597353] [2025-02-08 00:00:28,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:28,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:28,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-08 00:00:28,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-08 00:00:28,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:28,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:29,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:29,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:29,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966597353] [2025-02-08 00:00:29,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966597353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:29,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:29,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:29,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444870984] [2025-02-08 00:00:29,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:29,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:29,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:29,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:29,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:29,229 INFO L87 Difference]: Start difference. First operand 537 states and 782 transitions. Second operand has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:29,504 INFO L93 Difference]: Finished difference Result 925 states and 1350 transitions. [2025-02-08 00:00:29,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:29,505 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 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 170 [2025-02-08 00:00:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:29,507 INFO L225 Difference]: With dead ends: 925 [2025-02-08 00:00:29,507 INFO L226 Difference]: Without dead ends: 537 [2025-02-08 00:00:29,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:29,508 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 987 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:29,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 1391 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:29,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-02-08 00:00:29,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-02-08 00:00:29,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4570895522388059) internal successors, (781), 536 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 781 transitions. [2025-02-08 00:00:29,520 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 781 transitions. Word has length 170 [2025-02-08 00:00:29,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:29,520 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 781 transitions. [2025-02-08 00:00:29,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.333333333333332) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 781 transitions. [2025-02-08 00:00:29,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-08 00:00:29,522 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:29,522 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:29,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 00:00:29,522 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:29,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:29,523 INFO L85 PathProgramCache]: Analyzing trace with hash -212689574, now seen corresponding path program 1 times [2025-02-08 00:00:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512802568] [2025-02-08 00:00:29,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:29,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:29,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 00:00:29,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 00:00:29,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:29,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:30,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512802568] [2025-02-08 00:00:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512802568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107107290] [2025-02-08 00:00:30,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:30,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:30,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:30,576 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:00:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 00:00:30,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-08 00:00:31,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-08 00:00:31,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:31,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:31,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-02-08 00:00:31,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:31,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:00:32,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107107290] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:00:32,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:00:32,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 11] total 32 [2025-02-08 00:00:32,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785912512] [2025-02-08 00:00:32,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:00:32,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-02-08 00:00:32,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:32,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-02-08 00:00:32,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=925, Unknown=0, NotChecked=0, Total=1056 [2025-02-08 00:00:32,692 INFO L87 Difference]: Start difference. First operand 537 states and 781 transitions. Second operand has 33 states, 33 states have (on average 15.181818181818182) internal successors, (501), 32 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:34,713 INFO L93 Difference]: Finished difference Result 1803 states and 2637 transitions. [2025-02-08 00:00:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-08 00:00:34,714 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 15.181818181818182) internal successors, (501), 32 states have internal predecessors, (501), 0 states have call successors, (0), 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 171 [2025-02-08 00:00:34,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:34,718 INFO L225 Difference]: With dead ends: 1803 [2025-02-08 00:00:34,718 INFO L226 Difference]: Without dead ends: 1324 [2025-02-08 00:00:34,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 875 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=568, Invalid=2854, Unknown=0, NotChecked=0, Total=3422 [2025-02-08 00:00:34,721 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 12789 mSDsluCounter, 6471 mSDsCounter, 0 mSdLazyCounter, 3182 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12789 SdHoareTripleChecker+Valid, 6761 SdHoareTripleChecker+Invalid, 3193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:34,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12789 Valid, 6761 Invalid, 3193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-08 00:00:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-02-08 00:00:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1003. [2025-02-08 00:00:34,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 1002 states have (on average 1.4550898203592815) internal successors, (1458), 1002 states have internal predecessors, (1458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1458 transitions. [2025-02-08 00:00:34,740 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1458 transitions. Word has length 171 [2025-02-08 00:00:34,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:34,741 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1458 transitions. [2025-02-08 00:00:34,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 15.181818181818182) internal successors, (501), 32 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:34,741 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1458 transitions. [2025-02-08 00:00:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 00:00:34,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:34,743 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:34,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 00:00:34,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:34,947 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:34,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:34,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1588287015, now seen corresponding path program 1 times [2025-02-08 00:00:34,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:34,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953740401] [2025-02-08 00:00:34,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:34,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:34,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 00:00:35,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 00:00:35,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:35,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:35,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:35,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:35,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953740401] [2025-02-08 00:00:35,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953740401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:35,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:35,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:00:35,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687901321] [2025-02-08 00:00:35,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:35,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:35,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:35,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:35,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:35,370 INFO L87 Difference]: Start difference. First operand 1003 states and 1458 transitions. Second operand has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:35,599 INFO L93 Difference]: Finished difference Result 1983 states and 2886 transitions. [2025-02-08 00:00:35,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 00:00:35,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-02-08 00:00:35,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:35,603 INFO L225 Difference]: With dead ends: 1983 [2025-02-08 00:00:35,603 INFO L226 Difference]: Without dead ends: 1030 [2025-02-08 00:00:35,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:35,607 INFO L435 NwaCegarLoop]: 359 mSDtfsCounter, 5 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2141 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:35,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2141 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:35,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2025-02-08 00:00:35,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1030. [2025-02-08 00:00:35,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 1.4509232264334304) internal successors, (1493), 1029 states have internal predecessors, (1493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1493 transitions. [2025-02-08 00:00:35,627 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1493 transitions. Word has length 172 [2025-02-08 00:00:35,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:35,627 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1493 transitions. [2025-02-08 00:00:35,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.571428571428573) internal successors, (172), 7 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1493 transitions. [2025-02-08 00:00:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-08 00:00:35,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:35,629 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:35,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 00:00:35,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:35,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:35,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1180472802, now seen corresponding path program 1 times [2025-02-08 00:00:35,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:35,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170468661] [2025-02-08 00:00:35,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:35,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:35,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-08 00:00:35,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-08 00:00:35,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:35,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:35,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:35,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170468661] [2025-02-08 00:00:35,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170468661] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:35,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:35,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 00:00:35,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620965181] [2025-02-08 00:00:35,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:35,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 00:00:35,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:35,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 00:00:35,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-08 00:00:35,933 INFO L87 Difference]: Start difference. First operand 1030 states and 1493 transitions. Second operand has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:36,164 INFO L93 Difference]: Finished difference Result 1529 states and 2217 transitions. [2025-02-08 00:00:36,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:36,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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 172 [2025-02-08 00:00:36,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:36,170 INFO L225 Difference]: With dead ends: 1529 [2025-02-08 00:00:36,170 INFO L226 Difference]: Without dead ends: 1032 [2025-02-08 00:00:36,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-02-08 00:00:36,173 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1055 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 1405 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:36,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 1405 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:36,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-02-08 00:00:36,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1020. [2025-02-08 00:00:36,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1020 states, 1019 states have (on average 1.4494602551521099) internal successors, (1477), 1019 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1477 transitions. [2025-02-08 00:00:36,193 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1477 transitions. Word has length 172 [2025-02-08 00:00:36,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:36,194 INFO L471 AbstractCegarLoop]: Abstraction has 1020 states and 1477 transitions. [2025-02-08 00:00:36,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.666666666666668) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1477 transitions. [2025-02-08 00:00:36,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 00:00:36,196 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:36,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:36,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 00:00:36,196 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:36,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:36,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1199058684, now seen corresponding path program 1 times [2025-02-08 00:00:36,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:36,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828793119] [2025-02-08 00:00:36,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:36,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 00:00:36,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 00:00:36,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:36,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:36,477 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:36,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:36,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828793119] [2025-02-08 00:00:36,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828793119] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:36,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:36,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:36,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767105873] [2025-02-08 00:00:36,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:36,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:36,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:36,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:36,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:36,479 INFO L87 Difference]: Start difference. First operand 1020 states and 1477 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:36,669 INFO L93 Difference]: Finished difference Result 2010 states and 2913 transitions. [2025-02-08 00:00:36,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:36,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-08 00:00:36,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:36,675 INFO L225 Difference]: With dead ends: 2010 [2025-02-08 00:00:36,675 INFO L226 Difference]: Without dead ends: 1045 [2025-02-08 00:00:36,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:36,680 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 1073 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:36,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 1057 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states. [2025-02-08 00:00:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 1017. [2025-02-08 00:00:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 1016 states have (on average 1.4478346456692914) internal successors, (1471), 1016 states have internal predecessors, (1471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:36,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1471 transitions. [2025-02-08 00:00:36,703 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1471 transitions. Word has length 173 [2025-02-08 00:00:36,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:36,703 INFO L471 AbstractCegarLoop]: Abstraction has 1017 states and 1471 transitions. [2025-02-08 00:00:36,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:36,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1471 transitions. [2025-02-08 00:00:36,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-08 00:00:36,705 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:36,705 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:36,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 00:00:36,705 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:36,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:36,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1210044887, now seen corresponding path program 1 times [2025-02-08 00:00:36,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:36,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970557544] [2025-02-08 00:00:36,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:36,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:36,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-08 00:00:36,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-08 00:00:36,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:36,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:37,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:37,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:37,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970557544] [2025-02-08 00:00:37,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970557544] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:37,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:37,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 00:00:37,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388895545] [2025-02-08 00:00:37,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:37,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 00:00:37,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:37,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 00:00:37,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 00:00:37,027 INFO L87 Difference]: Start difference. First operand 1017 states and 1471 transitions. Second operand has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:37,209 INFO L93 Difference]: Finished difference Result 1783 states and 2590 transitions. [2025-02-08 00:00:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 00:00:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 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 173 [2025-02-08 00:00:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:37,212 INFO L225 Difference]: With dead ends: 1783 [2025-02-08 00:00:37,212 INFO L226 Difference]: Without dead ends: 817 [2025-02-08 00:00:37,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:37,214 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1091 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1091 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:37,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1091 Valid, 1050 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 00:00:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2025-02-08 00:00:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 791. [2025-02-08 00:00:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 791 states, 790 states have (on average 1.4556962025316456) internal successors, (1150), 790 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:37,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1150 transitions. [2025-02-08 00:00:37,226 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1150 transitions. Word has length 173 [2025-02-08 00:00:37,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:37,226 INFO L471 AbstractCegarLoop]: Abstraction has 791 states and 1150 transitions. [2025-02-08 00:00:37,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.6) internal successors, (173), 4 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1150 transitions. [2025-02-08 00:00:37,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-08 00:00:37,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:37,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:37,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 00:00:37,229 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:37,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:37,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1703000880, now seen corresponding path program 1 times [2025-02-08 00:00:37,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:37,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807854614] [2025-02-08 00:00:37,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:37,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:37,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-08 00:00:38,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-08 00:00:38,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:38,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:39,508 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:39,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:39,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807854614] [2025-02-08 00:00:39,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807854614] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:39,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:39,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 00:00:39,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544387065] [2025-02-08 00:00:39,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:39,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:00:39,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:39,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:00:39,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 00:00:39,511 INFO L87 Difference]: Start difference. First operand 791 states and 1150 transitions. Second operand has 9 states, 9 states have (on average 33.44444444444444) internal successors, (301), 8 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-02-08 00:00:40,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:40,382 INFO L93 Difference]: Finished difference Result 2902 states and 4275 transitions. [2025-02-08 00:00:40,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 00:00:40,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.44444444444444) internal successors, (301), 8 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 301 [2025-02-08 00:00:40,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:40,390 INFO L225 Difference]: With dead ends: 2902 [2025-02-08 00:00:40,391 INFO L226 Difference]: Without dead ends: 2377 [2025-02-08 00:00:40,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:00:40,393 INFO L435 NwaCegarLoop]: 580 mSDtfsCounter, 1489 mSDsluCounter, 3147 mSDsCounter, 0 mSdLazyCounter, 1239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1489 SdHoareTripleChecker+Valid, 3727 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:40,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1489 Valid, 3727 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1239 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 00:00:40,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2025-02-08 00:00:40,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 1503. [2025-02-08 00:00:40,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1502 states have (on average 1.459387483355526) internal successors, (2192), 1502 states have internal predecessors, (2192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:40,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 2192 transitions. [2025-02-08 00:00:40,428 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 2192 transitions. Word has length 301 [2025-02-08 00:00:40,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:40,429 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 2192 transitions. [2025-02-08 00:00:40,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.44444444444444) internal successors, (301), 8 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-02-08 00:00:40,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 2192 transitions. [2025-02-08 00:00:40,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-08 00:00:40,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:40,433 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:40,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-08 00:00:40,433 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:40,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash -450128532, now seen corresponding path program 1 times [2025-02-08 00:00:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:40,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843847793] [2025-02-08 00:00:40,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:40,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-08 00:00:41,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-08 00:00:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:42,596 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:42,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:42,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843847793] [2025-02-08 00:00:42,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843847793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:42,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:42,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 00:00:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027838410] [2025-02-08 00:00:42,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:42,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:42,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:42,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:42,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:42,598 INFO L87 Difference]: Start difference. First operand 1503 states and 2192 transitions. Second operand has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:43,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:43,183 INFO L93 Difference]: Finished difference Result 3470 states and 5111 transitions. [2025-02-08 00:00:43,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:00:43,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 0 states have call successors, (0), 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 302 [2025-02-08 00:00:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:43,190 INFO L225 Difference]: With dead ends: 3470 [2025-02-08 00:00:43,190 INFO L226 Difference]: Without dead ends: 2430 [2025-02-08 00:00:43,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 00:00:43,192 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1532 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:43,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 2698 Invalid, 943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 00:00:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2430 states. [2025-02-08 00:00:43,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2430 to 1525. [2025-02-08 00:00:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.4553805774278215) internal successors, (2218), 1524 states have internal predecessors, (2218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 2218 transitions. [2025-02-08 00:00:43,222 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 2218 transitions. Word has length 302 [2025-02-08 00:00:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:43,223 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 2218 transitions. [2025-02-08 00:00:43,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 43.142857142857146) internal successors, (302), 7 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 2218 transitions. [2025-02-08 00:00:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2025-02-08 00:00:43,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:43,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:43,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-08 00:00:43,231 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:43,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash -531256770, now seen corresponding path program 1 times [2025-02-08 00:00:43,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:43,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874601523] [2025-02-08 00:00:43,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:43,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 302 statements into 1 equivalence classes. [2025-02-08 00:00:44,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 302 of 302 statements. [2025-02-08 00:00:44,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:44,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-08 00:00:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:45,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874601523] [2025-02-08 00:00:45,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874601523] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 00:00:45,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 00:00:45,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 00:00:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438001050] [2025-02-08 00:00:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:00:45,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 00:00:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:45,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 00:00:45,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 00:00:45,180 INFO L87 Difference]: Start difference. First operand 1525 states and 2218 transitions. Second operand has 7 states, 7 states have (on average 27.714285714285715) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:45,526 INFO L93 Difference]: Finished difference Result 2801 states and 4087 transitions. [2025-02-08 00:00:45,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 00:00:45,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.714285714285715) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 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 302 [2025-02-08 00:00:45,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:45,530 INFO L225 Difference]: With dead ends: 2801 [2025-02-08 00:00:45,530 INFO L226 Difference]: Without dead ends: 1332 [2025-02-08 00:00:45,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-08 00:00:45,532 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 995 mSDsluCounter, 1393 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1744 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:45,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1744 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 00:00:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2025-02-08 00:00:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1330. [2025-02-08 00:00:45,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 1329 states have (on average 1.4574868322046652) internal successors, (1937), 1329 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:45,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1937 transitions. [2025-02-08 00:00:45,549 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1937 transitions. Word has length 302 [2025-02-08 00:00:45,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:45,549 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1937 transitions. [2025-02-08 00:00:45,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.714285714285715) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1937 transitions. [2025-02-08 00:00:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-08 00:00:45,552 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:45,552 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:45,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 00:00:45,553 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:45,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:45,554 INFO L85 PathProgramCache]: Analyzing trace with hash 943113525, now seen corresponding path program 1 times [2025-02-08 00:00:45,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:45,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453968492] [2025-02-08 00:00:45,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:45,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:45,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-08 00:00:46,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 00:00:46,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:46,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:48,133 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 140 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:48,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:00:48,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453968492] [2025-02-08 00:00:48,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453968492] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:00:48,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113844722] [2025-02-08 00:00:48,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:48,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:48,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:00:48,141 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:00:48,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 00:00:48,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-08 00:00:49,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-08 00:00:49,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:49,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:00:49,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 2008 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-08 00:00:49,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:00:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:49,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:00:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 134 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:00:51,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113844722] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:00:51,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:00:51,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 29 [2025-02-08 00:00:51,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678864764] [2025-02-08 00:00:51,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:00:51,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 00:00:51,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:00:51,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 00:00:51,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2025-02-08 00:00:51,906 INFO L87 Difference]: Start difference. First operand 1330 states and 1937 transitions. Second operand has 30 states, 30 states have (on average 22.033333333333335) internal successors, (661), 29 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:00:58,303 INFO L93 Difference]: Finished difference Result 11808 states and 17463 transitions. [2025-02-08 00:00:58,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-02-08 00:00:58,303 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 22.033333333333335) internal successors, (661), 29 states have internal predecessors, (661), 0 states have call successors, (0), 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 303 [2025-02-08 00:00:58,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:00:58,326 INFO L225 Difference]: With dead ends: 11808 [2025-02-08 00:00:58,327 INFO L226 Difference]: Without dead ends: 10577 [2025-02-08 00:00:58,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 715 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=2676, Invalid=14354, Unknown=0, NotChecked=0, Total=17030 [2025-02-08 00:00:58,334 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 15264 mSDsluCounter, 8039 mSDsCounter, 0 mSdLazyCounter, 3803 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15264 SdHoareTripleChecker+Valid, 8612 SdHoareTripleChecker+Invalid, 3816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-08 00:00:58,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15264 Valid, 8612 Invalid, 3816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3803 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-08 00:00:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10577 states. [2025-02-08 00:00:58,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10577 to 2328. [2025-02-08 00:00:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2328 states, 2327 states have (on average 1.4464976364417705) internal successors, (3366), 2327 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2328 states to 2328 states and 3366 transitions. [2025-02-08 00:00:58,397 INFO L78 Accepts]: Start accepts. Automaton has 2328 states and 3366 transitions. Word has length 303 [2025-02-08 00:00:58,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:00:58,397 INFO L471 AbstractCegarLoop]: Abstraction has 2328 states and 3366 transitions. [2025-02-08 00:00:58,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 22.033333333333335) internal successors, (661), 29 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:00:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 2328 states and 3366 transitions. [2025-02-08 00:00:58,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-08 00:00:58,401 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:00:58,402 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:00:58,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 00:00:58,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:00:58,606 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:00:58,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:00:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1648538757, now seen corresponding path program 1 times [2025-02-08 00:00:58,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:00:58,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732061721] [2025-02-08 00:00:58,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:00:58,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:00:58,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-08 00:00:59,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-08 00:00:59,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:00:59,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732061721] [2025-02-08 00:01:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732061721] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482868761] [2025-02-08 00:01:01,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:01,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:01,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:01,264 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:01,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 00:01:01,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-08 00:01:02,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-08 00:01:02,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:02,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:02,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 00:01:02,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:02,628 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:02,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 00:01:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482868761] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:02,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:02,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 11] total 25 [2025-02-08 00:01:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634903790] [2025-02-08 00:01:02,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:01:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:02,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:01:02,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=496, Unknown=0, NotChecked=0, Total=600 [2025-02-08 00:01:02,887 INFO L87 Difference]: Start difference. First operand 2328 states and 3366 transitions. Second operand has 8 states, 8 states have (on average 36.5) internal successors, (292), 8 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:03,599 INFO L93 Difference]: Finished difference Result 6414 states and 9382 transitions. [2025-02-08 00:01:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 00:01:03,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 36.5) internal successors, (292), 8 states have internal predecessors, (292), 0 states have call successors, (0), 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 305 [2025-02-08 00:01:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:03,607 INFO L225 Difference]: With dead ends: 6414 [2025-02-08 00:01:03,608 INFO L226 Difference]: Without dead ends: 4340 [2025-02-08 00:01:03,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=626, Unknown=0, NotChecked=0, Total=756 [2025-02-08 00:01:03,611 INFO L435 NwaCegarLoop]: 729 mSDtfsCounter, 522 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 3575 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:03,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 3575 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:01:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4340 states. [2025-02-08 00:01:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4340 to 2528. [2025-02-08 00:01:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2528 states, 2527 states have (on average 1.445983379501385) internal successors, (3654), 2527 states have internal predecessors, (3654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:03,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2528 states to 2528 states and 3654 transitions. [2025-02-08 00:01:03,650 INFO L78 Accepts]: Start accepts. Automaton has 2528 states and 3654 transitions. Word has length 305 [2025-02-08 00:01:03,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:03,651 INFO L471 AbstractCegarLoop]: Abstraction has 2528 states and 3654 transitions. [2025-02-08 00:01:03,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 36.5) internal successors, (292), 8 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:03,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2528 states and 3654 transitions. [2025-02-08 00:01:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2025-02-08 00:01:03,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:03,656 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:03,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 00:01:03,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 00:01:03,857 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:03,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:03,858 INFO L85 PathProgramCache]: Analyzing trace with hash -2059569488, now seen corresponding path program 1 times [2025-02-08 00:01:03,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:03,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147417791] [2025-02-08 00:01:03,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:03,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:03,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-08 00:01:05,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-08 00:01:05,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:05,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:06,404 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 13 proven. 129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:06,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147417791] [2025-02-08 00:01:06,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147417791] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:06,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719869093] [2025-02-08 00:01:06,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:06,408 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:06,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 00:01:06,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 305 statements into 1 equivalence classes. [2025-02-08 00:01:07,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 305 of 305 statements. [2025-02-08 00:01:07,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:07,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 00:01:07,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 99 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:08,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-08 00:01:08,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719869093] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:08,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:08,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7, 14] total 27 [2025-02-08 00:01:08,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560907133] [2025-02-08 00:01:08,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:08,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 00:01:08,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:08,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 00:01:08,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:01:08,813 INFO L87 Difference]: Start difference. First operand 2528 states and 3654 transitions. Second operand has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:09,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:09,681 INFO L93 Difference]: Finished difference Result 7131 states and 10435 transitions. [2025-02-08 00:01:09,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:01:09,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 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 305 [2025-02-08 00:01:09,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:09,692 INFO L225 Difference]: With dead ends: 7131 [2025-02-08 00:01:09,692 INFO L226 Difference]: Without dead ends: 4857 [2025-02-08 00:01:09,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 593 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2025-02-08 00:01:09,698 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 1361 mSDsluCounter, 2160 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 2770 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:09,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 2770 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-08 00:01:09,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4857 states. [2025-02-08 00:01:09,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4857 to 2565. [2025-02-08 00:01:09,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.4465678627145087) internal successors, (3709), 2564 states have internal predecessors, (3709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3709 transitions. [2025-02-08 00:01:09,736 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3709 transitions. Word has length 305 [2025-02-08 00:01:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:09,737 INFO L471 AbstractCegarLoop]: Abstraction has 2565 states and 3709 transitions. [2025-02-08 00:01:09,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 37.375) internal successors, (299), 8 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3709 transitions. [2025-02-08 00:01:09,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-08 00:01:09,743 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:09,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:09,759 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 00:01:09,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 00:01:09,945 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:09,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:09,946 INFO L85 PathProgramCache]: Analyzing trace with hash -750488808, now seen corresponding path program 1 times [2025-02-08 00:01:09,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:09,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560029219] [2025-02-08 00:01:09,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:09,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:10,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 00:01:11,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 00:01:11,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:11,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:12,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:12,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560029219] [2025-02-08 00:01:12,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560029219] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:12,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408975172] [2025-02-08 00:01:12,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:12,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:12,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:12,745 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:12,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 00:01:13,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 00:01:13,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 00:01:13,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:13,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:13,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-02-08 00:01:13,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 43 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:14,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:15,378 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 00:01:15,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408975172] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:15,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 00:01:15,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9, 16] total 32 [2025-02-08 00:01:15,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820735228] [2025-02-08 00:01:15,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 00:01:15,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 00:01:15,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:15,380 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 00:01:15,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2025-02-08 00:01:15,381 INFO L87 Difference]: Start difference. First operand 2565 states and 3709 transitions. Second operand has 9 states, 9 states have (on average 32.0) internal successors, (288), 9 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:16,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 00:01:16,120 INFO L93 Difference]: Finished difference Result 7143 states and 10440 transitions. [2025-02-08 00:01:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 00:01:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 32.0) internal successors, (288), 9 states have internal predecessors, (288), 0 states have call successors, (0), 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 306 [2025-02-08 00:01:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 00:01:16,136 INFO L225 Difference]: With dead ends: 7143 [2025-02-08 00:01:16,138 INFO L226 Difference]: Without dead ends: 4832 [2025-02-08 00:01:16,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 591 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1050, Unknown=0, NotChecked=0, Total=1260 [2025-02-08 00:01:16,148 INFO L435 NwaCegarLoop]: 752 mSDtfsCounter, 737 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 737 SdHoareTripleChecker+Valid, 3342 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 00:01:16,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [737 Valid, 3342 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-08 00:01:16,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4832 states. [2025-02-08 00:01:16,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4832 to 3313. [2025-02-08 00:01:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3313 states, 3312 states have (on average 1.4568236714975846) internal successors, (4825), 3312 states have internal predecessors, (4825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3313 states to 3313 states and 4825 transitions. [2025-02-08 00:01:16,203 INFO L78 Accepts]: Start accepts. Automaton has 3313 states and 4825 transitions. Word has length 306 [2025-02-08 00:01:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 00:01:16,204 INFO L471 AbstractCegarLoop]: Abstraction has 3313 states and 4825 transitions. [2025-02-08 00:01:16,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.0) internal successors, (288), 9 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 00:01:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3313 states and 4825 transitions. [2025-02-08 00:01:16,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-02-08 00:01:16,210 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 00:01:16,210 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 00:01:16,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 00:01:16,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:16,411 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-08 00:01:16,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 00:01:16,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1237577734, now seen corresponding path program 1 times [2025-02-08 00:01:16,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 00:01:16,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100110767] [2025-02-08 00:01:16,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:16,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 00:01:16,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 00:01:17,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 00:01:17,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:17,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 125 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:19,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 00:01:19,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100110767] [2025-02-08 00:01:19,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100110767] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 00:01:19,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650377141] [2025-02-08 00:01:19,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 00:01:19,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 00:01:19,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 00:01:19,025 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 00:01:19,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 00:01:19,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-08 00:01:19,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-08 00:01:19,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 00:01:19,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 00:01:19,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 2015 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-08 00:01:19,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 00:01:20,788 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 99 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:20,789 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 00:01:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 99 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 00:01:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650377141] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 00:01:21,859 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 00:01:21,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 11] total 26 [2025-02-08 00:01:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870623961] [2025-02-08 00:01:21,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 00:01:21,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-08 00:01:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 00:01:21,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-08 00:01:21,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2025-02-08 00:01:21,862 INFO L87 Difference]: Start difference. First operand 3313 states and 4825 transitions. Second operand has 27 states, 27 states have (on average 26.88888888888889) internal successors, (726), 26 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)