./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label48.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/Problem13_label48.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 c03a342c0e8f0bfba399e237ba210df18813842785480d8c5bf35ca28242fc9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:46:20,154 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:46:20,196 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:46:20,199 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:46:20,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:46:20,214 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:46:20,215 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:46:20,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:46:20,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:46:20,216 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:46:20,216 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:46:20,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:46:20,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:46:20,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:46:20,216 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:46:20,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:46:20,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:46:20,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:46:20,218 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:46:20,218 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:46:20,218 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:46:20,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:46:20,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:46:20,219 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:46:20,219 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:46:20,219 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:46:20,219 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 -> c03a342c0e8f0bfba399e237ba210df18813842785480d8c5bf35ca28242fc9f [2025-02-05 11:46:20,487 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:46:20,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:46:20,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:46:20,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:46:20,502 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:46:20,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label48.c [2025-02-05 11:46:21,663 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17dee05a5/981730a9766a41f28745b701f3bc471d/FLAG2dd0b98bf [2025-02-05 11:46:22,229 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:46:22,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label48.c [2025-02-05 11:46:22,259 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17dee05a5/981730a9766a41f28745b701f3bc471d/FLAG2dd0b98bf [2025-02-05 11:46:22,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/17dee05a5/981730a9766a41f28745b701f3bc471d [2025-02-05 11:46:22,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:46:22,292 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:46:22,293 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:46:22,293 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:46:22,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:46:22,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:46:22" (1/1) ... [2025-02-05 11:46:22,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aba207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:22, skipping insertion in model container [2025-02-05 11:46:22,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:46:22" (1/1) ... [2025-02-05 11:46:22,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:46:22,715 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/Problem13_label48.c[1234,1247] [2025-02-05 11:46:23,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:46:23,518 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:46:23,529 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/Problem13_label48.c[1234,1247] [2025-02-05 11:46:23,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:46:23,952 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:46:23,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23 WrapperNode [2025-02-05 11:46:23,954 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:46:23,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:46:23,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:46:23,955 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:46:23,959 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:46:23" (1/1) ... [2025-02-05 11:46:24,009 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:46:23" (1/1) ... [2025-02-05 11:46:24,342 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:46:24,343 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:46:24,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:46:24,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:46:24,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:46:24,351 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,659 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:46:24,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,770 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,806 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,828 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,873 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:46:24,874 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:46:24,874 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:46:24,874 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:46:24,875 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (1/1) ... [2025-02-05 11:46:24,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:46:24,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:46:24,899 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:46:24,946 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:46:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:46:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:46:24,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:46:24,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:46:25,025 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:46:25,027 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:46:29,831 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:46:29,832 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:46:29,833 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:46:29,962 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:46:29,962 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:46:29,989 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:46:29,989 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:46:29,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:46:29 BoogieIcfgContainer [2025-02-05 11:46:29,990 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:46:29,991 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:46:29,991 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:46:29,996 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:46:29,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:46:22" (1/3) ... [2025-02-05 11:46:29,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e99234a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:46:29, skipping insertion in model container [2025-02-05 11:46:29,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:46:23" (2/3) ... [2025-02-05 11:46:29,997 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e99234a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:46:29, skipping insertion in model container [2025-02-05 11:46:29,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:46:29" (3/3) ... [2025-02-05 11:46:29,999 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label48.c [2025-02-05 11:46:30,010 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:46:30,011 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label48.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:46:30,070 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:46:30,076 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;@7c312e32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:46:30,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:46:30,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 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:46:30,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-05 11:46:30,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:30,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-05 11:46:30,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:30,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:30,088 INFO L85 PathProgramCache]: Analyzing trace with hash 281610526, now seen corresponding path program 1 times [2025-02-05 11:46:30,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:30,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422145918] [2025-02-05 11:46:30,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:30,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:30,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-05 11:46:30,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-05 11:46:30,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:30,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:30,208 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:46:30,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:30,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422145918] [2025-02-05 11:46:30,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422145918] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:30,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:30,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:46:30,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135099325] [2025-02-05 11:46:30,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:30,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:30,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:30,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:30,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:30,228 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:46:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:33,786 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-02-05 11:46:33,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:33,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-05 11:46:33,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:33,814 INFO L225 Difference]: With dead ends: 3035 [2025-02-05 11:46:33,814 INFO L226 Difference]: Without dead ends: 1873 [2025-02-05 11:46:33,821 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:46:33,827 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 899 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:33,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:46:33,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-02-05 11:46:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-02-05 11:46:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 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:46:33,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-02-05 11:46:34,000 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 6 [2025-02-05 11:46:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:34,005 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-02-05 11:46:34,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 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:46:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-02-05 11:46:34,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 11:46:34,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:34,006 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 11:46:34,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:46:34,007 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:34,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:34,007 INFO L85 PathProgramCache]: Analyzing trace with hash 63112979, now seen corresponding path program 1 times [2025-02-05 11:46:34,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:34,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891340758] [2025-02-05 11:46:34,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:34,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:34,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 11:46:34,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 11:46:34,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:34,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:34,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:46:34,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:34,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891340758] [2025-02-05 11:46:34,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891340758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:34,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:34,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:46:34,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662814813] [2025-02-05 11:46:34,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:34,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:34,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:34,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:34,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:34,540 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:46:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:38,009 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2025-02-05 11:46:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:38,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 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 78 [2025-02-05 11:46:38,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:38,032 INFO L225 Difference]: With dead ends: 5317 [2025-02-05 11:46:38,032 INFO L226 Difference]: Without dead ends: 3460 [2025-02-05 11:46:38,038 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:46:38,041 INFO L435 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:38,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:46:38,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2025-02-05 11:46:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2025-02-05 11:46:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 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:46:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2025-02-05 11:46:38,126 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 78 [2025-02-05 11:46:38,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:38,128 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2025-02-05 11:46:38,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:46:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2025-02-05 11:46:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-02-05 11:46:38,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:38,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:38,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:46:38,132 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:38,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1431875237, now seen corresponding path program 1 times [2025-02-05 11:46:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764048726] [2025-02-05 11:46:38,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:38,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-02-05 11:46:38,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-02-05 11:46:38,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:38,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:46:38,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:38,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764048726] [2025-02-05 11:46:38,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764048726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:38,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:38,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:46:38,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69215294] [2025-02-05 11:46:38,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:38,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:38,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:38,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:38,282 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:46:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:41,365 INFO L93 Difference]: Finished difference Result 10097 states and 13940 transitions. [2025-02-05 11:46:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:41,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2025-02-05 11:46:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:41,385 INFO L225 Difference]: With dead ends: 10097 [2025-02-05 11:46:41,386 INFO L226 Difference]: Without dead ends: 6640 [2025-02-05 11:46:41,390 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:46:41,391 INFO L435 NwaCegarLoop]: 771 mSDtfsCounter, 932 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2552 mSolverCounterSat, 763 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 932 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 763 IncrementalHoareTripleChecker+Valid, 2552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:41,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [932 Valid, 904 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [763 Valid, 2552 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-02-05 11:46:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2025-02-05 11:46:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6631. [2025-02-05 11:46:41,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6631 states, 6630 states have (on average 1.2722473604826545) internal successors, (8435), 6630 states have internal predecessors, (8435), 0 states have call successors, (0), 0 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:46:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6631 states to 6631 states and 8435 transitions. [2025-02-05 11:46:41,488 INFO L78 Accepts]: Start accepts. Automaton has 6631 states and 8435 transitions. Word has length 92 [2025-02-05 11:46:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:41,489 INFO L471 AbstractCegarLoop]: Abstraction has 6631 states and 8435 transitions. [2025-02-05 11:46:41,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:46:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 6631 states and 8435 transitions. [2025-02-05 11:46:41,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 11:46:41,492 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:41,492 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:41,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:46:41,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:41,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:41,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1161320725, now seen corresponding path program 1 times [2025-02-05 11:46:41,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:41,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919247713] [2025-02-05 11:46:41,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:41,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:41,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 11:46:41,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 11:46:41,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:41,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:46:41,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:41,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919247713] [2025-02-05 11:46:41,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919247713] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:46:41,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704146805] [2025-02-05 11:46:41,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:41,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:46:41,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:46:41,895 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:46:41,897 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:46:41,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 11:46:41,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 11:46:41,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:41,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:41,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:46:41,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:46:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 11:46:42,109 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:46:42,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704146805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:42,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:46:42,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-02-05 11:46:42,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807371992] [2025-02-05 11:46:42,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:42,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:42,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:42,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:46:42,111 INFO L87 Difference]: Start difference. First operand 6631 states and 8435 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:46:45,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:45,564 INFO L93 Difference]: Finished difference Result 19698 states and 25057 transitions. [2025-02-05 11:46:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:45,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 95 [2025-02-05 11:46:45,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:45,599 INFO L225 Difference]: With dead ends: 19698 [2025-02-05 11:46:45,599 INFO L226 Difference]: Without dead ends: 13069 [2025-02-05 11:46:45,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:46:45,609 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 1053 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 2631 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:45,609 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 920 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2631 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:46:45,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13069 states. [2025-02-05 11:46:45,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13069 to 13052. [2025-02-05 11:46:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.217914336066202) internal successors, (15895), 13051 states have internal predecessors, (15895), 0 states have call successors, (0), 0 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:46:45,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15895 transitions. [2025-02-05 11:46:45,923 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15895 transitions. Word has length 95 [2025-02-05 11:46:45,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:45,924 INFO L471 AbstractCegarLoop]: Abstraction has 13052 states and 15895 transitions. [2025-02-05 11:46:45,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:46:45,924 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15895 transitions. [2025-02-05 11:46:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-05 11:46:45,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:45,932 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:45,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:46:46,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:46:46,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:46,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:46,140 INFO L85 PathProgramCache]: Analyzing trace with hash -748735685, now seen corresponding path program 1 times [2025-02-05 11:46:46,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:46,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041431536] [2025-02-05 11:46:46,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:46,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:46,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-05 11:46:46,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-05 11:46:46,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:46,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 11:46:46,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041431536] [2025-02-05 11:46:46,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041431536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:46,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:46,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:46:46,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835163840] [2025-02-05 11:46:46,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:46,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:46,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:46,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:46,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:46,507 INFO L87 Difference]: Start difference. First operand 13052 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:48,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:48,905 INFO L93 Difference]: Finished difference Result 26889 states and 32590 transitions. [2025-02-05 11:46:48,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:48,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 198 [2025-02-05 11:46:48,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:48,948 INFO L225 Difference]: With dead ends: 26889 [2025-02-05 11:46:48,949 INFO L226 Difference]: Without dead ends: 13839 [2025-02-05 11:46:48,957 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:46:48,959 INFO L435 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:48,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-05 11:46:48,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2025-02-05 11:46:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13839. [2025-02-05 11:46:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 13838 states have (on average 1.2058823529411764) internal successors, (16687), 13838 states have internal predecessors, (16687), 0 states have call successors, (0), 0 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:46:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 16687 transitions. [2025-02-05 11:46:49,242 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 16687 transitions. Word has length 198 [2025-02-05 11:46:49,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:49,242 INFO L471 AbstractCegarLoop]: Abstraction has 13839 states and 16687 transitions. [2025-02-05 11:46:49,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:46:49,246 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 16687 transitions. [2025-02-05 11:46:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-02-05 11:46:49,248 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:49,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:49,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:46:49,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:49,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:49,252 INFO L85 PathProgramCache]: Analyzing trace with hash 368862527, now seen corresponding path program 1 times [2025-02-05 11:46:49,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:49,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921127422] [2025-02-05 11:46:49,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:49,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:49,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-02-05 11:46:49,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-02-05 11:46:49,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:49,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:49,514 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:46:49,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:49,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921127422] [2025-02-05 11:46:49,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921127422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:49,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:49,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:46:49,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137746214] [2025-02-05 11:46:49,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:49,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:49,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:49,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:49,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:49,519 INFO L87 Difference]: Start difference. First operand 13839 states and 16687 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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:46:52,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:52,624 INFO L93 Difference]: Finished difference Result 33200 states and 41058 transitions. [2025-02-05 11:46:52,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:52,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 205 [2025-02-05 11:46:52,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:52,695 INFO L225 Difference]: With dead ends: 33200 [2025-02-05 11:46:52,695 INFO L226 Difference]: Without dead ends: 20150 [2025-02-05 11:46:52,718 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:46:52,721 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 861 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:52,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 940 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:46:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2025-02-05 11:46:53,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 20140. [2025-02-05 11:46:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 20139 states have (on average 1.1898803316947217) internal successors, (23963), 20139 states have internal predecessors, (23963), 0 states have call successors, (0), 0 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:46:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 23963 transitions. [2025-02-05 11:46:53,158 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 23963 transitions. Word has length 205 [2025-02-05 11:46:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:53,176 INFO L471 AbstractCegarLoop]: Abstraction has 20140 states and 23963 transitions. [2025-02-05 11:46:53,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 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:46:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 23963 transitions. [2025-02-05 11:46:53,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-02-05 11:46:53,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:53,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:53,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:46:53,179 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:53,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:53,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1767485569, now seen corresponding path program 1 times [2025-02-05 11:46:53,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:53,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026209275] [2025-02-05 11:46:53,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:53,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-02-05 11:46:53,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-02-05 11:46:53,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:53,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:53,351 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:46:53,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026209275] [2025-02-05 11:46:53,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026209275] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:53,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:46:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291579805] [2025-02-05 11:46:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:53,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:46:53,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:53,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:46:53,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:46:53,353 INFO L87 Difference]: Start difference. First operand 20140 states and 23963 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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:46:56,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:46:56,056 INFO L93 Difference]: Finished difference Result 39361 states and 46953 transitions. [2025-02-05 11:46:56,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:46:56,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 220 [2025-02-05 11:46:56,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:46:56,084 INFO L225 Difference]: With dead ends: 39361 [2025-02-05 11:46:56,085 INFO L226 Difference]: Without dead ends: 20010 [2025-02-05 11:46:56,096 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:46:56,097 INFO L435 NwaCegarLoop]: 1511 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:46:56,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1648 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-02-05 11:46:56,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2025-02-05 11:46:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 19220. [2025-02-05 11:46:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19220 states, 19219 states have (on average 1.1321608824600655) internal successors, (21759), 19219 states have internal predecessors, (21759), 0 states have call successors, (0), 0 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:46:56,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19220 states to 19220 states and 21759 transitions. [2025-02-05 11:46:56,266 INFO L78 Accepts]: Start accepts. Automaton has 19220 states and 21759 transitions. Word has length 220 [2025-02-05 11:46:56,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:46:56,267 INFO L471 AbstractCegarLoop]: Abstraction has 19220 states and 21759 transitions. [2025-02-05 11:46:56,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 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:46:56,267 INFO L276 IsEmpty]: Start isEmpty. Operand 19220 states and 21759 transitions. [2025-02-05 11:46:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-02-05 11:46:56,273 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:46:56,273 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:46:56,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:46:56,273 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:46:56,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:46:56,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1659823190, now seen corresponding path program 1 times [2025-02-05 11:46:56,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:46:56,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584952075] [2025-02-05 11:46:56,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:46:56,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:46:56,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-05 11:46:56,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-05 11:46:56,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:46:56,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:46:56,528 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 11:46:56,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:46:56,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584952075] [2025-02-05 11:46:56,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584952075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:46:56,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:46:56,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:46:56,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35375552] [2025-02-05 11:46:56,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:46:56,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:46:56,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:46:56,530 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:46:56,530 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:46:56,531 INFO L87 Difference]: Start difference. First operand 19220 states and 21759 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:47:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:02,739 INFO L93 Difference]: Finished difference Result 70905 states and 80401 transitions. [2025-02-05 11:47:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:47:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 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 294 [2025-02-05 11:47:02,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:02,800 INFO L225 Difference]: With dead ends: 70905 [2025-02-05 11:47:02,800 INFO L226 Difference]: Without dead ends: 52474 [2025-02-05 11:47:02,814 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:47:02,815 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 1715 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 6004 mSolverCounterSat, 1099 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1715 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 7103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1099 IncrementalHoareTripleChecker+Valid, 6004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:02,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1715 Valid, 770 Invalid, 7103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1099 Valid, 6004 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2025-02-05 11:47:02,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52474 states. [2025-02-05 11:47:03,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52474 to 50783. [2025-02-05 11:47:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50783 states, 50782 states have (on average 1.1163010515537002) internal successors, (56688), 50782 states have internal predecessors, (56688), 0 states have call successors, (0), 0 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:47:03,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50783 states to 50783 states and 56688 transitions. [2025-02-05 11:47:03,517 INFO L78 Accepts]: Start accepts. Automaton has 50783 states and 56688 transitions. Word has length 294 [2025-02-05 11:47:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:03,518 INFO L471 AbstractCegarLoop]: Abstraction has 50783 states and 56688 transitions. [2025-02-05 11:47:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 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:47:03,518 INFO L276 IsEmpty]: Start isEmpty. Operand 50783 states and 56688 transitions. [2025-02-05 11:47:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2025-02-05 11:47:03,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:03,522 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:03,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:47:03,522 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:03,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:03,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1955689058, now seen corresponding path program 1 times [2025-02-05 11:47:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:03,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614128537] [2025-02-05 11:47:03,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:03,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:03,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-02-05 11:47:03,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-02-05 11:47:03,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:03,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 11:47:03,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:03,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614128537] [2025-02-05 11:47:03,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614128537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:03,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317888139] [2025-02-05 11:47:03,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:03,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:03,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:03,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:03,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:03,761 INFO L87 Difference]: Start difference. First operand 50783 states and 56688 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:07,215 INFO L93 Difference]: Finished difference Result 102383 states and 114215 transitions. [2025-02-05 11:47:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:07,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 303 [2025-02-05 11:47:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:07,290 INFO L225 Difference]: With dead ends: 102383 [2025-02-05 11:47:07,290 INFO L226 Difference]: Without dead ends: 50810 [2025-02-05 11:47:07,312 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:47:07,312 INFO L435 NwaCegarLoop]: 1842 mSDtfsCounter, 746 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 1982 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:07,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 1982 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:47:07,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50810 states. [2025-02-05 11:47:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50810 to 49990. [2025-02-05 11:47:08,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49990 states, 49989 states have (on average 1.1048430654744044) internal successors, (55230), 49989 states have internal predecessors, (55230), 0 states have call successors, (0), 0 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:47:08,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49990 states to 49990 states and 55230 transitions. [2025-02-05 11:47:08,251 INFO L78 Accepts]: Start accepts. Automaton has 49990 states and 55230 transitions. Word has length 303 [2025-02-05 11:47:08,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:08,251 INFO L471 AbstractCegarLoop]: Abstraction has 49990 states and 55230 transitions. [2025-02-05 11:47:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:47:08,252 INFO L276 IsEmpty]: Start isEmpty. Operand 49990 states and 55230 transitions. [2025-02-05 11:47:08,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-02-05 11:47:08,259 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:08,259 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:08,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:47:08,260 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:08,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1666027037, now seen corresponding path program 1 times [2025-02-05 11:47:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:08,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840130613] [2025-02-05 11:47:08,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:08,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:08,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 11:47:08,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 11:47:08,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:08,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 179 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 11:47:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840130613] [2025-02-05 11:47:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840130613] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:47:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594549715] [2025-02-05 11:47:09,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:09,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:09,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:47:09,349 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:47:09,351 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:47:09,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes. [2025-02-05 11:47:09,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements. [2025-02-05 11:47:09,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:09,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:09,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:47:09,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:47:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 293 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-05 11:47:09,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:47:09,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594549715] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:09,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:47:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:47:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240717736] [2025-02-05 11:47:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:09,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:09,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:09,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:47:09,552 INFO L87 Difference]: Start difference. First operand 49990 states and 55230 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:47:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:12,605 INFO L93 Difference]: Finished difference Result 99189 states and 109665 transitions. [2025-02-05 11:47:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:12,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 332 [2025-02-05 11:47:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:12,674 INFO L225 Difference]: With dead ends: 99189 [2025-02-05 11:47:12,674 INFO L226 Difference]: Without dead ends: 49988 [2025-02-05 11:47:12,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:47:12,709 INFO L435 NwaCegarLoop]: 1343 mSDtfsCounter, 1113 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 2451 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 2895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:12,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 1422 Invalid, 2895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2451 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:47:12,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49988 states. [2025-02-05 11:47:13,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49988 to 49987. [2025-02-05 11:47:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49987 states, 49986 states have (on average 1.0828031848917696) internal successors, (54125), 49986 states have internal predecessors, (54125), 0 states have call successors, (0), 0 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:47:13,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49987 states to 49987 states and 54125 transitions. [2025-02-05 11:47:13,595 INFO L78 Accepts]: Start accepts. Automaton has 49987 states and 54125 transitions. Word has length 332 [2025-02-05 11:47:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 49987 states and 54125 transitions. [2025-02-05 11:47:13,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:47:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 49987 states and 54125 transitions. [2025-02-05 11:47:13,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-02-05 11:47:13,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:13,609 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:13,623 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:47:13,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:13,813 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:13,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:13,814 INFO L85 PathProgramCache]: Analyzing trace with hash -107574645, now seen corresponding path program 1 times [2025-02-05 11:47:13,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353100074] [2025-02-05 11:47:13,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:13,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-02-05 11:47:13,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-02-05 11:47:13,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:13,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:14,023 INFO L134 CoverageAnalysis]: Checked inductivity of 505 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 11:47:14,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:14,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353100074] [2025-02-05 11:47:14,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353100074] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:14,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:14,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:14,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974006930] [2025-02-05 11:47:14,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:14,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:14,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:14,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:14,026 INFO L87 Difference]: Start difference. First operand 49987 states and 54125 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:47:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:17,491 INFO L93 Difference]: Finished difference Result 116511 states and 127325 transitions. [2025-02-05 11:47:17,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:17,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 362 [2025-02-05 11:47:17,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:17,581 INFO L225 Difference]: With dead ends: 116511 [2025-02-05 11:47:17,581 INFO L226 Difference]: Without dead ends: 67313 [2025-02-05 11:47:17,612 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:47:17,614 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 892 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 926 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 3337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 926 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:17,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 875 Invalid, 3337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [926 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:47:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67313 states. [2025-02-05 11:47:18,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67313 to 64937. [2025-02-05 11:47:18,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64937 states, 64936 states have (on average 1.0897961069360602) internal successors, (70767), 64936 states have internal predecessors, (70767), 0 states have call successors, (0), 0 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:47:18,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64937 states to 64937 states and 70767 transitions. [2025-02-05 11:47:18,270 INFO L78 Accepts]: Start accepts. Automaton has 64937 states and 70767 transitions. Word has length 362 [2025-02-05 11:47:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:18,271 INFO L471 AbstractCegarLoop]: Abstraction has 64937 states and 70767 transitions. [2025-02-05 11:47:18,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 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:47:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 64937 states and 70767 transitions. [2025-02-05 11:47:18,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-02-05 11:47:18,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:18,276 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:18,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:47:18,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:18,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:18,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1596900709, now seen corresponding path program 1 times [2025-02-05 11:47:18,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:18,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344914923] [2025-02-05 11:47:18,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:18,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:18,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-02-05 11:47:18,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-02-05 11:47:18,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:18,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:18,595 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2025-02-05 11:47:18,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:18,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344914923] [2025-02-05 11:47:18,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344914923] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:18,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:18,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:18,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264444798] [2025-02-05 11:47:18,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:18,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:18,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:18,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:18,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:18,597 INFO L87 Difference]: Start difference. First operand 64937 states and 70767 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:47:22,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:22,725 INFO L93 Difference]: Finished difference Result 151207 states and 165228 transitions. [2025-02-05 11:47:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:22,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 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 395 [2025-02-05 11:47:22,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:22,827 INFO L225 Difference]: With dead ends: 151207 [2025-02-05 11:47:22,828 INFO L226 Difference]: Without dead ends: 87059 [2025-02-05 11:47:22,851 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:47:22,853 INFO L435 NwaCegarLoop]: 1663 mSDtfsCounter, 884 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 491 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 3539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 491 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:22,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1797 Invalid, 3539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [491 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-02-05 11:47:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87059 states. [2025-02-05 11:47:23,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87059 to 86228. [2025-02-05 11:47:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86228 states, 86227 states have (on average 1.0831642061071358) internal successors, (93398), 86227 states have internal predecessors, (93398), 0 states have call successors, (0), 0 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:47:23,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86228 states to 86228 states and 93398 transitions. [2025-02-05 11:47:23,772 INFO L78 Accepts]: Start accepts. Automaton has 86228 states and 93398 transitions. Word has length 395 [2025-02-05 11:47:23,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:23,773 INFO L471 AbstractCegarLoop]: Abstraction has 86228 states and 93398 transitions. [2025-02-05 11:47:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 3 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:47:23,774 INFO L276 IsEmpty]: Start isEmpty. Operand 86228 states and 93398 transitions. [2025-02-05 11:47:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2025-02-05 11:47:23,778 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:23,778 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:47:23,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:47:23,778 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:23,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1164145981, now seen corresponding path program 1 times [2025-02-05 11:47:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:23,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048164445] [2025-02-05 11:47:23,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:23,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:23,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-02-05 11:47:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-02-05 11:47:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:47:24,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:24,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048164445] [2025-02-05 11:47:24,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048164445] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:24,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:24,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:24,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312087692] [2025-02-05 11:47:24,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:24,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:24,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:24,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:24,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:47:24,101 INFO L87 Difference]: Start difference. First operand 86228 states and 93398 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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:47:27,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:27,969 INFO L93 Difference]: Finished difference Result 192935 states and 210162 transitions. [2025-02-05 11:47:27,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:27,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 400 [2025-02-05 11:47:27,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:28,080 INFO L225 Difference]: With dead ends: 192935 [2025-02-05 11:47:28,081 INFO L226 Difference]: Without dead ends: 105135 [2025-02-05 11:47:28,128 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:47:28,129 INFO L435 NwaCegarLoop]: 1735 mSDtfsCounter, 786 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 2517 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 3228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:28,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 1878 Invalid, 3228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2517 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-05 11:47:28,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105135 states. [2025-02-05 11:47:29,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105135 to 105114. [2025-02-05 11:47:29,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105114 states, 105113 states have (on average 1.071484973314433) internal successors, (112627), 105113 states have internal predecessors, (112627), 0 states have call successors, (0), 0 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:47:29,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105114 states to 105114 states and 112627 transitions. [2025-02-05 11:47:29,441 INFO L78 Accepts]: Start accepts. Automaton has 105114 states and 112627 transitions. Word has length 400 [2025-02-05 11:47:29,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:29,441 INFO L471 AbstractCegarLoop]: Abstraction has 105114 states and 112627 transitions. [2025-02-05 11:47:29,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 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:47:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 105114 states and 112627 transitions. [2025-02-05 11:47:29,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2025-02-05 11:47:29,449 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:29,450 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:29,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:47:29,450 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:29,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -840540888, now seen corresponding path program 1 times [2025-02-05 11:47:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009734672] [2025-02-05 11:47:29,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:29,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-05 11:47:29,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-05 11:47:29,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:29,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:30,189 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-02-05 11:47:30,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:30,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009734672] [2025-02-05 11:47:30,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009734672] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:30,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:47:30,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:47:30,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892747700] [2025-02-05 11:47:30,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:30,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:47:30,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:30,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:47:30,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:47:30,193 INFO L87 Difference]: Start difference. First operand 105114 states and 112627 transitions. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:47:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:36,257 INFO L93 Difference]: Finished difference Result 301585 states and 325193 transitions. [2025-02-05 11:47:36,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:47:36,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 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 410 [2025-02-05 11:47:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:36,517 INFO L225 Difference]: With dead ends: 301585 [2025-02-05 11:47:36,517 INFO L226 Difference]: Without dead ends: 197260 [2025-02-05 11:47:36,562 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:47:36,562 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1512 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 5282 mSolverCounterSat, 827 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 6109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 827 IncrementalHoareTripleChecker+Valid, 5282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:36,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 900 Invalid, 6109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [827 Valid, 5282 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-05 11:47:36,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197260 states. [2025-02-05 11:47:38,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197260 to 194088. [2025-02-05 11:47:38,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194088 states, 194087 states have (on average 1.0675367232220603) internal successors, (207195), 194087 states have internal predecessors, (207195), 0 states have call successors, (0), 0 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:47:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194088 states to 194088 states and 207195 transitions. [2025-02-05 11:47:38,658 INFO L78 Accepts]: Start accepts. Automaton has 194088 states and 207195 transitions. Word has length 410 [2025-02-05 11:47:38,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:38,659 INFO L471 AbstractCegarLoop]: Abstraction has 194088 states and 207195 transitions. [2025-02-05 11:47:38,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 3 states have internal predecessors, (316), 0 states have call successors, (0), 0 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:47:38,659 INFO L276 IsEmpty]: Start isEmpty. Operand 194088 states and 207195 transitions. [2025-02-05 11:47:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-02-05 11:47:38,663 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:38,664 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:38,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:47:38,664 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:38,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1897557728, now seen corresponding path program 1 times [2025-02-05 11:47:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186169506] [2025-02-05 11:47:38,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:38,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-02-05 11:47:38,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-02-05 11:47:38,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:38,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:40,034 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 245 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 11:47:40,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186169506] [2025-02-05 11:47:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186169506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:47:40,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288619599] [2025-02-05 11:47:40,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:40,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:47:40,037 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:47:40,039 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:47:40,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-02-05 11:47:40,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-02-05 11:47:40,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:40,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:40,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:47:40,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:47:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-02-05 11:47:40,198 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:47:40,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288619599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:40,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:47:40,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:47:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741106797] [2025-02-05 11:47:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:40,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:40,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:40,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:47:40,200 INFO L87 Difference]: Start difference. First operand 194088 states and 207195 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:47:44,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:47:44,388 INFO L93 Difference]: Finished difference Result 399957 states and 427399 transitions. [2025-02-05 11:47:44,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:47:44,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 422 [2025-02-05 11:47:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:47:44,631 INFO L225 Difference]: With dead ends: 399957 [2025-02-05 11:47:44,632 INFO L226 Difference]: Without dead ends: 218461 [2025-02-05 11:47:44,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:47:44,687 INFO L435 NwaCegarLoop]: 1576 mSDtfsCounter, 945 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 2573 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 2573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:47:44,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 1690 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 2573 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:47:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218461 states. [2025-02-05 11:47:46,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218461 to 206648. [2025-02-05 11:47:46,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206648 states, 206647 states have (on average 1.0626091837771658) internal successors, (219585), 206647 states have internal predecessors, (219585), 0 states have call successors, (0), 0 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:47:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206648 states to 206648 states and 219585 transitions. [2025-02-05 11:47:46,936 INFO L78 Accepts]: Start accepts. Automaton has 206648 states and 219585 transitions. Word has length 422 [2025-02-05 11:47:46,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:47:46,936 INFO L471 AbstractCegarLoop]: Abstraction has 206648 states and 219585 transitions. [2025-02-05 11:47:46,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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:47:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 206648 states and 219585 transitions. [2025-02-05 11:47:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 11:47:46,948 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:47:46,949 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:46,956 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:47:47,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:47,154 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:47:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:47:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1268618045, now seen corresponding path program 1 times [2025-02-05 11:47:47,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:47:47,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220305063] [2025-02-05 11:47:47,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:47,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:47:47,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 11:47:47,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 11:47:47,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:47,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:48,995 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 245 proven. 113 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 11:47:48,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:47:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220305063] [2025-02-05 11:47:48,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220305063] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:47:48,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223679760] [2025-02-05 11:47:48,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:47:48,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:47:48,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:47:48,997 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:47:48,999 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:47:49,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 11:47:49,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 11:47:49,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:47:49,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:47:49,149 INFO L256 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:47:49,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:47:49,184 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-02-05 11:47:49,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:47:49,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223679760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:47:49,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:47:49,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-02-05 11:47:49,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576255805] [2025-02-05 11:47:49,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:47:49,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:47:49,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:47:49,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:47:49,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 11:47:49,185 INFO L87 Difference]: Start difference. First operand 206648 states and 219585 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)