./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/Problem15_label07.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 496f4b0b7816aa03b8a4c1153581ca52fffcd239004f8a1c536179ce4f046e04 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:00:14,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:00:14,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:00:14,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:00:14,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:00:14,859 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:00:14,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:00:14,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:00:14,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:00:14,861 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:00:14,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:00:14,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:00:14,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:00:14,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:00:14,861 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:00:14,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:00:14,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:00:14,862 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:00:14,862 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:00:14,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:00:14,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:00:14,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:00:14,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:00:14,863 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:00:14,863 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:14,864 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:00:14,864 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:00:14,864 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:00:14,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:00:14,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:14,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:00:14,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:00:14,864 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:00:14,864 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:00:14,865 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:00:14,865 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:00:14,865 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:00:14,865 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:00:14,865 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:00:14,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:00:14,865 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 -> 496f4b0b7816aa03b8a4c1153581ca52fffcd239004f8a1c536179ce4f046e04 [2025-01-09 00:00:15,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:00:15,165 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:00:15,168 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:00:15,169 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:00:15,169 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:00:15,170 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label07.c [2025-01-09 00:00:16,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b290a40f/e34d6013712f49c99b0548d7ef86ebfc/FLAG5f667f387 [2025-01-09 00:00:17,010 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:00:17,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label07.c [2025-01-09 00:00:17,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b290a40f/e34d6013712f49c99b0548d7ef86ebfc/FLAG5f667f387 [2025-01-09 00:00:17,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5b290a40f/e34d6013712f49c99b0548d7ef86ebfc [2025-01-09 00:00:17,110 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:00:17,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:00:17,113 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:00:17,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:00:17,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:00:17,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:17,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5746c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17, skipping insertion in model container [2025-01-09 00:00:17,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:17,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:00:17,343 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/Problem15_label07.c[1469,1482] [2025-01-09 00:00:17,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:00:17,670 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:00:17,685 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/Problem15_label07.c[1469,1482] [2025-01-09 00:00:17,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:00:17,881 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:00:17,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17 WrapperNode [2025-01-09 00:00:17,882 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:00:17,884 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:00:17,884 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:00:17,884 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:00:17,892 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:17,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,160 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:00:18,161 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:00:18,162 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:00:18,162 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:00:18,162 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:00:18,168 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,328 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-01-09 00:00:18,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,408 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,446 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:00:18,520 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:00:18,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:00:18,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:00:18,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (1/1) ... [2025-01-09 00:00:18,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:00:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:18,553 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-01-09 00:00:18,559 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-01-09 00:00:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:00:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:00:18,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:00:18,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:00:18,637 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:00:18,639 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:00:20,780 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:00:20,781 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:00:20,807 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:00:20,807 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:00:20,808 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:00:20 BoogieIcfgContainer [2025-01-09 00:00:20,808 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:00:20,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:00:20,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:00:20,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:00:20,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:00:17" (1/3) ... [2025-01-09 00:00:20,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad7fd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:00:20, skipping insertion in model container [2025-01-09 00:00:20,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:00:17" (2/3) ... [2025-01-09 00:00:20,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ad7fd9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:00:20, skipping insertion in model container [2025-01-09 00:00:20,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:00:20" (3/3) ... [2025-01-09 00:00:20,819 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label07.c [2025-01-09 00:00:20,832 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:00:20,834 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label07.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:00:20,915 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:00:20,922 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;@7d046e50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:00:20,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:00:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:20,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 00:00:20,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:20,930 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:20,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:20,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:20,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1831935974, now seen corresponding path program 1 times [2025-01-09 00:00:20,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:20,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623909801] [2025-01-09 00:00:20,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:20,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:20,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 00:00:20,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 00:00:20,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:20,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:21,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:21,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:21,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623909801] [2025-01-09 00:00:21,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623909801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:21,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:21,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:21,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938297848] [2025-01-09 00:00:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:21,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:21,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:21,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:21,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:21,075 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:23,075 INFO L93 Difference]: Finished difference Result 1197 states and 2160 transitions. [2025-01-09 00:00:23,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:23,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-01-09 00:00:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:23,088 INFO L225 Difference]: With dead ends: 1197 [2025-01-09 00:00:23,088 INFO L226 Difference]: Without dead ends: 694 [2025-01-09 00:00:23,091 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-01-09 00:00:23,093 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 408 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:23,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 114 Invalid, 1394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 00:00:23,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-01-09 00:00:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 684. [2025-01-09 00:00:23,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 683 states have (on average 1.718887262079063) internal successors, (1174), 683 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 1174 transitions. [2025-01-09 00:00:23,165 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 1174 transitions. Word has length 10 [2025-01-09 00:00:23,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:23,166 INFO L471 AbstractCegarLoop]: Abstraction has 684 states and 1174 transitions. [2025-01-09 00:00:23,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 1174 transitions. [2025-01-09 00:00:23,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 00:00:23,167 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:23,168 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:00:23,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:00:23,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:23,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:23,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1052396272, now seen corresponding path program 1 times [2025-01-09 00:00:23,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:23,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631585066] [2025-01-09 00:00:23,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:23,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:23,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 00:00:23,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 00:00:23,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:23,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:23,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:23,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631585066] [2025-01-09 00:00:23,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631585066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880932233] [2025-01-09 00:00:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:23,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:23,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:23,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:23,645 INFO L87 Difference]: Start difference. First operand 684 states and 1174 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:24,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:24,854 INFO L93 Difference]: Finished difference Result 1681 states and 2896 transitions. [2025-01-09 00:00:24,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:24,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 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 75 [2025-01-09 00:00:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:24,859 INFO L225 Difference]: With dead ends: 1681 [2025-01-09 00:00:24,859 INFO L226 Difference]: Without dead ends: 999 [2025-01-09 00:00:24,860 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-01-09 00:00:24,861 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 254 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:24,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 226 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:00:24,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2025-01-09 00:00:24,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 989. [2025-01-09 00:00:24,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 988 states have (on average 1.6194331983805668) internal successors, (1600), 988 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:24,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1600 transitions. [2025-01-09 00:00:24,888 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1600 transitions. Word has length 75 [2025-01-09 00:00:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:24,888 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1600 transitions. [2025-01-09 00:00:24,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 2 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:24,889 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1600 transitions. [2025-01-09 00:00:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-01-09 00:00:24,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:24,890 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 00:00:24,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:00:24,890 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:24,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:24,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1289157070, now seen corresponding path program 1 times [2025-01-09 00:00:24,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:24,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533973925] [2025-01-09 00:00:24,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:24,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:24,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 00:00:24,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 00:00:24,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:24,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:25,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:25,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533973925] [2025-01-09 00:00:25,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533973925] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:25,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:25,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:25,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749963564] [2025-01-09 00:00:25,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:25,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:25,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:25,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:25,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:25,015 INFO L87 Difference]: Start difference. First operand 989 states and 1600 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:26,319 INFO L93 Difference]: Finished difference Result 2574 states and 4255 transitions. [2025-01-09 00:00:26,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:26,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2025-01-09 00:00:26,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:26,324 INFO L225 Difference]: With dead ends: 2574 [2025-01-09 00:00:26,325 INFO L226 Difference]: Without dead ends: 1587 [2025-01-09 00:00:26,326 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-01-09 00:00:26,327 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 249 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 938 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:26,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 347 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:00:26,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1587 states. [2025-01-09 00:00:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1587 to 1585. [2025-01-09 00:00:26,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1584 states have (on average 1.3977272727272727) internal successors, (2214), 1584 states have internal predecessors, (2214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:26,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2214 transitions. [2025-01-09 00:00:26,355 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2214 transitions. Word has length 76 [2025-01-09 00:00:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:26,355 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2214 transitions. [2025-01-09 00:00:26,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 2 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2214 transitions. [2025-01-09 00:00:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 00:00:26,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:26,357 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:26,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:00:26,357 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:26,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:26,358 INFO L85 PathProgramCache]: Analyzing trace with hash 569065092, now seen corresponding path program 1 times [2025-01-09 00:00:26,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:26,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697396713] [2025-01-09 00:00:26,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:26,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:26,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 00:00:26,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 00:00:26,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:26,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:26,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697396713] [2025-01-09 00:00:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697396713] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:26,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:26,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:00:26,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105463629] [2025-01-09 00:00:26,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:26,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:00:26,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:26,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:00:26,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:26,567 INFO L87 Difference]: Start difference. First operand 1585 states and 2214 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:28,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:28,237 INFO L93 Difference]: Finished difference Result 3782 states and 5523 transitions. [2025-01-09 00:00:28,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:28,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2025-01-09 00:00:28,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:28,245 INFO L225 Difference]: With dead ends: 3782 [2025-01-09 00:00:28,246 INFO L226 Difference]: Without dead ends: 2498 [2025-01-09 00:00:28,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:28,248 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 356 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1695 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 2136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:28,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 373 Invalid, 2136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1695 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:00:28,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2025-01-09 00:00:28,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2185. [2025-01-09 00:00:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2185 states, 2184 states have (on average 1.3296703296703296) internal successors, (2904), 2184 states have internal predecessors, (2904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 2904 transitions. [2025-01-09 00:00:28,291 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 2904 transitions. Word has length 80 [2025-01-09 00:00:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:28,291 INFO L471 AbstractCegarLoop]: Abstraction has 2185 states and 2904 transitions. [2025-01-09 00:00:28,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2904 transitions. [2025-01-09 00:00:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 00:00:28,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:28,294 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:00:28,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:00:28,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:28,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash -545778017, now seen corresponding path program 1 times [2025-01-09 00:00:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:28,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049826853] [2025-01-09 00:00:28,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:28,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:28,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 00:00:28,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 00:00:28,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:28,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:28,480 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-01-09 00:00:28,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:28,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049826853] [2025-01-09 00:00:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049826853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:28,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:28,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684349719] [2025-01-09 00:00:28,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:28,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:28,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:28,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:28,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:28,482 INFO L87 Difference]: Start difference. First operand 2185 states and 2904 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:29,702 INFO L93 Difference]: Finished difference Result 6170 states and 8284 transitions. [2025-01-09 00:00:29,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:29,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 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 180 [2025-01-09 00:00:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:29,713 INFO L225 Difference]: With dead ends: 6170 [2025-01-09 00:00:29,713 INFO L226 Difference]: Without dead ends: 3987 [2025-01-09 00:00:29,714 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-01-09 00:00:29,716 INFO L435 NwaCegarLoop]: 272 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:29,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 339 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:00:29,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3987 states. [2025-01-09 00:00:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3987 to 3684. [2025-01-09 00:00:29,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3684 states, 3683 states have (on average 1.25821341297855) internal successors, (4634), 3683 states have internal predecessors, (4634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3684 states to 3684 states and 4634 transitions. [2025-01-09 00:00:29,766 INFO L78 Accepts]: Start accepts. Automaton has 3684 states and 4634 transitions. Word has length 180 [2025-01-09 00:00:29,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:29,767 INFO L471 AbstractCegarLoop]: Abstraction has 3684 states and 4634 transitions. [2025-01-09 00:00:29,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3684 states and 4634 transitions. [2025-01-09 00:00:29,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2025-01-09 00:00:29,772 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:29,772 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:00:29,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:00:29,773 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:29,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:29,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1803209950, now seen corresponding path program 1 times [2025-01-09 00:00:29,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:29,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056634397] [2025-01-09 00:00:29,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:29,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:29,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 00:00:29,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 00:00:29,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:29,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:30,320 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 00:00:30,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:30,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056634397] [2025-01-09 00:00:30,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056634397] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:30,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:30,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:00:30,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57218357] [2025-01-09 00:00:30,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:30,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:30,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:30,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:30,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:30,322 INFO L87 Difference]: Start difference. First operand 3684 states and 4634 transitions. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:31,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:31,454 INFO L93 Difference]: Finished difference Result 7665 states and 9577 transitions. [2025-01-09 00:00:31,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:31,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 328 [2025-01-09 00:00:31,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:31,465 INFO L225 Difference]: With dead ends: 7665 [2025-01-09 00:00:31,465 INFO L226 Difference]: Without dead ends: 3983 [2025-01-09 00:00:31,470 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-01-09 00:00:31,471 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 105 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:31,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:00:31,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2025-01-09 00:00:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3983. [2025-01-09 00:00:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3982 states have (on average 1.2403314917127073) internal successors, (4939), 3982 states have internal predecessors, (4939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:31,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 4939 transitions. [2025-01-09 00:00:31,631 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 4939 transitions. Word has length 328 [2025-01-09 00:00:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:31,632 INFO L471 AbstractCegarLoop]: Abstraction has 3983 states and 4939 transitions. [2025-01-09 00:00:31,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 2 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:31,632 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 4939 transitions. [2025-01-09 00:00:31,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-01-09 00:00:31,640 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:31,640 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:00:31,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:00:31,640 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:31,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash -124297309, now seen corresponding path program 1 times [2025-01-09 00:00:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874642261] [2025-01-09 00:00:31,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:31,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:31,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-09 00:00:31,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-09 00:00:31,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:31,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:32,090 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:00:32,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:32,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874642261] [2025-01-09 00:00:32,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874642261] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:32,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:32,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:32,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020750177] [2025-01-09 00:00:32,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:32,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:32,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:32,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:32,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:32,092 INFO L87 Difference]: Start difference. First operand 3983 states and 4939 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:33,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:33,789 INFO L93 Difference]: Finished difference Result 8861 states and 11333 transitions. [2025-01-09 00:00:33,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:33,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 371 [2025-01-09 00:00:33,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:33,806 INFO L225 Difference]: With dead ends: 8861 [2025-01-09 00:00:33,806 INFO L226 Difference]: Without dead ends: 5179 [2025-01-09 00:00:33,811 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-01-09 00:00:33,812 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 304 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:33,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 323 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:00:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2025-01-09 00:00:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 3381. [2025-01-09 00:00:33,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.26301775147929) internal successors, (4269), 3380 states have internal predecessors, (4269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:33,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4269 transitions. [2025-01-09 00:00:33,870 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4269 transitions. Word has length 371 [2025-01-09 00:00:33,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:33,871 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4269 transitions. [2025-01-09 00:00:33,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4269 transitions. [2025-01-09 00:00:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2025-01-09 00:00:33,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:33,874 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:00:33,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:00:33,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:33,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:33,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2105994866, now seen corresponding path program 1 times [2025-01-09 00:00:33,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:33,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408139084] [2025-01-09 00:00:33,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:33,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:33,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes. [2025-01-09 00:00:33,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements. [2025-01-09 00:00:33,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:33,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:34,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:34,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408139084] [2025-01-09 00:00:34,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408139084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:34,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:34,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:00:34,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23789756] [2025-01-09 00:00:34,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:34,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:00:34,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:34,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:00:34,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:34,367 INFO L87 Difference]: Start difference. First operand 3381 states and 4269 transitions. Second operand has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:36,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:36,287 INFO L93 Difference]: Finished difference Result 8286 states and 10735 transitions. [2025-01-09 00:00:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:00:36,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 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 375 [2025-01-09 00:00:36,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:36,312 INFO L225 Difference]: With dead ends: 8286 [2025-01-09 00:00:36,316 INFO L226 Difference]: Without dead ends: 5206 [2025-01-09 00:00:36,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:00:36,319 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 350 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 1878 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 2301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 1878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:36,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 719 Invalid, 2301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 1878 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:00:36,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5206 states. [2025-01-09 00:00:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5206 to 4880. [2025-01-09 00:00:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4880 states, 4879 states have (on average 1.2059848329575733) internal successors, (5884), 4879 states have internal predecessors, (5884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:36,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4880 states to 4880 states and 5884 transitions. [2025-01-09 00:00:36,469 INFO L78 Accepts]: Start accepts. Automaton has 4880 states and 5884 transitions. Word has length 375 [2025-01-09 00:00:36,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:36,470 INFO L471 AbstractCegarLoop]: Abstraction has 4880 states and 5884 transitions. [2025-01-09 00:00:36,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.0) internal successors, (375), 5 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:36,470 INFO L276 IsEmpty]: Start isEmpty. Operand 4880 states and 5884 transitions. [2025-01-09 00:00:36,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2025-01-09 00:00:36,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:36,484 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:00:36,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:00:36,484 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:36,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1034122032, now seen corresponding path program 1 times [2025-01-09 00:00:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869221173] [2025-01-09 00:00:36,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:36,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 00:00:36,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 00:00:36,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:36,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 8 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:37,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869221173] [2025-01-09 00:00:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869221173] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1809256693] [2025-01-09 00:00:37,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:37,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:37,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:37,312 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-01-09 00:00:37,316 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-01-09 00:00:37,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 387 statements into 1 equivalence classes. [2025-01-09 00:00:37,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 387 of 387 statements. [2025-01-09 00:00:37,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:37,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:37,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:00:37,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:37,887 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 113 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:37,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:00:38,335 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 113 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:00:38,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1809256693] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:00:38,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:00:38,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-09 00:00:38,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537954277] [2025-01-09 00:00:38,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:00:38,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:00:38,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:38,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:00:38,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:00:38,396 INFO L87 Difference]: Start difference. First operand 4880 states and 5884 transitions. Second operand has 9 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:51,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:51,129 INFO L93 Difference]: Finished difference Result 28430 states and 36528 transitions. [2025-01-09 00:00:51,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 00:00:51,130 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 0 states have call successors, (0), 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 387 [2025-01-09 00:00:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:51,224 INFO L225 Difference]: With dead ends: 28430 [2025-01-09 00:00:51,225 INFO L226 Difference]: Without dead ends: 23851 [2025-01-09 00:00:51,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 783 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=142, Invalid=364, Unknown=0, NotChecked=0, Total=506 [2025-01-09 00:00:51,231 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 5889 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 10028 mSolverCounterSat, 3159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5889 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 13187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3159 IncrementalHoareTripleChecker+Valid, 10028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:51,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5889 Valid, 388 Invalid, 13187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3159 Valid, 10028 Invalid, 0 Unknown, 0 Unchecked, 12.1s Time] [2025-01-09 00:00:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23851 states. [2025-01-09 00:00:51,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23851 to 15383. [2025-01-09 00:00:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15383 states, 15382 states have (on average 1.2129111949031335) internal successors, (18657), 15382 states have internal predecessors, (18657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15383 states to 15383 states and 18657 transitions. [2025-01-09 00:00:51,480 INFO L78 Accepts]: Start accepts. Automaton has 15383 states and 18657 transitions. Word has length 387 [2025-01-09 00:00:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:51,480 INFO L471 AbstractCegarLoop]: Abstraction has 15383 states and 18657 transitions. [2025-01-09 00:00:51,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 98.77777777777777) internal successors, (889), 9 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:51,485 INFO L276 IsEmpty]: Start isEmpty. Operand 15383 states and 18657 transitions. [2025-01-09 00:00:51,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2025-01-09 00:00:51,493 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:51,493 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:00:51,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:00:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:51,699 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:51,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash -38907296, now seen corresponding path program 1 times [2025-01-09 00:00:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:51,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57854100] [2025-01-09 00:00:51,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:51,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:51,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 463 statements into 1 equivalence classes. [2025-01-09 00:00:51,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 463 of 463 statements. [2025-01-09 00:00:51,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:51,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:52,088 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 429 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2025-01-09 00:00:52,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:52,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57854100] [2025-01-09 00:00:52,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57854100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:52,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:52,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:52,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247104155] [2025-01-09 00:00:52,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:52,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:52,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:52,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:52,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:52,092 INFO L87 Difference]: Start difference. First operand 15383 states and 18657 transitions. Second operand has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:53,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:53,625 INFO L93 Difference]: Finished difference Result 30166 states and 36675 transitions. [2025-01-09 00:00:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:53,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 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 463 [2025-01-09 00:00:53,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:53,656 INFO L225 Difference]: With dead ends: 30166 [2025-01-09 00:00:53,656 INFO L226 Difference]: Without dead ends: 15084 [2025-01-09 00:00:53,672 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-01-09 00:00:53,673 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 248 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:53,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 614 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:00:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15084 states. [2025-01-09 00:00:53,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15084 to 15079. [2025-01-09 00:00:53,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15079 states, 15078 states have (on average 1.1443825441039925) internal successors, (17255), 15078 states have internal predecessors, (17255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:53,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15079 states to 15079 states and 17255 transitions. [2025-01-09 00:00:53,846 INFO L78 Accepts]: Start accepts. Automaton has 15079 states and 17255 transitions. Word has length 463 [2025-01-09 00:00:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:53,847 INFO L471 AbstractCegarLoop]: Abstraction has 15079 states and 17255 transitions. [2025-01-09 00:00:53,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:53,848 INFO L276 IsEmpty]: Start isEmpty. Operand 15079 states and 17255 transitions. [2025-01-09 00:00:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 00:00:53,852 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:53,852 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:00:53,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:00:53,853 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:53,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:53,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1109364114, now seen corresponding path program 1 times [2025-01-09 00:00:53,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:53,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797427657] [2025-01-09 00:00:53,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:53,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:53,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 00:00:53,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 00:00:53,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:53,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-01-09 00:00:54,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:54,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797427657] [2025-01-09 00:00:54,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797427657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:54,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:54,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:54,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072071728] [2025-01-09 00:00:54,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:54,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:54,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:54,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:54,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:54,180 INFO L87 Difference]: Start difference. First operand 15079 states and 17255 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:55,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:55,645 INFO L93 Difference]: Finished difference Result 34640 states and 40153 transitions. [2025-01-09 00:00:55,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:55,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-01-09 00:00:55,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:55,674 INFO L225 Difference]: With dead ends: 34640 [2025-01-09 00:00:55,675 INFO L226 Difference]: Without dead ends: 19862 [2025-01-09 00:00:55,691 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-01-09 00:00:55,692 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 407 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:55,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 448 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:00:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19862 states. [2025-01-09 00:00:55,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19862 to 19862. [2025-01-09 00:00:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19862 states, 19861 states have (on average 1.1498917476461408) internal successors, (22838), 19861 states have internal predecessors, (22838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:55,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19862 states to 19862 states and 22838 transitions. [2025-01-09 00:00:55,914 INFO L78 Accepts]: Start accepts. Automaton has 19862 states and 22838 transitions. Word has length 483 [2025-01-09 00:00:55,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:55,915 INFO L471 AbstractCegarLoop]: Abstraction has 19862 states and 22838 transitions. [2025-01-09 00:00:55,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 19862 states and 22838 transitions. [2025-01-09 00:00:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-01-09 00:00:55,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:55,922 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:00:55,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:00:55,922 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:55,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:55,923 INFO L85 PathProgramCache]: Analyzing trace with hash -197625798, now seen corresponding path program 1 times [2025-01-09 00:00:55,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:55,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817699213] [2025-01-09 00:00:55,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:55,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:56,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-01-09 00:00:56,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-01-09 00:00:56,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:56,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:56,372 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-09 00:00:56,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:56,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817699213] [2025-01-09 00:00:56,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817699213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:56,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:00:56,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:00:56,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094216848] [2025-01-09 00:00:56,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:56,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:56,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:56,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:56,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:00:56,374 INFO L87 Difference]: Start difference. First operand 19862 states and 22838 transitions. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:58,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:00:58,183 INFO L93 Difference]: Finished difference Result 48991 states and 56530 transitions. [2025-01-09 00:00:58,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:00:58,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 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 551 [2025-01-09 00:00:58,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:00:58,227 INFO L225 Difference]: With dead ends: 48991 [2025-01-09 00:00:58,227 INFO L226 Difference]: Without dead ends: 29430 [2025-01-09 00:00:58,241 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-01-09 00:00:58,243 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 222 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 1175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:00:58,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 182 Invalid, 1175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:00:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29430 states. [2025-01-09 00:00:58,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29430 to 25244. [2025-01-09 00:00:58,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25244 states, 25243 states have (on average 1.1518044606425544) internal successors, (29075), 25243 states have internal predecessors, (29075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25244 states to 25244 states and 29075 transitions. [2025-01-09 00:00:58,534 INFO L78 Accepts]: Start accepts. Automaton has 25244 states and 29075 transitions. Word has length 551 [2025-01-09 00:00:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:00:58,535 INFO L471 AbstractCegarLoop]: Abstraction has 25244 states and 29075 transitions. [2025-01-09 00:00:58,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:00:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 25244 states and 29075 transitions. [2025-01-09 00:00:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 621 [2025-01-09 00:00:58,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:00:58,546 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:00:58,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:00:58,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:00:58,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:00:58,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1010711326, now seen corresponding path program 1 times [2025-01-09 00:00:58,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:00:58,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247430451] [2025-01-09 00:00:58,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:58,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:00:58,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-01-09 00:00:58,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-01-09 00:00:58,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:58,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 641 proven. 39 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2025-01-09 00:00:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:00:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247430451] [2025-01-09 00:00:59,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247430451] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:00:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1332075070] [2025-01-09 00:00:59,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:00:59,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:00:59,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:00:59,149 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-01-09 00:00:59,151 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-01-09 00:00:59,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes. [2025-01-09 00:00:59,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements. [2025-01-09 00:00:59,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:00:59,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:00:59,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:00:59,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:00:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 974 backedges. 450 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 00:00:59,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:00:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1332075070] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:00:59,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:00:59,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:00:59,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682796991] [2025-01-09 00:00:59,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:00:59,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:00:59,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:00:59,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:00:59,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:00:59,615 INFO L87 Difference]: Start difference. First operand 25244 states and 29075 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:01,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:01,534 INFO L93 Difference]: Finished difference Result 52576 states and 60345 transitions. [2025-01-09 00:01:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:01,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 620 [2025-01-09 00:01:01,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:01,605 INFO L225 Difference]: With dead ends: 52576 [2025-01-09 00:01:01,606 INFO L226 Difference]: Without dead ends: 27633 [2025-01-09 00:01:01,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 619 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:01,650 INFO L435 NwaCegarLoop]: 566 mSDtfsCounter, 203 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:01,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 604 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:01:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27633 states. [2025-01-09 00:01:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27633 to 27631. [2025-01-09 00:01:02,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27631 states, 27630 states have (on average 1.1124502352515382) internal successors, (30737), 27630 states have internal predecessors, (30737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:02,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27631 states to 27631 states and 30737 transitions. [2025-01-09 00:01:02,347 INFO L78 Accepts]: Start accepts. Automaton has 27631 states and 30737 transitions. Word has length 620 [2025-01-09 00:01:02,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:02,348 INFO L471 AbstractCegarLoop]: Abstraction has 27631 states and 30737 transitions. [2025-01-09 00:01:02,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:02,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27631 states and 30737 transitions. [2025-01-09 00:01:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2025-01-09 00:01:02,384 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:02,386 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:01:02,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:01:02,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:02,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:02,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:02,591 INFO L85 PathProgramCache]: Analyzing trace with hash -377464365, now seen corresponding path program 1 times [2025-01-09 00:01:02,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:02,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889965209] [2025-01-09 00:01:02,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:02,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 649 statements into 1 equivalence classes. [2025-01-09 00:01:02,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 649 of 649 statements. [2025-01-09 00:01:02,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:02,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:03,460 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2025-01-09 00:01:03,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:03,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889965209] [2025-01-09 00:01:03,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889965209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:03,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:03,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:01:03,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047120874] [2025-01-09 00:01:03,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:03,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:03,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:03,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:03,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:03,467 INFO L87 Difference]: Start difference. First operand 27631 states and 30737 transitions. Second operand has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:05,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:05,959 INFO L93 Difference]: Finished difference Result 66914 states and 73951 transitions. [2025-01-09 00:01:05,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:05,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 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 649 [2025-01-09 00:01:05,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:05,994 INFO L225 Difference]: With dead ends: 66914 [2025-01-09 00:01:05,994 INFO L226 Difference]: Without dead ends: 29119 [2025-01-09 00:01:06,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:01:06,034 INFO L435 NwaCegarLoop]: 414 mSDtfsCounter, 850 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1234 mSolverCounterSat, 617 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 1851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 617 IncrementalHoareTripleChecker+Valid, 1234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:06,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 446 Invalid, 1851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [617 Valid, 1234 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:01:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29119 states. [2025-01-09 00:01:06,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29119 to 23139. [2025-01-09 00:01:06,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23139 states, 23138 states have (on average 1.0444722966548534) internal successors, (24167), 23138 states have internal predecessors, (24167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:06,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23139 states to 23139 states and 24167 transitions. [2025-01-09 00:01:06,495 INFO L78 Accepts]: Start accepts. Automaton has 23139 states and 24167 transitions. Word has length 649 [2025-01-09 00:01:06,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:06,496 INFO L471 AbstractCegarLoop]: Abstraction has 23139 states and 24167 transitions. [2025-01-09 00:01:06,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:06,496 INFO L276 IsEmpty]: Start isEmpty. Operand 23139 states and 24167 transitions. [2025-01-09 00:01:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 686 [2025-01-09 00:01:06,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:06,505 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:01:06,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:01:06,505 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:06,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:06,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1734705374, now seen corresponding path program 1 times [2025-01-09 00:01:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:06,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563060947] [2025-01-09 00:01:06,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:06,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 685 statements into 1 equivalence classes. [2025-01-09 00:01:06,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 685 of 685 statements. [2025-01-09 00:01:06,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:06,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 755 backedges. 413 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2025-01-09 00:01:06,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:06,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563060947] [2025-01-09 00:01:06,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563060947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:06,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:06,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:06,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070735597] [2025-01-09 00:01:06,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:06,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:06,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:06,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:06,889 INFO L87 Difference]: Start difference. First operand 23139 states and 24167 transitions. Second operand has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:07,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:07,932 INFO L93 Difference]: Finished difference Result 46271 states and 48341 transitions. [2025-01-09 00:01:07,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:07,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 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 685 [2025-01-09 00:01:07,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:07,960 INFO L225 Difference]: With dead ends: 46271 [2025-01-09 00:01:07,961 INFO L226 Difference]: Without dead ends: 23433 [2025-01-09 00:01:07,976 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-01-09 00:01:07,979 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 463 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:07,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 69 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:01:07,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23433 states. [2025-01-09 00:01:08,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23433 to 22832. [2025-01-09 00:01:08,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22832 states, 22831 states have (on average 1.0443694976128948) internal successors, (23844), 22831 states have internal predecessors, (23844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22832 states to 22832 states and 23844 transitions. [2025-01-09 00:01:08,217 INFO L78 Accepts]: Start accepts. Automaton has 22832 states and 23844 transitions. Word has length 685 [2025-01-09 00:01:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:08,217 INFO L471 AbstractCegarLoop]: Abstraction has 22832 states and 23844 transitions. [2025-01-09 00:01:08,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 22832 states and 23844 transitions. [2025-01-09 00:01:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-09 00:01:08,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:08,226 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:01:08,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:01:08,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:08,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash 119734413, now seen corresponding path program 1 times [2025-01-09 00:01:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:08,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067866255] [2025-01-09 00:01:08,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:08,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 00:01:08,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 00:01:08,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:08,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:08,755 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2025-01-09 00:01:08,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:08,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067866255] [2025-01-09 00:01:08,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067866255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:08,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:08,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113159460] [2025-01-09 00:01:08,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:08,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:08,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:08,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:08,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:08,757 INFO L87 Difference]: Start difference. First operand 22832 states and 23844 transitions. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:10,220 INFO L93 Difference]: Finished difference Result 51658 states and 53976 transitions. [2025-01-09 00:01:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:10,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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 689 [2025-01-09 00:01:10,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:10,254 INFO L225 Difference]: With dead ends: 51658 [2025-01-09 00:01:10,255 INFO L226 Difference]: Without dead ends: 29127 [2025-01-09 00:01:10,273 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-01-09 00:01:10,274 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 349 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:10,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 134 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29127 states. [2025-01-09 00:01:10,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29127 to 25222. [2025-01-09 00:01:10,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25222 states, 25221 states have (on average 1.0453193767098847) internal successors, (26364), 25221 states have internal predecessors, (26364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:10,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25222 states to 25222 states and 26364 transitions. [2025-01-09 00:01:10,571 INFO L78 Accepts]: Start accepts. Automaton has 25222 states and 26364 transitions. Word has length 689 [2025-01-09 00:01:10,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:10,572 INFO L471 AbstractCegarLoop]: Abstraction has 25222 states and 26364 transitions. [2025-01-09 00:01:10,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 25222 states and 26364 transitions. [2025-01-09 00:01:10,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 695 [2025-01-09 00:01:10,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:10,581 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-01-09 00:01:10,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:01:10,583 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:10,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:10,583 INFO L85 PathProgramCache]: Analyzing trace with hash -841499215, now seen corresponding path program 1 times [2025-01-09 00:01:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:10,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020611418] [2025-01-09 00:01:10,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:10,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:10,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-01-09 00:01:10,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-01-09 00:01:10,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:10,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 279 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:13,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020611418] [2025-01-09 00:01:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020611418] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487720525] [2025-01-09 00:01:13,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:13,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:13,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:13,203 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-01-09 00:01:13,209 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-01-09 00:01:13,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 694 statements into 1 equivalence classes. [2025-01-09 00:01:13,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 694 of 694 statements. [2025-01-09 00:01:13,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:13,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:13,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 00:01:13,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:16,663 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 410 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:16,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:01:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 410 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:19,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487720525] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:01:19,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:01:19,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 11 [2025-01-09 00:01:19,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282099102] [2025-01-09 00:01:19,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:01:19,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 00:01:19,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:19,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 00:01:19,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:01:19,301 INFO L87 Difference]: Start difference. First operand 25222 states and 26364 transitions. Second operand has 11 states, 11 states have (on average 122.0909090909091) internal successors, (1343), 11 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:28,438 INFO L93 Difference]: Finished difference Result 87671 states and 91512 transitions. [2025-01-09 00:01:28,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-01-09 00:01:28,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 122.0909090909091) internal successors, (1343), 11 states have internal predecessors, (1343), 0 states have call successors, (0), 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 694 [2025-01-09 00:01:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:28,515 INFO L225 Difference]: With dead ends: 87671 [2025-01-09 00:01:28,515 INFO L226 Difference]: Without dead ends: 62750 [2025-01-09 00:01:28,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1450 GetRequests, 1407 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 652 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2025-01-09 00:01:28,546 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 5713 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 10602 mSolverCounterSat, 1717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5713 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 12319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1717 IncrementalHoareTripleChecker+Valid, 10602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:28,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5713 Valid, 420 Invalid, 12319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1717 Valid, 10602 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2025-01-09 00:01:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62750 states. [2025-01-09 00:01:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62750 to 24921. [2025-01-09 00:01:29,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24921 states, 24920 states have (on average 1.0437399678972712) internal successors, (26010), 24920 states have internal predecessors, (26010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24921 states to 24921 states and 26010 transitions. [2025-01-09 00:01:29,074 INFO L78 Accepts]: Start accepts. Automaton has 24921 states and 26010 transitions. Word has length 694 [2025-01-09 00:01:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:29,075 INFO L471 AbstractCegarLoop]: Abstraction has 24921 states and 26010 transitions. [2025-01-09 00:01:29,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 122.0909090909091) internal successors, (1343), 11 states have internal predecessors, (1343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 24921 states and 26010 transitions. [2025-01-09 00:01:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2025-01-09 00:01:29,084 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:29,084 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:01:29,093 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-01-09 00:01:29,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:29,292 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:29,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:29,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1103301216, now seen corresponding path program 1 times [2025-01-09 00:01:29,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:29,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897747779] [2025-01-09 00:01:29,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:29,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:29,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes. [2025-01-09 00:01:29,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements. [2025-01-09 00:01:29,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:29,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 263 proven. 418 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-01-09 00:01:30,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897747779] [2025-01-09 00:01:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897747779] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366014064] [2025-01-09 00:01:30,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:30,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:30,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:30,417 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-01-09 00:01:30,418 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-01-09 00:01:30,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 715 statements into 1 equivalence classes. [2025-01-09 00:01:30,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 715 of 715 statements. [2025-01-09 00:01:30,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:30,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:30,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:01:30,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:30,894 INFO L134 CoverageAnalysis]: Checked inductivity of 761 backedges. 414 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-01-09 00:01:30,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:30,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366014064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:30,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:30,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-01-09 00:01:30,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239539317] [2025-01-09 00:01:30,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:30,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:01:30,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:30,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:01:30,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:30,897 INFO L87 Difference]: Start difference. First operand 24921 states and 26010 transitions. Second operand has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:32,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:32,712 INFO L93 Difference]: Finished difference Result 60032 states and 62541 transitions. [2025-01-09 00:01:32,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:01:32,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 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 715 [2025-01-09 00:01:32,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:32,758 INFO L225 Difference]: With dead ends: 60032 [2025-01-09 00:01:32,758 INFO L226 Difference]: Without dead ends: 35412 [2025-01-09 00:01:32,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 714 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:01:32,769 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 542 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1624 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 1624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:32,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 149 Invalid, 1829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 1624 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:01:32,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35412 states. [2025-01-09 00:01:33,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35412 to 33607. [2025-01-09 00:01:33,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33607 states, 33606 states have (on average 1.0399333452359698) internal successors, (34948), 33606 states have internal predecessors, (34948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33607 states to 33607 states and 34948 transitions. [2025-01-09 00:01:33,159 INFO L78 Accepts]: Start accepts. Automaton has 33607 states and 34948 transitions. Word has length 715 [2025-01-09 00:01:33,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:33,160 INFO L471 AbstractCegarLoop]: Abstraction has 33607 states and 34948 transitions. [2025-01-09 00:01:33,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33607 states and 34948 transitions. [2025-01-09 00:01:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 00:01:33,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:33,176 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:01:33,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:01:33,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:01:33,377 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:33,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:33,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1012465198, now seen corresponding path program 1 times [2025-01-09 00:01:33,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:33,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492485437] [2025-01-09 00:01:33,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:33,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:33,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 00:01:33,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 00:01:33,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:33,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:34,103 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 461 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-01-09 00:01:34,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:34,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492485437] [2025-01-09 00:01:34,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492485437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:34,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:34,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:34,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595855892] [2025-01-09 00:01:34,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:34,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:34,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:34,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:34,115 INFO L87 Difference]: Start difference. First operand 33607 states and 34948 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:34,982 INFO L93 Difference]: Finished difference Result 64218 states and 66788 transitions. [2025-01-09 00:01:34,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:34,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 731 [2025-01-09 00:01:34,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:35,013 INFO L225 Difference]: With dead ends: 64218 [2025-01-09 00:01:35,013 INFO L226 Difference]: Without dead ends: 30912 [2025-01-09 00:01:35,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:35,034 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 158 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 876 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:35,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 531 Invalid, 876 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:01:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30912 states. [2025-01-09 00:01:35,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30912 to 29716. [2025-01-09 00:01:35,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29716 states, 29715 states have (on average 1.0300521622076393) internal successors, (30608), 29715 states have internal predecessors, (30608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:35,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29716 states to 29716 states and 30608 transitions. [2025-01-09 00:01:35,358 INFO L78 Accepts]: Start accepts. Automaton has 29716 states and 30608 transitions. Word has length 731 [2025-01-09 00:01:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:35,359 INFO L471 AbstractCegarLoop]: Abstraction has 29716 states and 30608 transitions. [2025-01-09 00:01:35,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 29716 states and 30608 transitions. [2025-01-09 00:01:35,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 777 [2025-01-09 00:01:35,368 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:35,368 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:01:35,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:01:35,369 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:35,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:35,369 INFO L85 PathProgramCache]: Analyzing trace with hash 2044655220, now seen corresponding path program 1 times [2025-01-09 00:01:35,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:35,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199541670] [2025-01-09 00:01:35,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:35,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:35,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 776 statements into 1 equivalence classes. [2025-01-09 00:01:35,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 776 of 776 statements. [2025-01-09 00:01:35,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:35,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:35,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1051 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2025-01-09 00:01:35,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:35,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199541670] [2025-01-09 00:01:35,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199541670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:35,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:35,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:35,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54529625] [2025-01-09 00:01:35,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:35,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:35,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:35,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:35,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:35,921 INFO L87 Difference]: Start difference. First operand 29716 states and 30608 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:36,636 INFO L93 Difference]: Finished difference Result 48911 states and 50280 transitions. [2025-01-09 00:01:36,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:36,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 776 [2025-01-09 00:01:36,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:36,653 INFO L225 Difference]: With dead ends: 48911 [2025-01-09 00:01:36,654 INFO L226 Difference]: Without dead ends: 19496 [2025-01-09 00:01:36,668 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-01-09 00:01:36,669 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 215 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:36,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 365 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:01:36,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19496 states. [2025-01-09 00:01:36,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19496 to 17397. [2025-01-09 00:01:36,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17397 states, 17396 states have (on average 1.022591400321913) internal successors, (17789), 17396 states have internal predecessors, (17789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:36,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17397 states to 17397 states and 17789 transitions. [2025-01-09 00:01:36,880 INFO L78 Accepts]: Start accepts. Automaton has 17397 states and 17789 transitions. Word has length 776 [2025-01-09 00:01:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 17397 states and 17789 transitions. [2025-01-09 00:01:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 17397 states and 17789 transitions. [2025-01-09 00:01:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2025-01-09 00:01:36,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:36,899 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:36,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:01:36,899 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:36,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:36,900 INFO L85 PathProgramCache]: Analyzing trace with hash -508257414, now seen corresponding path program 1 times [2025-01-09 00:01:36,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:36,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033398799] [2025-01-09 00:01:36,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:36,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:36,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 871 statements into 1 equivalence classes. [2025-01-09 00:01:37,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 871 of 871 statements. [2025-01-09 00:01:37,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:37,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:37,606 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 596 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 00:01:37,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:37,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033398799] [2025-01-09 00:01:37,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033398799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:37,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:37,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:37,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6385468] [2025-01-09 00:01:37,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:37,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:37,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:37,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:37,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:37,609 INFO L87 Difference]: Start difference. First operand 17397 states and 17789 transitions. Second operand has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:38,380 INFO L93 Difference]: Finished difference Result 38396 states and 39278 transitions. [2025-01-09 00:01:38,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:38,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 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 871 [2025-01-09 00:01:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:38,409 INFO L225 Difference]: With dead ends: 38396 [2025-01-09 00:01:38,409 INFO L226 Difference]: Without dead ends: 20698 [2025-01-09 00:01:38,421 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-01-09 00:01:38,422 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 32 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:38,423 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 426 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:01:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20698 states. [2025-01-09 00:01:38,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20698 to 18302. [2025-01-09 00:01:38,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18302 states, 18301 states have (on average 1.0187421452379652) internal successors, (18644), 18301 states have internal predecessors, (18644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18302 states to 18302 states and 18644 transitions. [2025-01-09 00:01:38,662 INFO L78 Accepts]: Start accepts. Automaton has 18302 states and 18644 transitions. Word has length 871 [2025-01-09 00:01:38,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:38,664 INFO L471 AbstractCegarLoop]: Abstraction has 18302 states and 18644 transitions. [2025-01-09 00:01:38,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.66666666666666) internal successors, (590), 3 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:38,665 INFO L276 IsEmpty]: Start isEmpty. Operand 18302 states and 18644 transitions. [2025-01-09 00:01:38,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2025-01-09 00:01:38,681 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:38,682 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:38,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:01:38,682 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:38,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:38,687 INFO L85 PathProgramCache]: Analyzing trace with hash 173670327, now seen corresponding path program 1 times [2025-01-09 00:01:38,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:38,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263251345] [2025-01-09 00:01:38,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:38,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:38,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 883 statements into 1 equivalence classes. [2025-01-09 00:01:38,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 883 of 883 statements. [2025-01-09 00:01:38,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:38,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:40,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 255 proven. 1028 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2025-01-09 00:01:40,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263251345] [2025-01-09 00:01:40,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263251345] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:40,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741953381] [2025-01-09 00:01:40,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:40,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:40,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:40,640 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:01:40,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:01:40,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 883 statements into 1 equivalence classes. [2025-01-09 00:01:40,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 883 of 883 statements. [2025-01-09 00:01:40,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:40,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:40,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:01:40,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 812 proven. 117 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-01-09 00:01:41,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:01:42,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1400 backedges. 579 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2025-01-09 00:01:42,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741953381] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:42,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:01:42,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 10 [2025-01-09 00:01:42,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025262025] [2025-01-09 00:01:42,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:42,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:42,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:42,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:42,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:01:42,425 INFO L87 Difference]: Start difference. First operand 18302 states and 18644 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:43,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:43,419 INFO L93 Difference]: Finished difference Result 37202 states and 37893 transitions. [2025-01-09 00:01:43,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:43,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 883 [2025-01-09 00:01:43,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:43,445 INFO L225 Difference]: With dead ends: 37202 [2025-01-09 00:01:43,446 INFO L226 Difference]: Without dead ends: 19201 [2025-01-09 00:01:43,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1770 GetRequests, 1762 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:01:43,464 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 174 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:43,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 39 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:01:43,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19201 states. [2025-01-09 00:01:43,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19201 to 18302. [2025-01-09 00:01:43,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18302 states, 18301 states have (on average 1.0175946669580898) internal successors, (18623), 18301 states have internal predecessors, (18623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18302 states to 18302 states and 18623 transitions. [2025-01-09 00:01:43,664 INFO L78 Accepts]: Start accepts. Automaton has 18302 states and 18623 transitions. Word has length 883 [2025-01-09 00:01:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:43,668 INFO L471 AbstractCegarLoop]: Abstraction has 18302 states and 18623 transitions. [2025-01-09 00:01:43,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:43,669 INFO L276 IsEmpty]: Start isEmpty. Operand 18302 states and 18623 transitions. [2025-01-09 00:01:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 930 [2025-01-09 00:01:43,684 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:43,685 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:01:43,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 00:01:43,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 00:01:43,889 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:43,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:43,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1877296040, now seen corresponding path program 1 times [2025-01-09 00:01:43,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:43,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649478064] [2025-01-09 00:01:43,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:43,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:43,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 929 statements into 1 equivalence classes. [2025-01-09 00:01:44,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 929 of 929 statements. [2025-01-09 00:01:44,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:44,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat