./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/eca-rers2012/Problem11_label19.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:31:54,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:31:54,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:31:54,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:31:54,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:31:54,962 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:31:54,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:31:54,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:31:54,964 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:31:54,965 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:31:54,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:31:54,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:31:54,966 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:31:54,966 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:31:54,966 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:31:54,967 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:31:54,967 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:31:54,967 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:31:54,967 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:31:54,967 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:31:54,967 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:31:54,968 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:31:54,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:31:54,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:31:54,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:31:54,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:31:54,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:31:54,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:31:54,970 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 [2025-02-05 11:31:55,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:31:55,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:31:55,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:31:55,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:31:55,307 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:31:55,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2025-02-05 11:31:56,656 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22faba217/1144f3d42d464838bdcc980204e81bee/FLAG2ac6e9a56 [2025-02-05 11:31:57,097 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:31:57,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2025-02-05 11:31:57,117 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22faba217/1144f3d42d464838bdcc980204e81bee/FLAG2ac6e9a56 [2025-02-05 11:31:57,132 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/22faba217/1144f3d42d464838bdcc980204e81bee [2025-02-05 11:31:57,134 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:31:57,136 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:31:57,137 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:31:57,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:31:57,140 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:31:57,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53ed0374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57, skipping insertion in model container [2025-02-05 11:31:57,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,195 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:31:57,380 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/eca-rers2012/Problem11_label19.c[8142,8155] [2025-02-05 11:31:57,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:31:57,560 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:31:57,591 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/eca-rers2012/Problem11_label19.c[8142,8155] [2025-02-05 11:31:57,684 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:31:57,700 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:31:57,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57 WrapperNode [2025-02-05 11:31:57,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:31:57,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:31:57,702 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:31:57,702 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:31:57,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,735 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,830 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:31:57,830 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:31:57,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:31:57,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:31:57,831 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:31:57,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,861 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,957 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-05 11:31:57,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,960 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,989 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:57,993 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:58,000 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:58,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:58,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:31:58,028 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:31:58,028 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:31:58,028 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:31:58,029 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (1/1) ... [2025-02-05 11:31:58,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:31:58,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:31:58,062 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-05 11:31:58,066 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-05 11:31:58,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:31:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:31:58,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:31:58,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:31:58,148 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:31:58,150 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:31:59,819 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:31:59,819 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:31:59,841 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:31:59,842 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:31:59,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:31:59 BoogieIcfgContainer [2025-02-05 11:31:59,843 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:31:59,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:31:59,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:31:59,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:31:59,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:31:57" (1/3) ... [2025-02-05 11:31:59,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cab3dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:31:59, skipping insertion in model container [2025-02-05 11:31:59,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:31:57" (2/3) ... [2025-02-05 11:31:59,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cab3dff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:31:59, skipping insertion in model container [2025-02-05 11:31:59,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:31:59" (3/3) ... [2025-02-05 11:31:59,851 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label19.c [2025-02-05 11:31:59,863 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:31:59,865 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label19.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:31:59,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:31:59,941 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;@18d409f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:31:59,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:31:59,948 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:31:59,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 11:31:59,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:59,957 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:31:59,958 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:59,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash -591481421, now seen corresponding path program 1 times [2025-02-05 11:31:59,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:59,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034477385] [2025-02-05 11:31:59,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:59,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:00,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 11:32:00,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 11:32:00,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:00,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:00,381 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-05 11:32:00,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:00,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034477385] [2025-02-05 11:32:00,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034477385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:00,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:00,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:00,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587557931] [2025-02-05 11:32:00,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:00,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:00,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:00,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:00,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:00,413 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-05 11:32:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:01,556 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-02-05 11:32:01,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:01,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2025-02-05 11:32:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:01,571 INFO L225 Difference]: With dead ends: 761 [2025-02-05 11:32:01,571 INFO L226 Difference]: Without dead ends: 413 [2025-02-05 11:32:01,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:01,578 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 172 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:01,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:32:01,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-02-05 11:32:01,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-02-05 11:32:01,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:01,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-02-05 11:32:01,628 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 56 [2025-02-05 11:32:01,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:01,629 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-02-05 11:32:01,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 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-05 11:32:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-02-05 11:32:01,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 11:32:01,632 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:01,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:01,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:32:01,633 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:01,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:01,633 INFO L85 PathProgramCache]: Analyzing trace with hash 563589512, now seen corresponding path program 1 times [2025-02-05 11:32:01,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:01,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341135413] [2025-02-05 11:32:01,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:01,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 11:32:01,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 11:32:01,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:01,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:01,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:01,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341135413] [2025-02-05 11:32:01,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341135413] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:01,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933601832] [2025-02-05 11:32:01,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:01,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:01,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:01,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:01,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:01,909 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-05 11:32:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:02,586 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-02-05 11:32:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:02,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-02-05 11:32:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:02,591 INFO L225 Difference]: With dead ends: 1211 [2025-02-05 11:32:02,591 INFO L226 Difference]: Without dead ends: 800 [2025-02-05 11:32:02,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:02,593 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:02,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 119 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:02,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-02-05 11:32:02,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-02-05 11:32:02,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:02,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2025-02-05 11:32:02,624 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 124 [2025-02-05 11:32:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:02,625 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2025-02-05 11:32:02,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 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-05 11:32:02,625 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2025-02-05 11:32:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-02-05 11:32:02,627 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:02,627 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:02,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:32:02,628 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:02,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:02,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1668956160, now seen corresponding path program 1 times [2025-02-05 11:32:02,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:02,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886051507] [2025-02-05 11:32:02,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:02,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:02,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-05 11:32:02,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-05 11:32:02,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:02,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:03,214 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:03,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:03,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886051507] [2025-02-05 11:32:03,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886051507] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:03,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:03,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936683555] [2025-02-05 11:32:03,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:03,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:03,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:03,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:03,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:03,216 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-05 11:32:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:04,427 INFO L93 Difference]: Finished difference Result 2505 states and 3428 transitions. [2025-02-05 11:32:04,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:04,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-02-05 11:32:04,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:04,435 INFO L225 Difference]: With dead ends: 2505 [2025-02-05 11:32:04,435 INFO L226 Difference]: Without dead ends: 1718 [2025-02-05 11:32:04,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:32:04,437 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 486 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:04,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 218 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1133 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:32:04,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-02-05 11:32:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1714. [2025-02-05 11:32:04,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1714 states, 1713 states have (on average 1.2265032107413893) internal successors, (2101), 1713 states have internal predecessors, (2101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 2101 transitions. [2025-02-05 11:32:04,491 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 2101 transitions. Word has length 125 [2025-02-05 11:32:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:04,492 INFO L471 AbstractCegarLoop]: Abstraction has 1714 states and 2101 transitions. [2025-02-05 11:32:04,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 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-05 11:32:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2101 transitions. [2025-02-05 11:32:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-02-05 11:32:04,495 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:04,495 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:32:04,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:32:04,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:04,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash -790830474, now seen corresponding path program 1 times [2025-02-05 11:32:04,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:04,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114744782] [2025-02-05 11:32:04,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:04,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-02-05 11:32:04,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-02-05 11:32:04,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:04,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:04,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:04,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114744782] [2025-02-05 11:32:04,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114744782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:04,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:04,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:04,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316605659] [2025-02-05 11:32:04,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:04,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:04,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:04,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:04,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:04,780 INFO L87 Difference]: Start difference. First operand 1714 states and 2101 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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-05 11:32:05,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:05,510 INFO L93 Difference]: Finished difference Result 3991 states and 4985 transitions. [2025-02-05 11:32:05,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:05,511 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2025-02-05 11:32:05,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:05,521 INFO L225 Difference]: With dead ends: 3991 [2025-02-05 11:32:05,521 INFO L226 Difference]: Without dead ends: 2463 [2025-02-05 11:32:05,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:05,524 INFO L435 NwaCegarLoop]: 315 mSDtfsCounter, 149 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:05,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 336 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:05,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2463 states. [2025-02-05 11:32:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2463 to 2269. [2025-02-05 11:32:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2269 states, 2268 states have (on average 1.2134038800705467) internal successors, (2752), 2268 states have internal predecessors, (2752), 0 states have call successors, (0), 0 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-05 11:32:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2269 states to 2269 states and 2752 transitions. [2025-02-05 11:32:05,577 INFO L78 Accepts]: Start accepts. Automaton has 2269 states and 2752 transitions. Word has length 183 [2025-02-05 11:32:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:05,577 INFO L471 AbstractCegarLoop]: Abstraction has 2269 states and 2752 transitions. [2025-02-05 11:32:05,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 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-05 11:32:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2269 states and 2752 transitions. [2025-02-05 11:32:05,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-02-05 11:32:05,582 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:05,582 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:05,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:32:05,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:05,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1932167549, now seen corresponding path program 1 times [2025-02-05 11:32:05,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:05,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506760744] [2025-02-05 11:32:05,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:05,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-02-05 11:32:05,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-02-05 11:32:05,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:05,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506760744] [2025-02-05 11:32:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506760744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:32:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708920310] [2025-02-05 11:32:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:06,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:06,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:06,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:06,166 INFO L87 Difference]: Start difference. First operand 2269 states and 2752 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-05 11:32:07,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:07,560 INFO L93 Difference]: Finished difference Result 6580 states and 8186 transitions. [2025-02-05 11:32:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:07,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2025-02-05 11:32:07,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:07,576 INFO L225 Difference]: With dead ends: 6580 [2025-02-05 11:32:07,576 INFO L226 Difference]: Without dead ends: 4313 [2025-02-05 11:32:07,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:07,580 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 322 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1118 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:07,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 73 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1118 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 11:32:07,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4313 states. [2025-02-05 11:32:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4313 to 4117. [2025-02-05 11:32:07,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4117 states, 4116 states have (on average 1.219387755102041) internal successors, (5019), 4116 states have internal predecessors, (5019), 0 states have call successors, (0), 0 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-05 11:32:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4117 states to 4117 states and 5019 transitions. [2025-02-05 11:32:07,652 INFO L78 Accepts]: Start accepts. Automaton has 4117 states and 5019 transitions. Word has length 237 [2025-02-05 11:32:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:07,653 INFO L471 AbstractCegarLoop]: Abstraction has 4117 states and 5019 transitions. [2025-02-05 11:32:07,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 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-05 11:32:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 4117 states and 5019 transitions. [2025-02-05 11:32:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-02-05 11:32:07,657 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:07,657 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:07,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:32:07,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:07,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:07,658 INFO L85 PathProgramCache]: Analyzing trace with hash -240802528, now seen corresponding path program 1 times [2025-02-05 11:32:07,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:07,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814647207] [2025-02-05 11:32:07,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:07,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:07,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-02-05 11:32:07,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-02-05 11:32:07,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:07,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:32:07,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:07,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814647207] [2025-02-05 11:32:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814647207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:07,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:07,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:07,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10157802] [2025-02-05 11:32:07,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:07,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:07,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:07,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:07,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:07,944 INFO L87 Difference]: Start difference. First operand 4117 states and 5019 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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-05 11:32:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:08,626 INFO L93 Difference]: Finished difference Result 9162 states and 11337 transitions. [2025-02-05 11:32:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:08,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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 238 [2025-02-05 11:32:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:08,644 INFO L225 Difference]: With dead ends: 9162 [2025-02-05 11:32:08,644 INFO L226 Difference]: Without dead ends: 5415 [2025-02-05 11:32:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:08,651 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:08,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 373 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:08,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5415 states. [2025-02-05 11:32:08,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5415 to 5405. [2025-02-05 11:32:08,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5405 states, 5404 states have (on average 1.199296817172465) internal successors, (6481), 5404 states have internal predecessors, (6481), 0 states have call successors, (0), 0 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-05 11:32:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 6481 transitions. [2025-02-05 11:32:08,754 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 6481 transitions. Word has length 238 [2025-02-05 11:32:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:08,755 INFO L471 AbstractCegarLoop]: Abstraction has 5405 states and 6481 transitions. [2025-02-05 11:32:08,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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-05 11:32:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 6481 transitions. [2025-02-05 11:32:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-02-05 11:32:08,759 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:08,759 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:08,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:32:08,759 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:08,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:08,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1592960665, now seen corresponding path program 1 times [2025-02-05 11:32:08,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:08,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229755861] [2025-02-05 11:32:08,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:08,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:08,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-02-05 11:32:08,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-02-05 11:32:08,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:08,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:08,983 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 11:32:08,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:08,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229755861] [2025-02-05 11:32:08,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229755861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:08,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:08,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:08,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643003137] [2025-02-05 11:32:08,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:08,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:08,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:08,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:08,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:08,985 INFO L87 Difference]: Start difference. First operand 5405 states and 6481 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:09,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:09,799 INFO L93 Difference]: Finished difference Result 12110 states and 14715 transitions. [2025-02-05 11:32:09,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:09,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2025-02-05 11:32:09,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:09,822 INFO L225 Difference]: With dead ends: 12110 [2025-02-05 11:32:09,823 INFO L226 Difference]: Without dead ends: 7075 [2025-02-05 11:32:09,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:09,831 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 171 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:09,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 301 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:32:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7075 states. [2025-02-05 11:32:09,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7075 to 6520. [2025-02-05 11:32:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6520 states, 6519 states have (on average 1.210001533977604) internal successors, (7888), 6519 states have internal predecessors, (7888), 0 states have call successors, (0), 0 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-05 11:32:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6520 states to 6520 states and 7888 transitions. [2025-02-05 11:32:09,937 INFO L78 Accepts]: Start accepts. Automaton has 6520 states and 7888 transitions. Word has length 248 [2025-02-05 11:32:09,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:09,937 INFO L471 AbstractCegarLoop]: Abstraction has 6520 states and 7888 transitions. [2025-02-05 11:32:09,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 6520 states and 7888 transitions. [2025-02-05 11:32:09,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2025-02-05 11:32:09,942 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:09,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:09,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:32:09,943 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:09,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:09,945 INFO L85 PathProgramCache]: Analyzing trace with hash 257559022, now seen corresponding path program 1 times [2025-02-05 11:32:09,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:09,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267456884] [2025-02-05 11:32:09,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:09,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:09,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes. [2025-02-05 11:32:09,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements. [2025-02-05 11:32:09,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:09,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-02-05 11:32:10,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:10,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267456884] [2025-02-05 11:32:10,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267456884] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:10,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:10,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:10,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623130789] [2025-02-05 11:32:10,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:10,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:10,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:10,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:10,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:10,226 INFO L87 Difference]: Start difference. First operand 6520 states and 7888 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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-05 11:32:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:11,006 INFO L93 Difference]: Finished difference Result 13980 states and 17018 transitions. [2025-02-05 11:32:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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 258 [2025-02-05 11:32:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:11,028 INFO L225 Difference]: With dead ends: 13980 [2025-02-05 11:32:11,028 INFO L226 Difference]: Without dead ends: 7830 [2025-02-05 11:32:11,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:11,035 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 146 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:11,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 186 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7830 states. [2025-02-05 11:32:11,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7830 to 7439. [2025-02-05 11:32:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7439 states, 7438 states have (on average 1.2106749126109169) internal successors, (9005), 7438 states have internal predecessors, (9005), 0 states have call successors, (0), 0 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-05 11:32:11,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7439 states to 7439 states and 9005 transitions. [2025-02-05 11:32:11,178 INFO L78 Accepts]: Start accepts. Automaton has 7439 states and 9005 transitions. Word has length 258 [2025-02-05 11:32:11,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:11,179 INFO L471 AbstractCegarLoop]: Abstraction has 7439 states and 9005 transitions. [2025-02-05 11:32:11,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 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-05 11:32:11,179 INFO L276 IsEmpty]: Start isEmpty. Operand 7439 states and 9005 transitions. [2025-02-05 11:32:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-02-05 11:32:11,189 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:11,189 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:32:11,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:32:11,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:11,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:11,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1071693763, now seen corresponding path program 1 times [2025-02-05 11:32:11,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:11,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320555682] [2025-02-05 11:32:11,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:11,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:11,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-02-05 11:32:11,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-02-05 11:32:11,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:11,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:11,355 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-02-05 11:32:11,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:11,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320555682] [2025-02-05 11:32:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320555682] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:11,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:11,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439581036] [2025-02-05 11:32:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:11,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:11,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:11,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:11,358 INFO L87 Difference]: Start difference. First operand 7439 states and 9005 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:12,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:12,178 INFO L93 Difference]: Finished difference Result 17635 states and 21658 transitions. [2025-02-05 11:32:12,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:12,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-02-05 11:32:12,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:12,199 INFO L225 Difference]: With dead ends: 17635 [2025-02-05 11:32:12,199 INFO L226 Difference]: Without dead ends: 10566 [2025-02-05 11:32:12,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:12,205 INFO L435 NwaCegarLoop]: 323 mSDtfsCounter, 168 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:12,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 343 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:32:12,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10566 states. [2025-02-05 11:32:12,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10566 to 10566. [2025-02-05 11:32:12,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10566 states, 10565 states have (on average 1.2007572172266918) internal successors, (12686), 10565 states have internal predecessors, (12686), 0 states have call successors, (0), 0 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-05 11:32:12,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10566 states to 10566 states and 12686 transitions. [2025-02-05 11:32:12,328 INFO L78 Accepts]: Start accepts. Automaton has 10566 states and 12686 transitions. Word has length 281 [2025-02-05 11:32:12,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:12,328 INFO L471 AbstractCegarLoop]: Abstraction has 10566 states and 12686 transitions. [2025-02-05 11:32:12,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:12,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10566 states and 12686 transitions. [2025-02-05 11:32:12,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-02-05 11:32:12,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:12,335 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:12,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:32:12,336 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:12,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:12,340 INFO L85 PathProgramCache]: Analyzing trace with hash -524120919, now seen corresponding path program 1 times [2025-02-05 11:32:12,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:12,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135592330] [2025-02-05 11:32:12,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:12,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:12,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-02-05 11:32:12,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-02-05 11:32:12,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:12,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-02-05 11:32:12,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:12,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135592330] [2025-02-05 11:32:12,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135592330] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:12,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:12,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:12,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906246160] [2025-02-05 11:32:12,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:12,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:12,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:12,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:12,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:12,693 INFO L87 Difference]: Start difference. First operand 10566 states and 12686 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:13,520 INFO L93 Difference]: Finished difference Result 21135 states and 25386 transitions. [2025-02-05 11:32:13,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:13,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2025-02-05 11:32:13,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:13,545 INFO L225 Difference]: With dead ends: 21135 [2025-02-05 11:32:13,546 INFO L226 Difference]: Without dead ends: 10755 [2025-02-05 11:32:13,556 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:13,557 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:13,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 374 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:13,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10755 states. [2025-02-05 11:32:13,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10755 to 10565. [2025-02-05 11:32:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10565 states, 10564 states have (on average 1.1675501703900037) internal successors, (12334), 10564 states have internal predecessors, (12334), 0 states have call successors, (0), 0 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-05 11:32:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10565 states to 10565 states and 12334 transitions. [2025-02-05 11:32:13,747 INFO L78 Accepts]: Start accepts. Automaton has 10565 states and 12334 transitions. Word has length 289 [2025-02-05 11:32:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:13,748 INFO L471 AbstractCegarLoop]: Abstraction has 10565 states and 12334 transitions. [2025-02-05 11:32:13,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 10565 states and 12334 transitions. [2025-02-05 11:32:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-02-05 11:32:13,758 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:13,758 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-05 11:32:13,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:32:13,759 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:13,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:13,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1202327609, now seen corresponding path program 1 times [2025-02-05 11:32:13,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:13,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437194611] [2025-02-05 11:32:13,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:13,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:13,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-05 11:32:13,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-05 11:32:13,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:13,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:13,932 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:32:13,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:13,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437194611] [2025-02-05 11:32:13,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437194611] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:13,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:13,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:13,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691909948] [2025-02-05 11:32:13,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:13,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:13,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:13,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:13,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:13,933 INFO L87 Difference]: Start difference. First operand 10565 states and 12334 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:14,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:14,734 INFO L93 Difference]: Finished difference Result 20758 states and 24284 transitions. [2025-02-05 11:32:14,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:14,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 330 [2025-02-05 11:32:14,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:14,753 INFO L225 Difference]: With dead ends: 20758 [2025-02-05 11:32:14,753 INFO L226 Difference]: Without dead ends: 10563 [2025-02-05 11:32:14,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:14,763 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:14,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 148 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:32:14,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10563 states. [2025-02-05 11:32:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10563 to 10377. [2025-02-05 11:32:14,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10376 states have (on average 1.1183500385505012) internal successors, (11604), 10376 states have internal predecessors, (11604), 0 states have call successors, (0), 0 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-05 11:32:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 11604 transitions. [2025-02-05 11:32:14,915 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 11604 transitions. Word has length 330 [2025-02-05 11:32:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 10377 states and 11604 transitions. [2025-02-05 11:32:14,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 11604 transitions. [2025-02-05 11:32:14,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2025-02-05 11:32:14,927 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:14,927 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:14,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:32:14,927 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:14,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:14,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1022539388, now seen corresponding path program 1 times [2025-02-05 11:32:14,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:14,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208590669] [2025-02-05 11:32:14,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:14,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:14,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes. [2025-02-05 11:32:14,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements. [2025-02-05 11:32:14,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:14,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-02-05 11:32:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208590669] [2025-02-05 11:32:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208590669] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:15,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:15,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:32:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056755831] [2025-02-05 11:32:15,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:15,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:15,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:15,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:15,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:15,125 INFO L87 Difference]: Start difference. First operand 10377 states and 11604 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-05 11:32:15,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:15,503 INFO L93 Difference]: Finished difference Result 20378 states and 22820 transitions. [2025-02-05 11:32:15,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:15,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 338 [2025-02-05 11:32:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:15,514 INFO L225 Difference]: With dead ends: 20378 [2025-02-05 11:32:15,514 INFO L226 Difference]: Without dead ends: 10371 [2025-02-05 11:32:15,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:15,521 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:15,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 11:32:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10371 states. [2025-02-05 11:32:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10371 to 10370. [2025-02-05 11:32:15,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10370 states, 10369 states have (on average 1.1178512874915614) internal successors, (11591), 10369 states have internal predecessors, (11591), 0 states have call successors, (0), 0 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-05 11:32:15,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10370 states to 10370 states and 11591 transitions. [2025-02-05 11:32:15,621 INFO L78 Accepts]: Start accepts. Automaton has 10370 states and 11591 transitions. Word has length 338 [2025-02-05 11:32:15,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:15,621 INFO L471 AbstractCegarLoop]: Abstraction has 10370 states and 11591 transitions. [2025-02-05 11:32:15,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 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-05 11:32:15,622 INFO L276 IsEmpty]: Start isEmpty. Operand 10370 states and 11591 transitions. [2025-02-05 11:32:15,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-02-05 11:32:15,629 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:15,629 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:15,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:32:15,629 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:15,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:15,630 INFO L85 PathProgramCache]: Analyzing trace with hash 958663606, now seen corresponding path program 1 times [2025-02-05 11:32:15,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:15,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927278215] [2025-02-05 11:32:15,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:15,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:15,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-02-05 11:32:15,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-02-05 11:32:15,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:15,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 11:32:16,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:16,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927278215] [2025-02-05 11:32:16,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927278215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:16,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:16,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629726806] [2025-02-05 11:32:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:16,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:16,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:16,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:16,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:16,036 INFO L87 Difference]: Start difference. First operand 10370 states and 11591 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:17,280 INFO L93 Difference]: Finished difference Result 22404 states and 25050 transitions. [2025-02-05 11:32:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:17,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2025-02-05 11:32:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:17,294 INFO L225 Difference]: With dead ends: 22404 [2025-02-05 11:32:17,294 INFO L226 Difference]: Without dead ends: 12404 [2025-02-05 11:32:17,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:17,303 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 218 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:17,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 132 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:32:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12404 states. [2025-02-05 11:32:17,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12404 to 12398. [2025-02-05 11:32:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12398 states, 12397 states have (on average 1.1101879486972654) internal successors, (13763), 12397 states have internal predecessors, (13763), 0 states have call successors, (0), 0 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-05 11:32:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 13763 transitions. [2025-02-05 11:32:17,449 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 13763 transitions. Word has length 350 [2025-02-05 11:32:17,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:17,450 INFO L471 AbstractCegarLoop]: Abstraction has 12398 states and 13763 transitions. [2025-02-05 11:32:17,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 13763 transitions. [2025-02-05 11:32:17,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-02-05 11:32:17,484 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:17,484 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-05 11:32:17,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:32:17,485 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:17,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:17,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1968946803, now seen corresponding path program 1 times [2025-02-05 11:32:17,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:17,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301623031] [2025-02-05 11:32:17,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:17,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:17,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-02-05 11:32:17,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-02-05 11:32:17,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:17,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2025-02-05 11:32:17,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:17,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301623031] [2025-02-05 11:32:17,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301623031] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:17,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:17,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:17,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526993134] [2025-02-05 11:32:17,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:17,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:17,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:17,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:17,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:17,846 INFO L87 Difference]: Start difference. First operand 12398 states and 13763 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:18,734 INFO L93 Difference]: Finished difference Result 24432 states and 27151 transitions. [2025-02-05 11:32:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:18,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 355 [2025-02-05 11:32:18,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:18,752 INFO L225 Difference]: With dead ends: 24432 [2025-02-05 11:32:18,752 INFO L226 Difference]: Without dead ends: 12404 [2025-02-05 11:32:18,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:18,763 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 125 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:18,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 353 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 11:32:18,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12404 states. [2025-02-05 11:32:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12404 to 12398. [2025-02-05 11:32:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12398 states, 12397 states have (on average 1.10921997257401) internal successors, (13751), 12397 states have internal predecessors, (13751), 0 states have call successors, (0), 0 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-05 11:32:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12398 states to 12398 states and 13751 transitions. [2025-02-05 11:32:18,945 INFO L78 Accepts]: Start accepts. Automaton has 12398 states and 13751 transitions. Word has length 355 [2025-02-05 11:32:18,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:18,946 INFO L471 AbstractCegarLoop]: Abstraction has 12398 states and 13751 transitions. [2025-02-05 11:32:18,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:18,946 INFO L276 IsEmpty]: Start isEmpty. Operand 12398 states and 13751 transitions. [2025-02-05 11:32:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-02-05 11:32:18,957 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:18,958 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:18,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:32:18,958 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:18,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:18,959 INFO L85 PathProgramCache]: Analyzing trace with hash -729157745, now seen corresponding path program 1 times [2025-02-05 11:32:18,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:18,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315835674] [2025-02-05 11:32:18,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:18,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:19,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-02-05 11:32:19,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-02-05 11:32:19,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:19,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 381 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 11:32:19,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:19,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315835674] [2025-02-05 11:32:19,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315835674] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:19,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:19,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:19,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933593305] [2025-02-05 11:32:19,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:19,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:19,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:19,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:19,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:19,298 INFO L87 Difference]: Start difference. First operand 12398 states and 13751 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-05 11:32:19,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:19,902 INFO L93 Difference]: Finished difference Result 27013 states and 30103 transitions. [2025-02-05 11:32:19,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:19,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 367 [2025-02-05 11:32:19,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:19,969 INFO L225 Difference]: With dead ends: 27013 [2025-02-05 11:32:19,970 INFO L226 Difference]: Without dead ends: 14985 [2025-02-05 11:32:19,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:19,974 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 139 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:19,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 114 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:32:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14985 states. [2025-02-05 11:32:20,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14985 to 14982. [2025-02-05 11:32:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14982 states, 14981 states have (on average 1.1055336759895869) internal successors, (16562), 14981 states have internal predecessors, (16562), 0 states have call successors, (0), 0 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-05 11:32:20,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14982 states to 14982 states and 16562 transitions. [2025-02-05 11:32:20,124 INFO L78 Accepts]: Start accepts. Automaton has 14982 states and 16562 transitions. Word has length 367 [2025-02-05 11:32:20,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:20,124 INFO L471 AbstractCegarLoop]: Abstraction has 14982 states and 16562 transitions. [2025-02-05 11:32:20,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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-05 11:32:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 14982 states and 16562 transitions. [2025-02-05 11:32:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-02-05 11:32:20,131 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:20,131 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:20,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 11:32:20,131 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:20,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:20,132 INFO L85 PathProgramCache]: Analyzing trace with hash 621507101, now seen corresponding path program 1 times [2025-02-05 11:32:20,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:20,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219952002] [2025-02-05 11:32:20,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:20,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:20,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-05 11:32:20,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-05 11:32:20,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:20,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 247 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:20,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:20,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219952002] [2025-02-05 11:32:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219952002] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:32:20,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245709076] [2025-02-05 11:32:20,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:20,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:20,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:20,827 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-05 11:32:20,829 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-05 11:32:20,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-02-05 11:32:20,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-02-05 11:32:20,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:20,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:20,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:32:20,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:32:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 11:32:21,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:32:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245709076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:32:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 11:32:21,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258240801] [2025-02-05 11:32:21,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:21,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:21,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:21,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:21,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:32:21,262 INFO L87 Difference]: Start difference. First operand 14982 states and 16562 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:21,892 INFO L93 Difference]: Finished difference Result 30528 states and 33799 transitions. [2025-02-05 11:32:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:21,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2025-02-05 11:32:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:21,907 INFO L225 Difference]: With dead ends: 30528 [2025-02-05 11:32:21,907 INFO L226 Difference]: Without dead ends: 15916 [2025-02-05 11:32:21,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 371 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:32:21,919 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 134 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:21,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 319 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:32:21,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15916 states. [2025-02-05 11:32:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15916 to 15722. [2025-02-05 11:32:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15722 states, 15721 states have (on average 1.105209592265123) internal successors, (17375), 15721 states have internal predecessors, (17375), 0 states have call successors, (0), 0 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-05 11:32:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15722 states to 15722 states and 17375 transitions. [2025-02-05 11:32:22,095 INFO L78 Accepts]: Start accepts. Automaton has 15722 states and 17375 transitions. Word has length 371 [2025-02-05 11:32:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 15722 states and 17375 transitions. [2025-02-05 11:32:22,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 15722 states and 17375 transitions. [2025-02-05 11:32:22,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2025-02-05 11:32:22,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:22,103 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:22,112 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-05 11:32:22,304 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,SelfDestructingSolverStorable15 [2025-02-05 11:32:22,304 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:22,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:22,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1093855992, now seen corresponding path program 1 times [2025-02-05 11:32:22,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:22,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648125527] [2025-02-05 11:32:22,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:22,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:22,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes. [2025-02-05 11:32:22,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements. [2025-02-05 11:32:22,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:22,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:22,727 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-02-05 11:32:22,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:22,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648125527] [2025-02-05 11:32:22,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648125527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:22,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:22,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:22,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134091795] [2025-02-05 11:32:22,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:22,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:32:22,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:22,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:32:22,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:22,730 INFO L87 Difference]: Start difference. First operand 15722 states and 17375 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:23,925 INFO L93 Difference]: Finished difference Result 41961 states and 46303 transitions. [2025-02-05 11:32:23,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:32:23,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 377 [2025-02-05 11:32:23,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:23,952 INFO L225 Difference]: With dead ends: 41961 [2025-02-05 11:32:23,952 INFO L226 Difference]: Without dead ends: 25685 [2025-02-05 11:32:23,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:32:23,967 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 225 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:23,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 69 Invalid, 1269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 11:32:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25685 states. [2025-02-05 11:32:24,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25685 to 24208. [2025-02-05 11:32:24,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24208 states, 24207 states have (on average 1.0983599785186102) internal successors, (26588), 24207 states have internal predecessors, (26588), 0 states have call successors, (0), 0 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-05 11:32:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24208 states to 24208 states and 26588 transitions. [2025-02-05 11:32:24,308 INFO L78 Accepts]: Start accepts. Automaton has 24208 states and 26588 transitions. Word has length 377 [2025-02-05 11:32:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:24,308 INFO L471 AbstractCegarLoop]: Abstraction has 24208 states and 26588 transitions. [2025-02-05 11:32:24,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 24208 states and 26588 transitions. [2025-02-05 11:32:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2025-02-05 11:32:24,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:24,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:32:24,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 11:32:24,323 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:24,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:24,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1374426786, now seen corresponding path program 1 times [2025-02-05 11:32:24,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:24,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28608419] [2025-02-05 11:32:24,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:24,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:24,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-05 11:32:24,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-05 11:32:24,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:24,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:24,651 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2025-02-05 11:32:24,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:24,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28608419] [2025-02-05 11:32:24,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28608419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:24,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:24,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267781453] [2025-02-05 11:32:24,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:24,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:24,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:24,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:24,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:24,654 INFO L87 Difference]: Start difference. First operand 24208 states and 26588 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-05 11:32:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:25,244 INFO L93 Difference]: Finished difference Result 28258 states and 31010 transitions. [2025-02-05 11:32:25,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 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 408 [2025-02-05 11:32:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:25,270 INFO L225 Difference]: With dead ends: 28258 [2025-02-05 11:32:25,270 INFO L226 Difference]: Without dead ends: 28256 [2025-02-05 11:32:25,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:25,278 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 166 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:25,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 132 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:32:25,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28256 states. [2025-02-05 11:32:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28256 to 24576. [2025-02-05 11:32:25,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24576 states, 24575 states have (on average 1.098880976602238) internal successors, (27005), 24575 states have internal predecessors, (27005), 0 states have call successors, (0), 0 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-05 11:32:25,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24576 states to 24576 states and 27005 transitions. [2025-02-05 11:32:25,502 INFO L78 Accepts]: Start accepts. Automaton has 24576 states and 27005 transitions. Word has length 408 [2025-02-05 11:32:25,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:25,502 INFO L471 AbstractCegarLoop]: Abstraction has 24576 states and 27005 transitions. [2025-02-05 11:32:25,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 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-05 11:32:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 24576 states and 27005 transitions. [2025-02-05 11:32:25,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2025-02-05 11:32:25,515 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:25,515 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 11:32:25,515 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:25,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -310703461, now seen corresponding path program 1 times [2025-02-05 11:32:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094662717] [2025-02-05 11:32:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:25,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-02-05 11:32:25,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-02-05 11:32:25,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:25,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 11:32:25,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:25,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094662717] [2025-02-05 11:32:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094662717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:25,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637271855] [2025-02-05 11:32:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:25,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:25,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:25,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:25,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:25,786 INFO L87 Difference]: Start difference. First operand 24576 states and 27005 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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-05 11:32:26,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:26,537 INFO L93 Difference]: Finished difference Result 53572 states and 58846 transitions. [2025-02-05 11:32:26,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:26,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 419 [2025-02-05 11:32:26,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:26,565 INFO L225 Difference]: With dead ends: 53572 [2025-02-05 11:32:26,565 INFO L226 Difference]: Without dead ends: 29550 [2025-02-05 11:32:26,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:26,577 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:26,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 74 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:26,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29550 states. [2025-02-05 11:32:26,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29550 to 29360. [2025-02-05 11:32:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29360 states, 29359 states have (on average 1.089376341156034) internal successors, (31983), 29359 states have internal predecessors, (31983), 0 states have call successors, (0), 0 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-05 11:32:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29360 states to 29360 states and 31983 transitions. [2025-02-05 11:32:26,808 INFO L78 Accepts]: Start accepts. Automaton has 29360 states and 31983 transitions. Word has length 419 [2025-02-05 11:32:26,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:26,808 INFO L471 AbstractCegarLoop]: Abstraction has 29360 states and 31983 transitions. [2025-02-05 11:32:26,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 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-05 11:32:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 29360 states and 31983 transitions. [2025-02-05 11:32:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-05 11:32:26,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:26,817 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 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-05 11:32:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 11:32:26,817 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:26,818 INFO L85 PathProgramCache]: Analyzing trace with hash 646180628, now seen corresponding path program 1 times [2025-02-05 11:32:26,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:26,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95395704] [2025-02-05 11:32:26,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:26,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 11:32:26,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 11:32:26,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:26,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 249 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:27,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95395704] [2025-02-05 11:32:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95395704] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:32:27,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759054516] [2025-02-05 11:32:27,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:27,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:27,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:27,444 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-05 11:32:27,446 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-05 11:32:27,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-05 11:32:27,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-05 11:32:27,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:27,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:27,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:32:27,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:32:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 230 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:29,078 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:32:31,246 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 303 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:32:31,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759054516] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:32:31,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:32:31,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2025-02-05 11:32:31,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589623008] [2025-02-05 11:32:31,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:32:31,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 11:32:31,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:31,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 11:32:31,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-02-05 11:32:31,249 INFO L87 Difference]: Start difference. First operand 29360 states and 31983 transitions. Second operand has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 11 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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-05 11:32:37,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:37,718 INFO L93 Difference]: Finished difference Result 75307 states and 81904 transitions. [2025-02-05 11:32:37,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-05 11:32:37,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 11 states have internal predecessors, (1234), 0 states have call successors, (0), 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 430 [2025-02-05 11:32:37,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:37,788 INFO L225 Difference]: With dead ends: 75307 [2025-02-05 11:32:37,789 INFO L226 Difference]: Without dead ends: 45765 [2025-02-05 11:32:37,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2025-02-05 11:32:37,815 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 2499 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 6030 mSolverCounterSat, 1191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2499 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 7221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1191 IncrementalHoareTripleChecker+Valid, 6030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:37,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2499 Valid, 245 Invalid, 7221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1191 Valid, 6030 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-02-05 11:32:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45765 states. [2025-02-05 11:32:38,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45765 to 29544. [2025-02-05 11:32:38,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29544 states, 29543 states have (on average 1.0770402464204718) internal successors, (31819), 29543 states have internal predecessors, (31819), 0 states have call successors, (0), 0 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-05 11:32:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29544 states to 29544 states and 31819 transitions. [2025-02-05 11:32:38,411 INFO L78 Accepts]: Start accepts. Automaton has 29544 states and 31819 transitions. Word has length 430 [2025-02-05 11:32:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:38,412 INFO L471 AbstractCegarLoop]: Abstraction has 29544 states and 31819 transitions. [2025-02-05 11:32:38,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 11 states have internal predecessors, (1234), 0 states have call successors, (0), 0 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-05 11:32:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29544 states and 31819 transitions. [2025-02-05 11:32:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2025-02-05 11:32:38,421 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:38,421 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:38,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 11:32:38,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:38,622 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:38,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:38,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1051352283, now seen corresponding path program 1 times [2025-02-05 11:32:38,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:38,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674793148] [2025-02-05 11:32:38,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:38,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:38,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 466 statements into 1 equivalence classes. [2025-02-05 11:32:38,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 466 of 466 statements. [2025-02-05 11:32:38,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:38,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-02-05 11:32:39,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:39,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674793148] [2025-02-05 11:32:39,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674793148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:32:39,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:32:39,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:32:39,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246615790] [2025-02-05 11:32:39,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:32:39,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:32:39,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:39,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:32:39,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:39,071 INFO L87 Difference]: Start difference. First operand 29544 states and 31819 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-05 11:32:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:39,831 INFO L93 Difference]: Finished difference Result 33778 states and 36322 transitions. [2025-02-05 11:32:39,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:32:39,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 466 [2025-02-05 11:32:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:39,865 INFO L225 Difference]: With dead ends: 33778 [2025-02-05 11:32:39,866 INFO L226 Difference]: Without dead ends: 33776 [2025-02-05 11:32:39,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:32:39,877 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 168 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:39,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 131 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:32:39,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33776 states. [2025-02-05 11:32:40,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33776 to 29176. [2025-02-05 11:32:40,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29176 states, 29175 states have (on average 1.0775321336760926) internal successors, (31437), 29175 states have internal predecessors, (31437), 0 states have call successors, (0), 0 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-05 11:32:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29176 states to 29176 states and 31437 transitions. [2025-02-05 11:32:40,295 INFO L78 Accepts]: Start accepts. Automaton has 29176 states and 31437 transitions. Word has length 466 [2025-02-05 11:32:40,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:40,296 INFO L471 AbstractCegarLoop]: Abstraction has 29176 states and 31437 transitions. [2025-02-05 11:32:40,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 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-05 11:32:40,296 INFO L276 IsEmpty]: Start isEmpty. Operand 29176 states and 31437 transitions. [2025-02-05 11:32:40,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2025-02-05 11:32:40,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:40,312 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 11:32:40,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 11:32:40,312 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:40,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash -401147639, now seen corresponding path program 1 times [2025-02-05 11:32:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:40,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542302976] [2025-02-05 11:32:40,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:40,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-05 11:32:40,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-05 11:32:40,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:40,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:41,309 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 11:32:41,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542302976] [2025-02-05 11:32:41,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542302976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:32:41,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057872918] [2025-02-05 11:32:41,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:41,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:41,315 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-05 11:32:41,318 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-05 11:32:41,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 505 statements into 1 equivalence classes. [2025-02-05 11:32:41,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 505 of 505 statements. [2025-02-05 11:32:41,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:41,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:41,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 11:32:41,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:32:43,339 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 11:32:43,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:32:45,637 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 11:32:45,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057872918] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:32:45,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:32:45,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-05 11:32:45,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575934267] [2025-02-05 11:32:45,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:32:45,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-05 11:32:45,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:45,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-05 11:32:45,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-02-05 11:32:45,640 INFO L87 Difference]: Start difference. First operand 29176 states and 31437 transitions. Second operand has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 10 states have internal predecessors, (707), 0 states have call successors, (0), 0 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-05 11:32:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:50,845 INFO L93 Difference]: Finished difference Result 63557 states and 68385 transitions. [2025-02-05 11:32:50,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-05 11:32:50,846 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 10 states have internal predecessors, (707), 0 states have call successors, (0), 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 505 [2025-02-05 11:32:50,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:50,912 INFO L225 Difference]: With dead ends: 63557 [2025-02-05 11:32:50,912 INFO L226 Difference]: Without dead ends: 34751 [2025-02-05 11:32:50,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2025-02-05 11:32:50,934 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2607 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 4485 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2607 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 5202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 4485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:50,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2607 Valid, 130 Invalid, 5202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 4485 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-02-05 11:32:50,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34751 states. [2025-02-05 11:32:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34751 to 19200. [2025-02-05 11:32:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19200 states, 19199 states have (on average 1.0744830459919787) internal successors, (20629), 19199 states have internal predecessors, (20629), 0 states have call successors, (0), 0 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-05 11:32:51,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19200 states to 19200 states and 20629 transitions. [2025-02-05 11:32:51,234 INFO L78 Accepts]: Start accepts. Automaton has 19200 states and 20629 transitions. Word has length 505 [2025-02-05 11:32:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:51,234 INFO L471 AbstractCegarLoop]: Abstraction has 19200 states and 20629 transitions. [2025-02-05 11:32:51,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 10 states have internal predecessors, (707), 0 states have call successors, (0), 0 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-05 11:32:51,235 INFO L276 IsEmpty]: Start isEmpty. Operand 19200 states and 20629 transitions. [2025-02-05 11:32:51,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-02-05 11:32:51,253 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:32:51,253 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:51,273 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-05 11:32:51,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:51,454 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:32:51,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:32:51,455 INFO L85 PathProgramCache]: Analyzing trace with hash 377580107, now seen corresponding path program 1 times [2025-02-05 11:32:51,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:32:51,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922363588] [2025-02-05 11:32:51,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:51,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:32:51,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 11:32:51,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 11:32:51,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:51,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:52,431 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 410 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 11:32:52,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:32:52,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922363588] [2025-02-05 11:32:52,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922363588] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:32:52,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12830254] [2025-02-05 11:32:52,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:32:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:32:52,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:32:52,435 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-05 11:32:52,437 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-05 11:32:52,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-02-05 11:32:52,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-02-05 11:32:52,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:32:52,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:32:52,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 11:32:52,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:32:54,203 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 356 proven. 260 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 11:32:54,203 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:32:55,485 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 547 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-02-05 11:32:55,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12830254] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 11:32:55,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 11:32:55,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-05 11:32:55,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437931396] [2025-02-05 11:32:55,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 11:32:55,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 11:32:55,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:32:55,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 11:32:55,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:32:55,489 INFO L87 Difference]: Start difference. First operand 19200 states and 20629 transitions. Second operand has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 0 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-05 11:32:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:32:59,717 INFO L93 Difference]: Finished difference Result 49462 states and 53185 transitions. [2025-02-05 11:32:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 11:32:59,718 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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 541 [2025-02-05 11:32:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:32:59,720 INFO L225 Difference]: With dead ends: 49462 [2025-02-05 11:32:59,720 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:32:59,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 1076 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-02-05 11:32:59,740 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 827 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4009 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 4009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:32:59,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 150 Invalid, 4553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 4009 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-02-05 11:32:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:32:59,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:32:59,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:32:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:32:59,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 541 [2025-02-05 11:32:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:32:59,744 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:32:59,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 0 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-05 11:32:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:32:59,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:32:59,747 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:32:59,764 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-05 11:32:59,954 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,SelfDestructingSolverStorable22 [2025-02-05 11:32:59,958 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:32:59,960 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:33:12,539 WARN L286 SmtUtils]: Spent 12.57s on a formula simplification. DAG size of input: 793 DAG size of output: 794 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)