./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label18.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/Problem17_label18.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 36682755a8fd6d5761d4aa48745e539f37b082d91c2b7f5a4981e2bf074e7e62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:11:37,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:11:37,631 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:11:37,634 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:11:37,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:11:37,650 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:11:37,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:11:37,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:11:37,651 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:11:37,651 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:11:37,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:11:37,651 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:11:37,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:11:37,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:11:37,652 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:11:37,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:11:37,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:11:37,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:11:37,653 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 -> 36682755a8fd6d5761d4aa48745e539f37b082d91c2b7f5a4981e2bf074e7e62 [2025-01-09 00:11:37,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:11:37,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:11:37,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:11:37,840 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:11:37,840 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:11:37,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label18.c [2025-01-09 00:11:38,931 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9612a2592/8b24b956a65e4e88bdf2105209c34fce/FLAGb2705618e [2025-01-09 00:11:39,297 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:11:39,297 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label18.c [2025-01-09 00:11:39,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9612a2592/8b24b956a65e4e88bdf2105209c34fce/FLAGb2705618e [2025-01-09 00:11:39,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9612a2592/8b24b956a65e4e88bdf2105209c34fce [2025-01-09 00:11:39,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:11:39,341 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:11:39,342 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:11:39,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:11:39,346 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:11:39,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:11:39" (1/1) ... [2025-01-09 00:11:39,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c635d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:39, skipping insertion in model container [2025-01-09 00:11:39,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:11:39" (1/1) ... [2025-01-09 00:11:39,415 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:11:39,597 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/Problem17_label18.c[8129,8142] [2025-01-09 00:11:39,897 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:11:39,904 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:11:39,925 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/Problem17_label18.c[8129,8142] [2025-01-09 00:11:40,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:11:40,105 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:11:40,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40 WrapperNode [2025-01-09 00:11:40,106 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:11:40,107 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:11:40,107 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:11:40,107 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:11:40,111 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:11:40" (1/1) ... [2025-01-09 00:11:40,144 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:11:40" (1/1) ... [2025-01-09 00:11:40,335 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:11:40,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:11:40,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:11:40,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:11:40,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:11:40,343 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,574 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:11:40,575 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,703 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,720 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,758 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:11:40,786 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:11:40,787 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:11:40,787 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:11:40,788 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (1/1) ... [2025-01-09 00:11:40,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:11:40,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:11:40,816 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:11:40,827 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:11:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:11:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:11:40,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:11:40,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:11:40,900 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:11:40,901 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:11:43,504 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:11:43,504 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:11:43,519 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:11:43,519 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:11:43,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:11:43 BoogieIcfgContainer [2025-01-09 00:11:43,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:11:43,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:11:43,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:11:43,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:11:43,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:11:39" (1/3) ... [2025-01-09 00:11:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1b7a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:11:43, skipping insertion in model container [2025-01-09 00:11:43,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:11:40" (2/3) ... [2025-01-09 00:11:43,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1b7a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:11:43, skipping insertion in model container [2025-01-09 00:11:43,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:11:43" (3/3) ... [2025-01-09 00:11:43,527 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label18.c [2025-01-09 00:11:43,537 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:11:43,539 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label18.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:11:43,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:11:43,637 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;@2e1225af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:11:43,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:11:43,645 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 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:11:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-09 00:11:43,656 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:43,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:43,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:43,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:43,665 INFO L85 PathProgramCache]: Analyzing trace with hash -257801140, now seen corresponding path program 1 times [2025-01-09 00:11:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:43,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753545106] [2025-01-09 00:11:43,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:43,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:43,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 00:11:43,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 00:11:43,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:43,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:43,958 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:11:43,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753545106] [2025-01-09 00:11:43,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753545106] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:43,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:43,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:43,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92989712] [2025-01-09 00:11:43,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:43,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:43,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:43,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:43,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:43,994 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:11:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:46,225 INFO L93 Difference]: Finished difference Result 1644 states and 3026 transitions. [2025-01-09 00:11:46,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:46,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2025-01-09 00:11:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:46,236 INFO L225 Difference]: With dead ends: 1644 [2025-01-09 00:11:46,236 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 00:11:46,240 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:11:46,242 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 433 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:46,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 503 Invalid, 1802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:11:46,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 00:11:46,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 971. [2025-01-09 00:11:46,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 971 states, 970 states have (on average 1.5536082474226804) internal successors, (1507), 970 states have internal predecessors, (1507), 0 states have call successors, (0), 0 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:11:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 971 states to 971 states and 1507 transitions. [2025-01-09 00:11:46,295 INFO L78 Accepts]: Start accepts. Automaton has 971 states and 1507 transitions. Word has length 55 [2025-01-09 00:11:46,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:46,297 INFO L471 AbstractCegarLoop]: Abstraction has 971 states and 1507 transitions. [2025-01-09 00:11:46,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 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:11:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1507 transitions. [2025-01-09 00:11:46,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 00:11:46,300 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:46,300 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:46,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:11:46,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:46,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:46,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1074655354, now seen corresponding path program 1 times [2025-01-09 00:11:46,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968905778] [2025-01-09 00:11:46,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:46,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 00:11:46,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 00:11:46,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:46,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:46,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:46,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968905778] [2025-01-09 00:11:46,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968905778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:46,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:46,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:46,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666578371] [2025-01-09 00:11:46,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:46,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:46,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:46,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:46,657 INFO L87 Difference]: Start difference. First operand 971 states and 1507 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:11:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:48,816 INFO L93 Difference]: Finished difference Result 2844 states and 4428 transitions. [2025-01-09 00:11:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2025-01-09 00:11:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:48,822 INFO L225 Difference]: With dead ends: 2844 [2025-01-09 00:11:48,822 INFO L226 Difference]: Without dead ends: 1875 [2025-01-09 00:11:48,823 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:11:48,824 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 442 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:48,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 242 Invalid, 1842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:11:48,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2025-01-09 00:11:48,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1854. [2025-01-09 00:11:48,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1853 states have (on average 1.4889368591473287) internal successors, (2759), 1853 states have internal predecessors, (2759), 0 states have call successors, (0), 0 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:11:48,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2759 transitions. [2025-01-09 00:11:48,854 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2759 transitions. Word has length 122 [2025-01-09 00:11:48,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:48,854 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 2759 transitions. [2025-01-09 00:11:48,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 2 states have internal predecessors, (122), 0 states have call successors, (0), 0 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:11:48,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2759 transitions. [2025-01-09 00:11:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 00:11:48,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:48,857 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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:11:48,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:11:48,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:48,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:48,858 INFO L85 PathProgramCache]: Analyzing trace with hash -986672754, now seen corresponding path program 1 times [2025-01-09 00:11:48,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:48,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429856473] [2025-01-09 00:11:48,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:48,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:48,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 00:11:48,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 00:11:48,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:48,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:49,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:49,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429856473] [2025-01-09 00:11:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429856473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:49,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:49,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408704913] [2025-01-09 00:11:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:49,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:49,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:49,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:49,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:49,108 INFO L87 Difference]: Start difference. First operand 1854 states and 2759 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:11:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:50,966 INFO L93 Difference]: Finished difference Result 4995 states and 7380 transitions. [2025-01-09 00:11:50,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:50,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2025-01-09 00:11:50,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:50,975 INFO L225 Difference]: With dead ends: 4995 [2025-01-09 00:11:50,975 INFO L226 Difference]: Without dead ends: 3143 [2025-01-09 00:11:50,977 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:11:50,978 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 368 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:50,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 558 Invalid, 1724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:11:50,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3143 states. [2025-01-09 00:11:51,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3143 to 3141. [2025-01-09 00:11:51,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 3140 states have (on average 1.3197452229299362) internal successors, (4144), 3140 states have internal predecessors, (4144), 0 states have call successors, (0), 0 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:11:51,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 4144 transitions. [2025-01-09 00:11:51,019 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 4144 transitions. Word has length 130 [2025-01-09 00:11:51,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:51,019 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 4144 transitions. [2025-01-09 00:11:51,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:11:51,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 4144 transitions. [2025-01-09 00:11:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-01-09 00:11:51,021 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:51,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:51,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:11:51,021 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:51,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:51,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1830968702, now seen corresponding path program 1 times [2025-01-09 00:11:51,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:51,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233366066] [2025-01-09 00:11:51,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:51,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:51,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-01-09 00:11:51,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-01-09 00:11:51,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:51,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:51,160 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-01-09 00:11:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:51,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233366066] [2025-01-09 00:11:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233366066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:51,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:51,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:11:51,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341067495] [2025-01-09 00:11:51,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:51,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:51,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:51,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:51,163 INFO L87 Difference]: Start difference. First operand 3141 states and 4144 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:52,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:52,812 INFO L93 Difference]: Finished difference Result 8416 states and 11323 transitions. [2025-01-09 00:11:52,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:52,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2025-01-09 00:11:52,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:52,828 INFO L225 Difference]: With dead ends: 8416 [2025-01-09 00:11:52,829 INFO L226 Difference]: Without dead ends: 5702 [2025-01-09 00:11:52,832 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:11:52,835 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:52,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:11:52,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2025-01-09 00:11:52,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 3999. [2025-01-09 00:11:52,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3999 states, 3998 states have (on average 1.2511255627813906) internal successors, (5002), 3998 states have internal predecessors, (5002), 0 states have call successors, (0), 0 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:11:52,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3999 states to 3999 states and 5002 transitions. [2025-01-09 00:11:52,888 INFO L78 Accepts]: Start accepts. Automaton has 3999 states and 5002 transitions. Word has length 190 [2025-01-09 00:11:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:52,889 INFO L471 AbstractCegarLoop]: Abstraction has 3999 states and 5002 transitions. [2025-01-09 00:11:52,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3999 states and 5002 transitions. [2025-01-09 00:11:52,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 00:11:52,892 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:52,892 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:52,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:11:52,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:52,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:52,893 INFO L85 PathProgramCache]: Analyzing trace with hash 879207199, now seen corresponding path program 1 times [2025-01-09 00:11:52,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:52,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065040274] [2025-01-09 00:11:52,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:52,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:52,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 00:11:52,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 00:11:52,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:52,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:11:53,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:53,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065040274] [2025-01-09 00:11:53,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065040274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:53,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:53,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:11:53,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692216591] [2025-01-09 00:11:53,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:53,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:11:53,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:53,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:11:53,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:11:53,244 INFO L87 Difference]: Start difference. First operand 3999 states and 5002 transitions. Second operand has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:55,504 INFO L93 Difference]: Finished difference Result 10144 states and 13051 transitions. [2025-01-09 00:11:55,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:11:55,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-01-09 00:11:55,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:55,534 INFO L225 Difference]: With dead ends: 10144 [2025-01-09 00:11:55,534 INFO L226 Difference]: Without dead ends: 6147 [2025-01-09 00:11:55,542 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:11:55,543 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 594 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 2472 mSolverCounterSat, 622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 3094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 622 IncrementalHoareTripleChecker+Valid, 2472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:55,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 915 Invalid, 3094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [622 Valid, 2472 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:11:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6147 states. [2025-01-09 00:11:55,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6147 to 6134. [2025-01-09 00:11:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6134 states, 6133 states have (on average 1.2437632480026088) internal successors, (7628), 6133 states have internal predecessors, (7628), 0 states have call successors, (0), 0 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:11:55,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6134 states to 6134 states and 7628 transitions. [2025-01-09 00:11:55,613 INFO L78 Accepts]: Start accepts. Automaton has 6134 states and 7628 transitions. Word has length 203 [2025-01-09 00:11:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:55,613 INFO L471 AbstractCegarLoop]: Abstraction has 6134 states and 7628 transitions. [2025-01-09 00:11:55,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.6) internal successors, (203), 5 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:11:55,613 INFO L276 IsEmpty]: Start isEmpty. Operand 6134 states and 7628 transitions. [2025-01-09 00:11:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 00:11:55,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:55,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:11:55,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:11:55,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:55,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:55,618 INFO L85 PathProgramCache]: Analyzing trace with hash -880612754, now seen corresponding path program 1 times [2025-01-09 00:11:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:55,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106504598] [2025-01-09 00:11:55,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:55,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:55,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 00:11:55,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 00:11:55,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:55,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:11:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106504598] [2025-01-09 00:11:55,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106504598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:55,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:55,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:55,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933459441] [2025-01-09 00:11:55,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:55,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:55,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:55,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:55,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:55,849 INFO L87 Difference]: Start difference. First operand 6134 states and 7628 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:11:58,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:11:58,086 INFO L93 Difference]: Finished difference Result 16089 states and 20189 transitions. [2025-01-09 00:11:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:11:58,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 209 [2025-01-09 00:11:58,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:11:58,107 INFO L225 Difference]: With dead ends: 16089 [2025-01-09 00:11:58,107 INFO L226 Difference]: Without dead ends: 9957 [2025-01-09 00:11:58,111 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:11:58,112 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 393 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:11:58,112 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 545 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:11:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9957 states. [2025-01-09 00:11:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9957 to 8678. [2025-01-09 00:11:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8678 states, 8677 states have (on average 1.202489339633514) internal successors, (10434), 8677 states have internal predecessors, (10434), 0 states have call successors, (0), 0 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:11:58,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8678 states to 8678 states and 10434 transitions. [2025-01-09 00:11:58,217 INFO L78 Accepts]: Start accepts. Automaton has 8678 states and 10434 transitions. Word has length 209 [2025-01-09 00:11:58,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:11:58,217 INFO L471 AbstractCegarLoop]: Abstraction has 8678 states and 10434 transitions. [2025-01-09 00:11:58,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 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:11:58,218 INFO L276 IsEmpty]: Start isEmpty. Operand 8678 states and 10434 transitions. [2025-01-09 00:11:58,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 00:11:58,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:11:58,219 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:11:58,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:11:58,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:11:58,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:11:58,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1888368961, now seen corresponding path program 1 times [2025-01-09 00:11:58,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:11:58,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529052127] [2025-01-09 00:11:58,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:11:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:11:58,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 00:11:58,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 00:11:58,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:11:58,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:11:58,328 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:11:58,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:11:58,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529052127] [2025-01-09 00:11:58,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529052127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:11:58,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:11:58,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:11:58,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383453179] [2025-01-09 00:11:58,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:11:58,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:11:58,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:11:58,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:11:58,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:11:58,330 INFO L87 Difference]: Start difference. First operand 8678 states and 10434 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:12:00,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:00,214 INFO L93 Difference]: Finished difference Result 21610 states and 26256 transitions. [2025-01-09 00:12:00,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:00,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 222 [2025-01-09 00:12:00,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:00,235 INFO L225 Difference]: With dead ends: 21610 [2025-01-09 00:12:00,235 INFO L226 Difference]: Without dead ends: 12934 [2025-01-09 00:12:00,244 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:12:00,244 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 429 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:00,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 484 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1420 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:12:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12934 states. [2025-01-09 00:12:00,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12934 to 11648. [2025-01-09 00:12:00,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11648 states, 11647 states have (on average 1.199364643255774) internal successors, (13969), 11647 states have internal predecessors, (13969), 0 states have call successors, (0), 0 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:12:00,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11648 states to 11648 states and 13969 transitions. [2025-01-09 00:12:00,382 INFO L78 Accepts]: Start accepts. Automaton has 11648 states and 13969 transitions. Word has length 222 [2025-01-09 00:12:00,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:00,383 INFO L471 AbstractCegarLoop]: Abstraction has 11648 states and 13969 transitions. [2025-01-09 00:12:00,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 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:12:00,383 INFO L276 IsEmpty]: Start isEmpty. Operand 11648 states and 13969 transitions. [2025-01-09 00:12:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-01-09 00:12:00,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:00,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:00,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:12:00,387 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash -536190850, now seen corresponding path program 1 times [2025-01-09 00:12:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390971413] [2025-01-09 00:12:00,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:00,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-01-09 00:12:00,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-01-09 00:12:00,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:00,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390971413] [2025-01-09 00:12:00,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390971413] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:00,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:00,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83177289] [2025-01-09 00:12:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:00,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:00,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:00,607 INFO L87 Difference]: Start difference. First operand 11648 states and 13969 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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:12:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:02,302 INFO L93 Difference]: Finished difference Result 28005 states and 33867 transitions. [2025-01-09 00:12:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:02,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-01-09 00:12:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:02,348 INFO L225 Difference]: With dead ends: 28005 [2025-01-09 00:12:02,348 INFO L226 Difference]: Without dead ends: 15507 [2025-01-09 00:12:02,359 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:12:02,360 INFO L435 NwaCegarLoop]: 819 mSDtfsCounter, 370 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:02,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 894 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:12:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15507 states. [2025-01-09 00:12:02,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15507 to 15499. [2025-01-09 00:12:02,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15499 states, 15498 states have (on average 1.1535682023486902) internal successors, (17878), 15498 states have internal predecessors, (17878), 0 states have call successors, (0), 0 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:12:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15499 states to 15499 states and 17878 transitions. [2025-01-09 00:12:02,506 INFO L78 Accepts]: Start accepts. Automaton has 15499 states and 17878 transitions. Word has length 271 [2025-01-09 00:12:02,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:02,506 INFO L471 AbstractCegarLoop]: Abstraction has 15499 states and 17878 transitions. [2025-01-09 00:12:02,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 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:12:02,507 INFO L276 IsEmpty]: Start isEmpty. Operand 15499 states and 17878 transitions. [2025-01-09 00:12:02,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-01-09 00:12:02,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:02,510 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:02,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:12:02,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:02,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:02,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1669600511, now seen corresponding path program 1 times [2025-01-09 00:12:02,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:02,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759381632] [2025-01-09 00:12:02,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:02,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:02,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 00:12:02,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 00:12:02,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:02,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 244 proven. 70 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 00:12:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759381632] [2025-01-09 00:12:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759381632] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930803333] [2025-01-09 00:12:02,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:02,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:02,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:02,935 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:12:02,938 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:12:02,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-01-09 00:12:03,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-01-09 00:12:03,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:03,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:03,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:12:03,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:12:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 244 proven. 70 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 00:12:03,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:12:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 00:12:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930803333] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:03,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:12:03,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:12:03,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649438573] [2025-01-09 00:12:03,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:03,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:03,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:03,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:03,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:12:03,688 INFO L87 Difference]: Start difference. First operand 15499 states and 17878 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:12:07,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:07,054 INFO L93 Difference]: Finished difference Result 46352 states and 53847 transitions. [2025-01-09 00:12:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:07,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 279 [2025-01-09 00:12:07,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:07,167 INFO L225 Difference]: With dead ends: 46352 [2025-01-09 00:12:07,168 INFO L226 Difference]: Without dead ends: 29994 [2025-01-09 00:12:07,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:12:07,204 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 888 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 3045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 751 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:07,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 162 Invalid, 3045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [751 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-01-09 00:12:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29994 states. [2025-01-09 00:12:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29994 to 28717. [2025-01-09 00:12:07,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28717 states, 28716 states have (on average 1.1380763337512187) internal successors, (32681), 28716 states have internal predecessors, (32681), 0 states have call successors, (0), 0 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:12:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28717 states to 28717 states and 32681 transitions. [2025-01-09 00:12:07,820 INFO L78 Accepts]: Start accepts. Automaton has 28717 states and 32681 transitions. Word has length 279 [2025-01-09 00:12:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:07,824 INFO L471 AbstractCegarLoop]: Abstraction has 28717 states and 32681 transitions. [2025-01-09 00:12:07,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 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:12:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28717 states and 32681 transitions. [2025-01-09 00:12:07,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-09 00:12:07,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:07,828 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:07,836 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:12:08,030 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:12:08,031 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:08,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:08,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1078641970, now seen corresponding path program 1 times [2025-01-09 00:12:08,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:08,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071011593] [2025-01-09 00:12:08,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:08,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 00:12:08,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 00:12:08,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:08,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 301 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-09 00:12:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071011593] [2025-01-09 00:12:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071011593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033716384] [2025-01-09 00:12:08,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:08,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:08,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:08,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:08,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:08,366 INFO L87 Difference]: Start difference. First operand 28717 states and 32681 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:12:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:09,836 INFO L93 Difference]: Finished difference Result 62951 states and 71863 transitions. [2025-01-09 00:12:09,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:09,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 292 [2025-01-09 00:12:09,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:09,879 INFO L225 Difference]: With dead ends: 62951 [2025-01-09 00:12:09,880 INFO L226 Difference]: Without dead ends: 33809 [2025-01-09 00:12:09,901 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:12:09,902 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 378 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1193 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:09,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 841 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1193 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:12:10,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33809 states. [2025-01-09 00:12:10,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33809 to 33809. [2025-01-09 00:12:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33809 states, 33808 states have (on average 1.1168066729768102) internal successors, (37757), 33808 states have internal predecessors, (37757), 0 states have call successors, (0), 0 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:12:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33809 states to 33809 states and 37757 transitions. [2025-01-09 00:12:10,269 INFO L78 Accepts]: Start accepts. Automaton has 33809 states and 37757 transitions. Word has length 292 [2025-01-09 00:12:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:10,269 INFO L471 AbstractCegarLoop]: Abstraction has 33809 states and 37757 transitions. [2025-01-09 00:12:10,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:12:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 33809 states and 37757 transitions. [2025-01-09 00:12:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 00:12:10,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:10,274 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:10,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:12:10,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:10,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash 404586334, now seen corresponding path program 1 times [2025-01-09 00:12:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:10,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194497921] [2025-01-09 00:12:10,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:10,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:10,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 00:12:10,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 00:12:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 266 proven. 78 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 00:12:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:10,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194497921] [2025-01-09 00:12:10,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194497921] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:10,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264691709] [2025-01-09 00:12:10,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:10,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:10,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:10,865 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:12:10,869 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:12:10,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 00:12:10,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 00:12:10,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:10,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:10,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:12:10,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:12:11,199 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 266 proven. 78 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 00:12:11,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:12:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-09 00:12:11,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264691709] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:11,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:12:11,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:12:11,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475152800] [2025-01-09 00:12:11,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:11,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:11,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:11,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:11,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:12:11,401 INFO L87 Difference]: Start difference. First operand 33809 states and 37757 transitions. Second operand has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:12:13,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:13,983 INFO L93 Difference]: Finished difference Result 83397 states and 93151 transitions. [2025-01-09 00:12:13,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:13,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2025-01-09 00:12:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:14,040 INFO L225 Difference]: With dead ends: 83397 [2025-01-09 00:12:14,040 INFO L226 Difference]: Without dead ends: 49163 [2025-01-09 00:12:14,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 697 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:12:14,060 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 875 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:14,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 182 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 00:12:14,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49163 states. [2025-01-09 00:12:14,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49163 to 46610. [2025-01-09 00:12:14,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46610 states, 46609 states have (on average 1.1194619064987448) internal successors, (52177), 46609 states have internal predecessors, (52177), 0 states have call successors, (0), 0 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:12:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46610 states to 46610 states and 52177 transitions. [2025-01-09 00:12:14,634 INFO L78 Accepts]: Start accepts. Automaton has 46610 states and 52177 transitions. Word has length 350 [2025-01-09 00:12:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 46610 states and 52177 transitions. [2025-01-09 00:12:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.5) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:12:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 46610 states and 52177 transitions. [2025-01-09 00:12:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2025-01-09 00:12:14,645 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:14,645 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:14,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:12:14,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:14,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:14,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1165976665, now seen corresponding path program 1 times [2025-01-09 00:12:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:14,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255697696] [2025-01-09 00:12:14,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:14,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 450 statements into 1 equivalence classes. [2025-01-09 00:12:14,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 450 of 450 statements. [2025-01-09 00:12:14,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:14,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 472 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-01-09 00:12:15,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:15,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255697696] [2025-01-09 00:12:15,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255697696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:15,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:15,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:15,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200424675] [2025-01-09 00:12:15,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:15,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:15,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:15,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:15,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:15,086 INFO L87 Difference]: Start difference. First operand 46610 states and 52177 transitions. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:12:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:16,779 INFO L93 Difference]: Finished difference Result 106835 states and 120197 transitions. [2025-01-09 00:12:16,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:16,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 450 [2025-01-09 00:12:16,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:16,836 INFO L225 Difference]: With dead ends: 106835 [2025-01-09 00:12:16,836 INFO L226 Difference]: Without dead ends: 58525 [2025-01-09 00:12:16,865 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:12:16,866 INFO L435 NwaCegarLoop]: 726 mSDtfsCounter, 338 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 258 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 258 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:16,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 785 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [258 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:12:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58525 states. [2025-01-09 00:12:17,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58525 to 46141. [2025-01-09 00:12:17,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46141 states, 46140 states have (on average 1.1168183788469874) internal successors, (51530), 46140 states have internal predecessors, (51530), 0 states have call successors, (0), 0 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:12:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46141 states to 46141 states and 51530 transitions. [2025-01-09 00:12:17,265 INFO L78 Accepts]: Start accepts. Automaton has 46141 states and 51530 transitions. Word has length 450 [2025-01-09 00:12:17,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:17,266 INFO L471 AbstractCegarLoop]: Abstraction has 46141 states and 51530 transitions. [2025-01-09 00:12:17,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:12:17,266 INFO L276 IsEmpty]: Start isEmpty. Operand 46141 states and 51530 transitions. [2025-01-09 00:12:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-01-09 00:12:17,272 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:17,272 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 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] [2025-01-09 00:12:17,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:12:17,273 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:17,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash -721862017, now seen corresponding path program 1 times [2025-01-09 00:12:17,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:17,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389430262] [2025-01-09 00:12:17,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:17,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-01-09 00:12:17,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-01-09 00:12:17,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:17,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:17,583 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-01-09 00:12:17,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389430262] [2025-01-09 00:12:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389430262] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964725731] [2025-01-09 00:12:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:17,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:17,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:17,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:17,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:17,585 INFO L87 Difference]: Start difference. First operand 46141 states and 51530 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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:12:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:19,231 INFO L93 Difference]: Finished difference Result 105084 states and 117084 transitions. [2025-01-09 00:12:19,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:19,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 451 [2025-01-09 00:12:19,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:19,296 INFO L225 Difference]: With dead ends: 105084 [2025-01-09 00:12:19,296 INFO L226 Difference]: Without dead ends: 58519 [2025-01-09 00:12:19,328 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:12:19,329 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 437 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:19,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 346 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:12:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58519 states. [2025-01-09 00:12:19,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58519 to 46989. [2025-01-09 00:12:19,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46989 states, 46988 states have (on average 1.1142632161402912) internal successors, (52357), 46988 states have internal predecessors, (52357), 0 states have call successors, (0), 0 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:12:19,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46989 states to 46989 states and 52357 transitions. [2025-01-09 00:12:19,855 INFO L78 Accepts]: Start accepts. Automaton has 46989 states and 52357 transitions. Word has length 451 [2025-01-09 00:12:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:19,856 INFO L471 AbstractCegarLoop]: Abstraction has 46989 states and 52357 transitions. [2025-01-09 00:12:19,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 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:12:19,856 INFO L276 IsEmpty]: Start isEmpty. Operand 46989 states and 52357 transitions. [2025-01-09 00:12:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-01-09 00:12:19,863 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:19,863 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-01-09 00:12:19,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:12:19,864 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:19,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:19,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1196059917, now seen corresponding path program 1 times [2025-01-09 00:12:19,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:19,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238206140] [2025-01-09 00:12:19,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:19,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:19,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-01-09 00:12:19,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-01-09 00:12:19,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:19,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:20,010 INFO L134 CoverageAnalysis]: Checked inductivity of 701 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 00:12:20,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:20,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238206140] [2025-01-09 00:12:20,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238206140] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:20,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:20,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:20,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444438322] [2025-01-09 00:12:20,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:20,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:20,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:20,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:20,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:20,012 INFO L87 Difference]: Start difference. First operand 46989 states and 52357 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:21,618 INFO L93 Difference]: Finished difference Result 108031 states and 120333 transitions. [2025-01-09 00:12:21,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:21,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 478 [2025-01-09 00:12:21,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:21,685 INFO L225 Difference]: With dead ends: 108031 [2025-01-09 00:12:21,686 INFO L226 Difference]: Without dead ends: 60618 [2025-01-09 00:12:21,712 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:12:21,713 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 490 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 1523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:21,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 296 Invalid, 1523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:12:21,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60618 states. [2025-01-09 00:12:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60618 to 46965. [2025-01-09 00:12:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46965 states, 46964 states have (on average 1.1060173750106463) internal successors, (51943), 46964 states have internal predecessors, (51943), 0 states have call successors, (0), 0 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:12:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46965 states to 46965 states and 51943 transitions. [2025-01-09 00:12:22,303 INFO L78 Accepts]: Start accepts. Automaton has 46965 states and 51943 transitions. Word has length 478 [2025-01-09 00:12:22,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:22,304 INFO L471 AbstractCegarLoop]: Abstraction has 46965 states and 51943 transitions. [2025-01-09 00:12:22,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:22,304 INFO L276 IsEmpty]: Start isEmpty. Operand 46965 states and 51943 transitions. [2025-01-09 00:12:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2025-01-09 00:12:22,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:22,316 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:22,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:12:22,319 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:22,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:22,320 INFO L85 PathProgramCache]: Analyzing trace with hash 617872843, now seen corresponding path program 1 times [2025-01-09 00:12:22,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:22,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112977732] [2025-01-09 00:12:22,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:22,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:22,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 490 statements into 1 equivalence classes. [2025-01-09 00:12:22,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 490 of 490 statements. [2025-01-09 00:12:22,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:22,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:12:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:22,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112977732] [2025-01-09 00:12:22,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112977732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:22,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:22,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:22,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694189274] [2025-01-09 00:12:22,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:22,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:22,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:22,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:22,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:22,695 INFO L87 Difference]: Start difference. First operand 46965 states and 51943 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:12:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:24,250 INFO L93 Difference]: Finished difference Result 107130 states and 118398 transitions. [2025-01-09 00:12:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:24,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 490 [2025-01-09 00:12:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:24,310 INFO L225 Difference]: With dead ends: 107130 [2025-01-09 00:12:24,311 INFO L226 Difference]: Without dead ends: 59735 [2025-01-09 00:12:24,341 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:12:24,343 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 466 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:24,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 166 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:12:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59735 states. [2025-01-09 00:12:24,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59735 to 56738. [2025-01-09 00:12:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56738 states, 56737 states have (on average 1.1049932143045984) internal successors, (62694), 56737 states have internal predecessors, (62694), 0 states have call successors, (0), 0 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:12:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56738 states to 56738 states and 62694 transitions. [2025-01-09 00:12:24,825 INFO L78 Accepts]: Start accepts. Automaton has 56738 states and 62694 transitions. Word has length 490 [2025-01-09 00:12:24,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:24,828 INFO L471 AbstractCegarLoop]: Abstraction has 56738 states and 62694 transitions. [2025-01-09 00:12:24,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 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:12:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 56738 states and 62694 transitions. [2025-01-09 00:12:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2025-01-09 00:12:24,844 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:24,845 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:24,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:12:24,845 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:24,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash -2139324210, now seen corresponding path program 1 times [2025-01-09 00:12:24,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:24,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182880103] [2025-01-09 00:12:24,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:24,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:24,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 511 statements into 1 equivalence classes. [2025-01-09 00:12:24,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 511 of 511 statements. [2025-01-09 00:12:24,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:24,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 427 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:25,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182880103] [2025-01-09 00:12:25,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182880103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:25,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:25,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:12:25,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254026527] [2025-01-09 00:12:25,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:25,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:25,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:25,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:12:25,266 INFO L87 Difference]: Start difference. First operand 56738 states and 62694 transitions. Second operand has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:12:27,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:27,328 INFO L93 Difference]: Finished difference Result 137767 states and 152061 transitions. [2025-01-09 00:12:27,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:27,328 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 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 511 [2025-01-09 00:12:27,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:27,404 INFO L225 Difference]: With dead ends: 137767 [2025-01-09 00:12:27,404 INFO L226 Difference]: Without dead ends: 81031 [2025-01-09 00:12:27,441 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:12:27,442 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 640 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2333 mSolverCounterSat, 439 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 2772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 439 IncrementalHoareTripleChecker+Valid, 2333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:27,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 174 Invalid, 2772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [439 Valid, 2333 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:12:27,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81031 states. [2025-01-09 00:12:28,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81031 to 75493. [2025-01-09 00:12:28,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75493 states, 75492 states have (on average 1.1053489111429025) internal successors, (83445), 75492 states have internal predecessors, (83445), 0 states have call successors, (0), 0 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:12:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75493 states to 75493 states and 83445 transitions. [2025-01-09 00:12:28,175 INFO L78 Accepts]: Start accepts. Automaton has 75493 states and 83445 transitions. Word has length 511 [2025-01-09 00:12:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:28,175 INFO L471 AbstractCegarLoop]: Abstraction has 75493 states and 83445 transitions. [2025-01-09 00:12:28,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 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:12:28,176 INFO L276 IsEmpty]: Start isEmpty. Operand 75493 states and 83445 transitions. [2025-01-09 00:12:28,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2025-01-09 00:12:28,185 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:28,186 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:28,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:12:28,186 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:28,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1809765389, now seen corresponding path program 1 times [2025-01-09 00:12:28,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:28,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67595609] [2025-01-09 00:12:28,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:28,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 554 statements into 1 equivalence classes. [2025-01-09 00:12:28,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 554 of 554 statements. [2025-01-09 00:12:28,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-01-09 00:12:28,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67595609] [2025-01-09 00:12:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67595609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:28,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574626606] [2025-01-09 00:12:28,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:28,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:28,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:28,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:28,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:28,779 INFO L87 Difference]: Start difference. First operand 75493 states and 83445 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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:12:30,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:30,557 INFO L93 Difference]: Finished difference Result 161618 states and 178363 transitions. [2025-01-09 00:12:30,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:30,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 554 [2025-01-09 00:12:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:30,640 INFO L225 Difference]: With dead ends: 161618 [2025-01-09 00:12:30,640 INFO L226 Difference]: Without dead ends: 85701 [2025-01-09 00:12:30,676 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:12:30,677 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 422 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:30,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 361 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:12:30,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85701 states. [2025-01-09 00:12:31,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85701 to 81017. [2025-01-09 00:12:31,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81017 states, 81016 states have (on average 1.0992149698824925) internal successors, (89054), 81016 states have internal predecessors, (89054), 0 states have call successors, (0), 0 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:12:31,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81017 states to 81017 states and 89054 transitions. [2025-01-09 00:12:31,552 INFO L78 Accepts]: Start accepts. Automaton has 81017 states and 89054 transitions. Word has length 554 [2025-01-09 00:12:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:31,553 INFO L471 AbstractCegarLoop]: Abstraction has 81017 states and 89054 transitions. [2025-01-09 00:12:31,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 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:12:31,553 INFO L276 IsEmpty]: Start isEmpty. Operand 81017 states and 89054 transitions. [2025-01-09 00:12:31,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-01-09 00:12:31,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:31,568 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:31,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:12:31,568 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:31,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:31,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1458135564, now seen corresponding path program 1 times [2025-01-09 00:12:31,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:31,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918567741] [2025-01-09 00:12:31,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:31,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:31,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-01-09 00:12:31,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-01-09 00:12:31,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:31,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:31,776 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:12:31,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:31,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918567741] [2025-01-09 00:12:31,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918567741] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:31,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:31,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:31,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587180186] [2025-01-09 00:12:31,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:31,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:31,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:31,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:31,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:31,777 INFO L87 Difference]: Start difference. First operand 81017 states and 89054 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:12:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:33,121 INFO L93 Difference]: Finished difference Result 161170 states and 177157 transitions. [2025-01-09 00:12:33,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:33,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 559 [2025-01-09 00:12:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:33,207 INFO L225 Difference]: With dead ends: 161170 [2025-01-09 00:12:33,208 INFO L226 Difference]: Without dead ends: 80155 [2025-01-09 00:12:33,254 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:12:33,254 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 443 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:33,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 719 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:12:33,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80155 states. [2025-01-09 00:12:34,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80155 to 77177. [2025-01-09 00:12:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77177 states, 77176 states have (on average 1.0809707681144398) internal successors, (83425), 77176 states have internal predecessors, (83425), 0 states have call successors, (0), 0 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:12:34,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77177 states to 77177 states and 83425 transitions. [2025-01-09 00:12:34,290 INFO L78 Accepts]: Start accepts. Automaton has 77177 states and 83425 transitions. Word has length 559 [2025-01-09 00:12:34,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:34,291 INFO L471 AbstractCegarLoop]: Abstraction has 77177 states and 83425 transitions. [2025-01-09 00:12:34,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 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:12:34,291 INFO L276 IsEmpty]: Start isEmpty. Operand 77177 states and 83425 transitions. [2025-01-09 00:12:34,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-09 00:12:34,304 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:34,304 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:34,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:12:34,304 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:34,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:34,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1453295344, now seen corresponding path program 1 times [2025-01-09 00:12:34,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:34,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231142883] [2025-01-09 00:12:34,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:34,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 00:12:34,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 00:12:34,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:34,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 506 proven. 53 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-01-09 00:12:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231142883] [2025-01-09 00:12:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231142883] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:12:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992607663] [2025-01-09 00:12:35,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:35,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:35,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:35,370 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:12:35,376 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:12:35,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-09 00:12:35,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-09 00:12:35,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:35,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:35,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:12:35,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:12:39,136 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 559 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-01-09 00:12:39,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:12:39,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992607663] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:39,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:12:39,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 00:12:39,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880912423] [2025-01-09 00:12:39,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:39,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:12:39,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:39,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:12:39,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:12:39,141 INFO L87 Difference]: Start difference. First operand 77177 states and 83425 transitions. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:12:43,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:43,464 INFO L93 Difference]: Finished difference Result 172213 states and 185997 transitions. [2025-01-09 00:12:43,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:43,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 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 587 [2025-01-09 00:12:43,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:43,584 INFO L225 Difference]: With dead ends: 172213 [2025-01-09 00:12:43,584 INFO L226 Difference]: Without dead ends: 94184 [2025-01-09 00:12:43,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 591 GetRequests, 585 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:12:43,636 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 744 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 3345 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 744 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 3820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 3345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:43,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [744 Valid, 382 Invalid, 3820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 3345 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 00:12:43,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94184 states. [2025-01-09 00:12:44,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94184 to 81852. [2025-01-09 00:12:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81852 states, 81851 states have (on average 1.0744645758756766) internal successors, (87946), 81851 states have internal predecessors, (87946), 0 states have call successors, (0), 0 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:12:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81852 states to 81852 states and 87946 transitions. [2025-01-09 00:12:44,611 INFO L78 Accepts]: Start accepts. Automaton has 81852 states and 87946 transitions. Word has length 587 [2025-01-09 00:12:44,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:44,612 INFO L471 AbstractCegarLoop]: Abstraction has 81852 states and 87946 transitions. [2025-01-09 00:12:44,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 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:12:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 81852 states and 87946 transitions. [2025-01-09 00:12:44,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2025-01-09 00:12:44,626 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:44,626 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:44,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:12:44,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:12:44,827 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:44,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1736054187, now seen corresponding path program 1 times [2025-01-09 00:12:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:44,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643554196] [2025-01-09 00:12:44,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:44,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes. [2025-01-09 00:12:44,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements. [2025-01-09 00:12:44,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:44,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 640 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:12:45,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:45,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643554196] [2025-01-09 00:12:45,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643554196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:45,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:45,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:12:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704499100] [2025-01-09 00:12:45,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:45,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:45,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:45,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:12:45,251 INFO L87 Difference]: Start difference. First operand 81852 states and 87946 transitions. Second operand has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:12:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:47,319 INFO L93 Difference]: Finished difference Result 177335 states and 190288 transitions. [2025-01-09 00:12:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 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 640 [2025-01-09 00:12:47,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:47,443 INFO L225 Difference]: With dead ends: 177335 [2025-01-09 00:12:47,443 INFO L226 Difference]: Without dead ends: 95485 [2025-01-09 00:12:47,486 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:12:47,487 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 536 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 2238 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 2238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:47,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 643 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 2238 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:12:47,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95485 states. [2025-01-09 00:12:48,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95485 to 91644. [2025-01-09 00:12:48,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91644 states, 91643 states have (on average 1.0732734633305325) internal successors, (98358), 91643 states have internal predecessors, (98358), 0 states have call successors, (0), 0 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:12:48,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91644 states to 91644 states and 98358 transitions. [2025-01-09 00:12:48,566 INFO L78 Accepts]: Start accepts. Automaton has 91644 states and 98358 transitions. Word has length 640 [2025-01-09 00:12:48,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:48,567 INFO L471 AbstractCegarLoop]: Abstraction has 91644 states and 98358 transitions. [2025-01-09 00:12:48,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.75) internal successors, (559), 4 states have internal predecessors, (559), 0 states have call successors, (0), 0 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:12:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 91644 states and 98358 transitions. [2025-01-09 00:12:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-01-09 00:12:48,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:48,600 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:12:48,600 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:48,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 922489697, now seen corresponding path program 1 times [2025-01-09 00:12:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603810965] [2025-01-09 00:12:48,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:48,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:48,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-01-09 00:12:48,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-01-09 00:12:48,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:48,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:49,145 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-01-09 00:12:49,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:49,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603810965] [2025-01-09 00:12:49,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603810965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:49,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:49,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:49,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876121808] [2025-01-09 00:12:49,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:49,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:49,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:49,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:49,147 INFO L87 Difference]: Start difference. First operand 91644 states and 98358 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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:12:51,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:51,052 INFO L93 Difference]: Finished difference Result 190516 states and 204358 transitions. [2025-01-09 00:12:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:51,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 641 [2025-01-09 00:12:51,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:51,162 INFO L225 Difference]: With dead ends: 190516 [2025-01-09 00:12:51,162 INFO L226 Difference]: Without dead ends: 95469 [2025-01-09 00:12:51,206 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:12:51,207 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 502 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:51,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 671 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:12:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95469 states. [2025-01-09 00:12:52,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95469 to 92490. [2025-01-09 00:12:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92490 states, 92489 states have (on average 1.066851193114857) internal successors, (98672), 92489 states have internal predecessors, (98672), 0 states have call successors, (0), 0 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:12:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92490 states to 92490 states and 98672 transitions. [2025-01-09 00:12:52,514 INFO L78 Accepts]: Start accepts. Automaton has 92490 states and 98672 transitions. Word has length 641 [2025-01-09 00:12:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:52,514 INFO L471 AbstractCegarLoop]: Abstraction has 92490 states and 98672 transitions. [2025-01-09 00:12:52,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 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:12:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 92490 states and 98672 transitions. [2025-01-09 00:12:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2025-01-09 00:12:52,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:52,538 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:52,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:12:52,539 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:52,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash 256510807, now seen corresponding path program 1 times [2025-01-09 00:12:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507207905] [2025-01-09 00:12:52,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:52,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 651 statements into 1 equivalence classes. [2025-01-09 00:12:52,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 651 of 651 statements. [2025-01-09 00:12:52,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:52,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:52,934 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-01-09 00:12:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:52,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507207905] [2025-01-09 00:12:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507207905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:52,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:52,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619368502] [2025-01-09 00:12:52,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:52,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:52,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:52,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:52,936 INFO L87 Difference]: Start difference. First operand 92490 states and 98672 transitions. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:12:54,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:54,110 INFO L93 Difference]: Finished difference Result 181560 states and 193729 transitions. [2025-01-09 00:12:54,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:54,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 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 651 [2025-01-09 00:12:54,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:54,206 INFO L225 Difference]: With dead ends: 181560 [2025-01-09 00:12:54,207 INFO L226 Difference]: Without dead ends: 89071 [2025-01-09 00:12:54,255 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:12:54,257 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 407 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:54,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 89 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:12:54,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89071 states. [2025-01-09 00:12:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89071 to 86513. [2025-01-09 00:12:55,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86513 states, 86512 states have (on average 1.0678865359718883) internal successors, (92385), 86512 states have internal predecessors, (92385), 0 states have call successors, (0), 0 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:12:55,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86513 states to 86513 states and 92385 transitions. [2025-01-09 00:12:55,319 INFO L78 Accepts]: Start accepts. Automaton has 86513 states and 92385 transitions. Word has length 651 [2025-01-09 00:12:55,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:55,319 INFO L471 AbstractCegarLoop]: Abstraction has 86513 states and 92385 transitions. [2025-01-09 00:12:55,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 2 states have internal predecessors, (414), 0 states have call successors, (0), 0 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:12:55,320 INFO L276 IsEmpty]: Start isEmpty. Operand 86513 states and 92385 transitions. [2025-01-09 00:12:55,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 00:12:55,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:55,333 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:12:55,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:12:55,334 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:55,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:55,334 INFO L85 PathProgramCache]: Analyzing trace with hash 993928824, now seen corresponding path program 1 times [2025-01-09 00:12:55,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:55,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676313447] [2025-01-09 00:12:55,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:55,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 00:12:55,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 00:12:55,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:55,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 556 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:12:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676313447] [2025-01-09 00:12:56,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676313447] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:56,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:56,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:12:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107367756] [2025-01-09 00:12:56,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:56,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:12:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:56,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:12:56,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:12:56,165 INFO L87 Difference]: Start difference. First operand 86513 states and 92385 transitions. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:12:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:59,040 INFO L93 Difference]: Finished difference Result 199844 states and 212775 transitions. [2025-01-09 00:12:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:12:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 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 664 [2025-01-09 00:12:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:59,185 INFO L225 Difference]: With dead ends: 199844 [2025-01-09 00:12:59,185 INFO L226 Difference]: Without dead ends: 109929 [2025-01-09 00:12:59,210 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:12:59,211 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 732 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 454 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 454 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:59,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 136 Invalid, 2810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [454 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:12:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109929 states. [2025-01-09 00:13:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109929 to 96714. [2025-01-09 00:13:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96714 states, 96713 states have (on average 1.0659477009295544) internal successors, (103091), 96713 states have internal predecessors, (103091), 0 states have call successors, (0), 0 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:13:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96714 states to 96714 states and 103091 transitions. [2025-01-09 00:13:00,138 INFO L78 Accepts]: Start accepts. Automaton has 96714 states and 103091 transitions. Word has length 664 [2025-01-09 00:13:00,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:00,139 INFO L471 AbstractCegarLoop]: Abstraction has 96714 states and 103091 transitions. [2025-01-09 00:13:00,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 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:13:00,139 INFO L276 IsEmpty]: Start isEmpty. Operand 96714 states and 103091 transitions. [2025-01-09 00:13:00,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-01-09 00:13:00,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:00,154 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:00,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:13:00,155 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:00,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:00,155 INFO L85 PathProgramCache]: Analyzing trace with hash -243896068, now seen corresponding path program 1 times [2025-01-09 00:13:00,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:00,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852253791] [2025-01-09 00:13:00,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:00,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:00,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-01-09 00:13:00,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-01-09 00:13:00,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:00,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:00,677 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:13:00,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:00,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852253791] [2025-01-09 00:13:00,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852253791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:00,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:00,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425129742] [2025-01-09 00:13:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:00,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:00,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:00,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:00,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:00,679 INFO L87 Difference]: Start difference. First operand 96714 states and 103091 transitions. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:13:02,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:02,481 INFO L93 Difference]: Finished difference Result 200240 states and 213330 transitions. [2025-01-09 00:13:02,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:02,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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 703 [2025-01-09 00:13:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:02,577 INFO L225 Difference]: With dead ends: 200240 [2025-01-09 00:13:02,577 INFO L226 Difference]: Without dead ends: 103103 [2025-01-09 00:13:02,608 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:13:02,608 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 419 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:02,608 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 240 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:02,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103103 states. [2025-01-09 00:13:03,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103103 to 99692. [2025-01-09 00:13:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99692 states, 99691 states have (on average 1.065622774372812) internal successors, (106233), 99691 states have internal predecessors, (106233), 0 states have call successors, (0), 0 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:13:03,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99692 states to 99692 states and 106233 transitions. [2025-01-09 00:13:03,651 INFO L78 Accepts]: Start accepts. Automaton has 99692 states and 106233 transitions. Word has length 703 [2025-01-09 00:13:03,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:03,652 INFO L471 AbstractCegarLoop]: Abstraction has 99692 states and 106233 transitions. [2025-01-09 00:13:03,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 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:13:03,652 INFO L276 IsEmpty]: Start isEmpty. Operand 99692 states and 106233 transitions. [2025-01-09 00:13:03,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2025-01-09 00:13:03,677 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:03,677 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:03,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:13:03,678 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:03,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:03,678 INFO L85 PathProgramCache]: Analyzing trace with hash -145447464, now seen corresponding path program 1 times [2025-01-09 00:13:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837388520] [2025-01-09 00:13:03,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:03,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 704 statements into 1 equivalence classes. [2025-01-09 00:13:03,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 704 of 704 statements. [2025-01-09 00:13:03,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:03,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 587 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-01-09 00:13:04,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:04,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837388520] [2025-01-09 00:13:04,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837388520] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:04,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:04,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:04,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051461483] [2025-01-09 00:13:04,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:04,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:04,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:04,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:04,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:04,188 INFO L87 Difference]: Start difference. First operand 99692 states and 106233 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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:13:06,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:06,011 INFO L93 Difference]: Finished difference Result 203639 states and 216977 transitions. [2025-01-09 00:13:06,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:06,012 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 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 704 [2025-01-09 00:13:06,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:06,118 INFO L225 Difference]: With dead ends: 203639 [2025-01-09 00:13:06,118 INFO L226 Difference]: Without dead ends: 103524 [2025-01-09 00:13:06,177 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:13:06,178 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 428 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:06,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 190 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:06,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103524 states. [2025-01-09 00:13:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103524 to 95013. [2025-01-09 00:13:07,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95013 states, 95012 states have (on average 1.0640024417968257) internal successors, (101093), 95012 states have internal predecessors, (101093), 0 states have call successors, (0), 0 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:13:07,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95013 states to 95013 states and 101093 transitions. [2025-01-09 00:13:07,207 INFO L78 Accepts]: Start accepts. Automaton has 95013 states and 101093 transitions. Word has length 704 [2025-01-09 00:13:07,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:07,207 INFO L471 AbstractCegarLoop]: Abstraction has 95013 states and 101093 transitions. [2025-01-09 00:13:07,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 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:13:07,207 INFO L276 IsEmpty]: Start isEmpty. Operand 95013 states and 101093 transitions.