./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label33.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/Problem16_label33.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 699c9c8063acd4bd53cef44ad5ead9f63bc9d124723ec1a4a717150e95ac10f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:07:44,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:07:44,708 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:07:44,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:07:44,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:07:44,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:07:44,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:07:44,730 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:07:44,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:07:44,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:07:44,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:07:44,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:07:44,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:07:44,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:07:44,731 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:07:44,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:07:44,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:07:44,731 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:07:44,732 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:44,732 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:44,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:44,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:07:44,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:07:44,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:07:44,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:07:44,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:07:44,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:07:44,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:07:44,734 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 -> 699c9c8063acd4bd53cef44ad5ead9f63bc9d124723ec1a4a717150e95ac10f2 [2025-01-09 00:07:44,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:07:44,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:07:44,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:07:44,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:07:44,986 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:07:44,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label33.c [2025-01-09 00:07:46,220 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/796a597f6/22739a387090415098377734f8e9d2a0/FLAG344832c7c [2025-01-09 00:07:46,714 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:07:46,720 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label33.c [2025-01-09 00:07:46,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/796a597f6/22739a387090415098377734f8e9d2a0/FLAG344832c7c [2025-01-09 00:07:46,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/796a597f6/22739a387090415098377734f8e9d2a0 [2025-01-09 00:07:46,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:07:46,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:07:46,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:46,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:07:46,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:07:46,815 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:46" (1/1) ... [2025-01-09 00:07:46,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@660fd5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:46, skipping insertion in model container [2025-01-09 00:07:46,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:07:46" (1/1) ... [2025-01-09 00:07:46,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:07:47,054 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/Problem16_label33.c[3017,3030] [2025-01-09 00:07:47,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:47,391 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:07:47,402 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/Problem16_label33.c[3017,3030] [2025-01-09 00:07:47,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:07:47,519 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:07:47,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47 WrapperNode [2025-01-09 00:07:47,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:07:47,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:47,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:07:47,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:07:47,527 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:07:47" (1/1) ... [2025-01-09 00:07:47,551 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:07:47" (1/1) ... [2025-01-09 00:07:47,683 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:07:47,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:07:47,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:07:47,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:07:47,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:07:47,693 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,770 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:07:47,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,816 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,839 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,855 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,877 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:07:47,878 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:07:47,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:07:47,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:07:47,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (1/1) ... [2025-01-09 00:07:47,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:07:47,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:47,922 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:07:47,927 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:07:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:07:47,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:07:47,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:07:47,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:07:47,987 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:07:47,988 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:07:49,747 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:07:49,748 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:07:49,771 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:07:49,775 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:07:49,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:49 BoogieIcfgContainer [2025-01-09 00:07:49,776 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:07:49,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:07:49,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:07:49,781 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:07:49,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:07:46" (1/3) ... [2025-01-09 00:07:49,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cce76ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:49, skipping insertion in model container [2025-01-09 00:07:49,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:07:47" (2/3) ... [2025-01-09 00:07:49,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cce76ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:07:49, skipping insertion in model container [2025-01-09 00:07:49,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:07:49" (3/3) ... [2025-01-09 00:07:49,783 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label33.c [2025-01-09 00:07:49,794 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:07:49,795 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label33.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:07:49,864 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:07:49,873 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;@4c2ab319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:07:49,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:07:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:49,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 00:07:49,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:49,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:49,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:49,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:49,897 INFO L85 PathProgramCache]: Analyzing trace with hash 271890780, now seen corresponding path program 1 times [2025-01-09 00:07:49,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:49,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020323841] [2025-01-09 00:07:49,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:49,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:50,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 00:07:50,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 00:07:50,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:50,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:50,223 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:07:50,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020323841] [2025-01-09 00:07:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020323841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:50,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:50,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:50,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993832944] [2025-01-09 00:07:50,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:50,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:50,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:50,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:50,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:50,248 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:52,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:52,536 INFO L93 Difference]: Finished difference Result 1137 states and 2115 transitions. [2025-01-09 00:07:52,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:52,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-01-09 00:07:52,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:52,549 INFO L225 Difference]: With dead ends: 1137 [2025-01-09 00:07:52,549 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:07:52,553 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:07:52,554 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 357 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:52,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:07:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:07:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:07:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:07:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2025-01-09 00:07:52,605 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 27 [2025-01-09 00:07:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:52,606 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2025-01-09 00:07:52,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2025-01-09 00:07:52,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 00:07:52,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:52,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:07:52,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:52,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash 510491196, now seen corresponding path program 1 times [2025-01-09 00:07:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439488551] [2025-01-09 00:07:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:52,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 00:07:52,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 00:07:52,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:52,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:52,793 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:52,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:52,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439488551] [2025-01-09 00:07:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439488551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421855344] [2025-01-09 00:07:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:52,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:52,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:52,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:52,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:52,801 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:54,189 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2025-01-09 00:07:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2025-01-09 00:07:54,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:54,194 INFO L225 Difference]: With dead ends: 1980 [2025-01-09 00:07:54,194 INFO L226 Difference]: Without dead ends: 1320 [2025-01-09 00:07:54,195 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:07:54,196 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 1202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:54,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 218 Invalid, 1202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:07:54,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-01-09 00:07:54,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-01-09 00:07:54,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.4556482183472328) internal successors, (1920), 1319 states have internal predecessors, (1920), 0 states have call successors, (0), 0 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:07:54,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1920 transitions. [2025-01-09 00:07:54,230 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1920 transitions. Word has length 93 [2025-01-09 00:07:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:54,230 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1920 transitions. [2025-01-09 00:07:54,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1920 transitions. [2025-01-09 00:07:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 00:07:54,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:54,232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:54,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:07:54,233 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:54,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:54,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1871122753, now seen corresponding path program 1 times [2025-01-09 00:07:54,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:54,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997627832] [2025-01-09 00:07:54,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:54,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:54,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 00:07:54,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 00:07:54,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:54,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997627832] [2025-01-09 00:07:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997627832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:54,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:54,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:54,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428574250] [2025-01-09 00:07:54,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:54,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:54,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:54,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:54,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:54,379 INFO L87 Difference]: Start difference. First operand 1320 states and 1920 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:07:55,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:55,465 INFO L93 Difference]: Finished difference Result 3954 states and 5755 transitions. [2025-01-09 00:07:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:55,467 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-01-09 00:07:55,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:55,476 INFO L225 Difference]: With dead ends: 3954 [2025-01-09 00:07:55,477 INFO L226 Difference]: Without dead ends: 2636 [2025-01-09 00:07:55,479 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:07:55,482 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 369 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:55,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:07:55,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-01-09 00:07:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-01-09 00:07:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.3240986717267553) internal successors, (3489), 2635 states have internal predecessors, (3489), 0 states have call successors, (0), 0 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:07:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3489 transitions. [2025-01-09 00:07:55,534 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3489 transitions. Word has length 106 [2025-01-09 00:07:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:55,535 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3489 transitions. [2025-01-09 00:07:55,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 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:07:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3489 transitions. [2025-01-09 00:07:55,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 00:07:55,539 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:55,539 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:07:55,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:07:55,539 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:55,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:55,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1846347679, now seen corresponding path program 1 times [2025-01-09 00:07:55,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:55,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95041299] [2025-01-09 00:07:55,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:55,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:55,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 00:07:55,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 00:07:55,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:55,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 00:07:55,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:55,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95041299] [2025-01-09 00:07:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95041299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:55,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:55,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:55,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200626789] [2025-01-09 00:07:55,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:55,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:55,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:55,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:55,864 INFO L87 Difference]: Start difference. First operand 2636 states and 3489 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:07:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:57,091 INFO L93 Difference]: Finished difference Result 6586 states and 8545 transitions. [2025-01-09 00:07:57,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:57,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 224 [2025-01-09 00:07:57,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:57,104 INFO L225 Difference]: With dead ends: 6586 [2025-01-09 00:07:57,105 INFO L226 Difference]: Without dead ends: 3952 [2025-01-09 00:07:57,109 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:07:57,110 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 277 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:57,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 84 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:07:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-01-09 00:07:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2025-01-09 00:07:57,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.216400911161731) internal successors, (4806), 3951 states have internal predecessors, (4806), 0 states have call successors, (0), 0 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:07:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4806 transitions. [2025-01-09 00:07:57,164 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4806 transitions. Word has length 224 [2025-01-09 00:07:57,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:57,165 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4806 transitions. [2025-01-09 00:07:57,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:07:57,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4806 transitions. [2025-01-09 00:07:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 00:07:57,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:57,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:57,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:07:57,169 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:57,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1161251742, now seen corresponding path program 1 times [2025-01-09 00:07:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:57,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966351306] [2025-01-09 00:07:57,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:57,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:57,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 00:07:57,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 00:07:57,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:57,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966351306] [2025-01-09 00:07:57,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966351306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:57,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:57,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:07:57,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067143727] [2025-01-09 00:07:57,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:57,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:57,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:57,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:57,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:57,738 INFO L87 Difference]: Start difference. First operand 3952 states and 4806 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:07:58,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:58,660 INFO L93 Difference]: Finished difference Result 8560 states and 10322 transitions. [2025-01-09 00:07:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:58,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 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 272 [2025-01-09 00:07:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:58,676 INFO L225 Difference]: With dead ends: 8560 [2025-01-09 00:07:58,676 INFO L226 Difference]: Without dead ends: 4610 [2025-01-09 00:07:58,679 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:07:58,681 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:58,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:07:58,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-01-09 00:07:58,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-01-09 00:07:58,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.1933174224343674) internal successors, (5500), 4609 states have internal predecessors, (5500), 0 states have call successors, (0), 0 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:07:58,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 5500 transitions. [2025-01-09 00:07:58,737 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 5500 transitions. Word has length 272 [2025-01-09 00:07:58,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:58,738 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 5500 transitions. [2025-01-09 00:07:58,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 2 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:07:58,739 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 5500 transitions. [2025-01-09 00:07:58,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-09 00:07:58,742 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:58,743 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:58,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:07:58,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:58,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:58,744 INFO L85 PathProgramCache]: Analyzing trace with hash -214158457, now seen corresponding path program 1 times [2025-01-09 00:07:58,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:58,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575498991] [2025-01-09 00:07:58,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:58,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-09 00:07:58,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-09 00:07:58,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:58,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:59,274 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:07:59,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:59,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575498991] [2025-01-09 00:07:59,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575498991] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:59,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:59,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:07:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272386408] [2025-01-09 00:07:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:59,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 00:07:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:59,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 00:07:59,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:07:59,279 INFO L87 Difference]: Start difference. First operand 4610 states and 5500 transitions. Second operand has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 6 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:08:00,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:00,738 INFO L93 Difference]: Finished difference Result 8419 states and 10151 transitions. [2025-01-09 00:08:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 00:08:00,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 6 states have internal predecessors, (359), 0 states have call successors, (0), 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 359 [2025-01-09 00:08:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:00,748 INFO L225 Difference]: With dead ends: 8419 [2025-01-09 00:08:00,748 INFO L226 Difference]: Without dead ends: 4281 [2025-01-09 00:08:00,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:00,753 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 307 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:00,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 287 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:08:00,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-01-09 00:08:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-01-09 00:08:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.0761682242990653) internal successors, (4606), 4280 states have internal predecessors, (4606), 0 states have call successors, (0), 0 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:08:00,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 4606 transitions. [2025-01-09 00:08:00,793 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 4606 transitions. Word has length 359 [2025-01-09 00:08:00,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:00,794 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 4606 transitions. [2025-01-09 00:08:00,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 51.285714285714285) internal successors, (359), 6 states have internal predecessors, (359), 0 states have call successors, (0), 0 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:08:00,794 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 4606 transitions. [2025-01-09 00:08:00,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 00:08:00,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:00,797 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:00,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:08:00,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:00,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -221303132, now seen corresponding path program 1 times [2025-01-09 00:08:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:00,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120172095] [2025-01-09 00:08:00,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:00,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:00,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 00:08:00,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 00:08:00,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:00,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-09 00:08:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:01,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120172095] [2025-01-09 00:08:01,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120172095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:01,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:01,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:01,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201091560] [2025-01-09 00:08:01,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:01,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:01,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:01,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:01,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:01,002 INFO L87 Difference]: Start difference. First operand 4281 states and 4606 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:08:01,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:01,716 INFO L93 Difference]: Finished difference Result 9876 states and 10752 transitions. [2025-01-09 00:08:01,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:01,716 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 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 366 [2025-01-09 00:08:01,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:01,730 INFO L225 Difference]: With dead ends: 9876 [2025-01-09 00:08:01,730 INFO L226 Difference]: Without dead ends: 6255 [2025-01-09 00:08:01,734 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:08:01,735 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 322 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:01,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 40 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2025-01-09 00:08:01,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2025-01-09 00:08:01,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0796290374160538) internal successors, (6752), 6254 states have internal predecessors, (6752), 0 states have call successors, (0), 0 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:08:01,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6752 transitions. [2025-01-09 00:08:01,811 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6752 transitions. Word has length 366 [2025-01-09 00:08:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:01,811 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6752 transitions. [2025-01-09 00:08:01,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 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:08:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6752 transitions. [2025-01-09 00:08:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-09 00:08:01,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:01,818 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:08:01,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:08:01,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:01,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash -774693991, now seen corresponding path program 1 times [2025-01-09 00:08:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:01,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993665611] [2025-01-09 00:08:01,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:01,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 00:08:01,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 00:08:01,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:01,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2025-01-09 00:08:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993665611] [2025-01-09 00:08:02,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993665611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:02,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163364873] [2025-01-09 00:08:02,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:02,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:02,426 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:08:02,430 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:08:02,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-09 00:08:02,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-09 00:08:02,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:02,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:02,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:08:02,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-01-09 00:08:03,154 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163364873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:03,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-09 00:08:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056349677] [2025-01-09 00:08:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:03,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:03,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:03,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:08:03,156 INFO L87 Difference]: Start difference. First operand 6255 states and 6752 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:08:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:03,799 INFO L93 Difference]: Finished difference Result 7902 states and 8448 transitions. [2025-01-09 00:08:03,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:03,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 483 [2025-01-09 00:08:03,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:03,825 INFO L225 Difference]: With dead ends: 7902 [2025-01-09 00:08:03,825 INFO L226 Difference]: Without dead ends: 7900 [2025-01-09 00:08:03,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:08:03,827 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 116 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:03,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 83 Invalid, 780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2025-01-09 00:08:03,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 6584. [2025-01-09 00:08:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.077624183502962) internal successors, (7094), 6583 states have internal predecessors, (7094), 0 states have call successors, (0), 0 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:08:03,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 7094 transitions. [2025-01-09 00:08:03,893 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 7094 transitions. Word has length 483 [2025-01-09 00:08:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 7094 transitions. [2025-01-09 00:08:03,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 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:08:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 7094 transitions. [2025-01-09 00:08:03,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2025-01-09 00:08:03,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:03,909 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:08:03,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 00:08:04,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:04,115 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:04,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:04,119 INFO L85 PathProgramCache]: Analyzing trace with hash 972168724, now seen corresponding path program 1 times [2025-01-09 00:08:04,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:04,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401749145] [2025-01-09 00:08:04,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:04,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:04,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 885 statements into 1 equivalence classes. [2025-01-09 00:08:04,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 885 of 885 statements. [2025-01-09 00:08:04,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:04,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:08:04,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:04,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401749145] [2025-01-09 00:08:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401749145] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558065654] [2025-01-09 00:08:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:04,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:04,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:04,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:04,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:04,940 INFO L87 Difference]: Start difference. First operand 6584 states and 7094 transitions. Second operand has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:08:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:05,911 INFO L93 Difference]: Finished difference Result 14811 states and 16072 transitions. [2025-01-09 00:08:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:05,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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 885 [2025-01-09 00:08:05,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:05,929 INFO L225 Difference]: With dead ends: 14811 [2025-01-09 00:08:05,929 INFO L226 Difference]: Without dead ends: 8887 [2025-01-09 00:08:05,935 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:08:05,936 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 222 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:05,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 438 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:08:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8887 states. [2025-01-09 00:08:06,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8887 to 8558. [2025-01-09 00:08:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.065326633165829) internal successors, (9116), 8557 states have internal predecessors, (9116), 0 states have call successors, (0), 0 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:08:06,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9116 transitions. [2025-01-09 00:08:06,040 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9116 transitions. Word has length 885 [2025-01-09 00:08:06,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:06,041 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9116 transitions. [2025-01-09 00:08:06,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 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:08:06,042 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9116 transitions. [2025-01-09 00:08:06,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2025-01-09 00:08:06,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:06,051 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:08:06,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:08:06,052 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash -867154038, now seen corresponding path program 1 times [2025-01-09 00:08:06,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:06,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390444620] [2025-01-09 00:08:06,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:06,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 886 statements into 1 equivalence classes. [2025-01-09 00:08:06,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 886 of 886 statements. [2025-01-09 00:08:06,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:06,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:06,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 688 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-09 00:08:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:06,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390444620] [2025-01-09 00:08:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390444620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:06,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:06,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:06,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320076257] [2025-01-09 00:08:06,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:06,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:06,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:06,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:06,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:06,476 INFO L87 Difference]: Start difference. First operand 8558 states and 9116 transitions. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 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:08:07,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:07,244 INFO L93 Difference]: Finished difference Result 20733 states and 22230 transitions. [2025-01-09 00:08:07,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:07,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 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 886 [2025-01-09 00:08:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:07,283 INFO L225 Difference]: With dead ends: 20733 [2025-01-09 00:08:07,286 INFO L226 Difference]: Without dead ends: 11190 [2025-01-09 00:08:07,300 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:08:07,301 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 143 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:07,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:07,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11190 states. [2025-01-09 00:08:07,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11190 to 11190. [2025-01-09 00:08:07,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11190 states, 11189 states have (on average 1.0542497095361516) internal successors, (11796), 11189 states have internal predecessors, (11796), 0 states have call successors, (0), 0 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:08:07,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11190 states to 11190 states and 11796 transitions. [2025-01-09 00:08:07,396 INFO L78 Accepts]: Start accepts. Automaton has 11190 states and 11796 transitions. Word has length 886 [2025-01-09 00:08:07,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:07,454 INFO L471 AbstractCegarLoop]: Abstraction has 11190 states and 11796 transitions. [2025-01-09 00:08:07,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 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:08:07,455 INFO L276 IsEmpty]: Start isEmpty. Operand 11190 states and 11796 transitions. [2025-01-09 00:08:07,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1200 [2025-01-09 00:08:07,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:07,471 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:07,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:08:07,472 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:07,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:07,473 INFO L85 PathProgramCache]: Analyzing trace with hash -281237776, now seen corresponding path program 1 times [2025-01-09 00:08:07,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:07,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829944424] [2025-01-09 00:08:07,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:07,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:07,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1199 statements into 1 equivalence classes. [2025-01-09 00:08:07,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1199 of 1199 statements. [2025-01-09 00:08:07,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:07,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:08,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2587 backedges. 1810 proven. 0 refuted. 0 times theorem prover too weak. 777 trivial. 0 not checked. [2025-01-09 00:08:08,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:08,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829944424] [2025-01-09 00:08:08,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829944424] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:08,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:08,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 00:08:08,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521254340] [2025-01-09 00:08:08,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:08,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 00:08:08,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:08,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 00:08:08,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:08:08,610 INFO L87 Difference]: Start difference. First operand 11190 states and 11796 transitions. Second operand has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 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:08:09,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:09,673 INFO L93 Difference]: Finished difference Result 22379 states and 23609 transitions. [2025-01-09 00:08:09,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 00:08:09,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 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 1199 [2025-01-09 00:08:09,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:09,688 INFO L225 Difference]: With dead ends: 22379 [2025-01-09 00:08:09,688 INFO L226 Difference]: Without dead ends: 11849 [2025-01-09 00:08:09,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:08:09,696 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 565 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:09,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 566 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:08:09,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11849 states. [2025-01-09 00:08:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11849 to 11848. [2025-01-09 00:08:09,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0516586477589263) internal successors, (12459), 11847 states have internal predecessors, (12459), 0 states have call successors, (0), 0 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:08:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12459 transitions. [2025-01-09 00:08:09,783 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12459 transitions. Word has length 1199 [2025-01-09 00:08:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:09,784 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12459 transitions. [2025-01-09 00:08:09,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.5) internal successors, (693), 6 states have internal predecessors, (693), 0 states have call successors, (0), 0 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:08:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12459 transitions. [2025-01-09 00:08:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2025-01-09 00:08:09,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:09,798 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:09,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:08:09,798 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:09,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1167164808, now seen corresponding path program 1 times [2025-01-09 00:08:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120592513] [2025-01-09 00:08:09,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:09,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:09,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1213 statements into 1 equivalence classes. [2025-01-09 00:08:09,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1213 of 1213 statements. [2025-01-09 00:08:09,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:09,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2467 backedges. 1727 proven. 0 refuted. 0 times theorem prover too weak. 740 trivial. 0 not checked. [2025-01-09 00:08:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120592513] [2025-01-09 00:08:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120592513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:08:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745585920] [2025-01-09 00:08:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:08:10,920 INFO L87 Difference]: Start difference. First operand 11848 states and 12459 transitions. Second operand has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:08:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:11,776 INFO L93 Difference]: Finished difference Result 23046 states and 24259 transitions. [2025-01-09 00:08:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:08:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 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 1213 [2025-01-09 00:08:11,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:11,791 INFO L225 Difference]: With dead ends: 23046 [2025-01-09 00:08:11,791 INFO L226 Difference]: Without dead ends: 11858 [2025-01-09 00:08:11,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:08:11,800 INFO L435 NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:11,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11858 states. [2025-01-09 00:08:11,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11858 to 11519. [2025-01-09 00:08:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11519 states, 11518 states have (on average 1.0523528390345547) internal successors, (12121), 11518 states have internal predecessors, (12121), 0 states have call successors, (0), 0 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:08:11,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 12121 transitions. [2025-01-09 00:08:11,880 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 12121 transitions. Word has length 1213 [2025-01-09 00:08:11,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:11,881 INFO L471 AbstractCegarLoop]: Abstraction has 11519 states and 12121 transitions. [2025-01-09 00:08:11,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 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:08:11,881 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 12121 transitions. [2025-01-09 00:08:11,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1216 [2025-01-09 00:08:11,895 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:11,895 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:11,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:08:11,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:11,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:11,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1588445553, now seen corresponding path program 1 times [2025-01-09 00:08:11,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:11,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546738114] [2025-01-09 00:08:11,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:11,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:11,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1215 statements into 1 equivalence classes. [2025-01-09 00:08:11,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1215 of 1215 statements. [2025-01-09 00:08:11,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:11,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2782 backedges. 969 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-01-09 00:08:12,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:12,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546738114] [2025-01-09 00:08:12,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546738114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:12,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:12,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:12,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711250648] [2025-01-09 00:08:12,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:12,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:12,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:12,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:12,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:12,654 INFO L87 Difference]: Start difference. First operand 11519 states and 12121 transitions. Second operand has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 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:08:13,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:13,644 INFO L93 Difference]: Finished difference Result 25339 states and 26717 transitions. [2025-01-09 00:08:13,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:13,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 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 1215 [2025-01-09 00:08:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:13,663 INFO L225 Difference]: With dead ends: 25339 [2025-01-09 00:08:13,663 INFO L226 Difference]: Without dead ends: 13164 [2025-01-09 00:08:13,674 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:08:13,675 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 172 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:13,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 410 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:08:13,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2025-01-09 00:08:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 12835. [2025-01-09 00:08:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.040984883902135) internal successors, (13360), 12834 states have internal predecessors, (13360), 0 states have call successors, (0), 0 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:08:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13360 transitions. [2025-01-09 00:08:13,821 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13360 transitions. Word has length 1215 [2025-01-09 00:08:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:13,822 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13360 transitions. [2025-01-09 00:08:13,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 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:08:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13360 transitions. [2025-01-09 00:08:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1308 [2025-01-09 00:08:13,849 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:13,850 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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:08:13,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:08:13,850 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:13,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:13,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1381126221, now seen corresponding path program 1 times [2025-01-09 00:08:13,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:13,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076038185] [2025-01-09 00:08:13,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:13,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1307 statements into 1 equivalence classes. [2025-01-09 00:08:14,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1307 of 1307 statements. [2025-01-09 00:08:14,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:14,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2928 backedges. 2096 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2025-01-09 00:08:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076038185] [2025-01-09 00:08:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076038185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662424773] [2025-01-09 00:08:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:14,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:14,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:14,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:14,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:14,563 INFO L87 Difference]: Start difference. First operand 12835 states and 13360 transitions. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:08:15,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:15,294 INFO L93 Difference]: Finished difference Result 28629 states and 29878 transitions. [2025-01-09 00:08:15,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:15,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 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 1307 [2025-01-09 00:08:15,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:15,311 INFO L225 Difference]: With dead ends: 28629 [2025-01-09 00:08:15,311 INFO L226 Difference]: Without dead ends: 16125 [2025-01-09 00:08:15,320 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:08:15,321 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:15,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 431 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2025-01-09 00:08:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2025-01-09 00:08:15,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0391342098734806) internal successors, (16755), 16124 states have internal predecessors, (16755), 0 states have call successors, (0), 0 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:08:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16755 transitions. [2025-01-09 00:08:15,438 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16755 transitions. Word has length 1307 [2025-01-09 00:08:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:15,438 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16755 transitions. [2025-01-09 00:08:15,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 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:08:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16755 transitions. [2025-01-09 00:08:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1333 [2025-01-09 00:08:15,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:15,456 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 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:08:15,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:08:15,456 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:15,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1207567740, now seen corresponding path program 1 times [2025-01-09 00:08:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:15,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512671006] [2025-01-09 00:08:15,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:15,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1332 statements into 1 equivalence classes. [2025-01-09 00:08:15,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1332 of 1332 statements. [2025-01-09 00:08:15,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:15,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3054 backedges. 2144 proven. 0 refuted. 0 times theorem prover too weak. 910 trivial. 0 not checked. [2025-01-09 00:08:16,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:16,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512671006] [2025-01-09 00:08:16,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512671006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:16,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:16,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:08:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994825623] [2025-01-09 00:08:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:16,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:16,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:16,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:16,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:08:16,368 INFO L87 Difference]: Start difference. First operand 16125 states and 16755 transitions. Second operand has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:08:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:17,245 INFO L93 Difference]: Finished difference Result 31590 states and 32841 transitions. [2025-01-09 00:08:17,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:08:17,246 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 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 1332 [2025-01-09 00:08:17,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:17,263 INFO L225 Difference]: With dead ends: 31590 [2025-01-09 00:08:17,263 INFO L226 Difference]: Without dead ends: 16125 [2025-01-09 00:08:17,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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:08:17,277 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 1323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:17,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 555 Invalid, 1323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2025-01-09 00:08:17,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2025-01-09 00:08:17,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.038389977673034) internal successors, (16743), 16124 states have internal predecessors, (16743), 0 states have call successors, (0), 0 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:08:17,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16743 transitions. [2025-01-09 00:08:17,511 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16743 transitions. Word has length 1332 [2025-01-09 00:08:17,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:17,512 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16743 transitions. [2025-01-09 00:08:17,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 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:08:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16743 transitions. [2025-01-09 00:08:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1358 [2025-01-09 00:08:17,526 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:17,527 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:17,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:08:17,527 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 187453547, now seen corresponding path program 1 times [2025-01-09 00:08:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596827117] [2025-01-09 00:08:17,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:17,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:17,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1357 statements into 1 equivalence classes. [2025-01-09 00:08:17,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1357 of 1357 statements. [2025-01-09 00:08:17,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:17,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2934 backedges. 1711 proven. 0 refuted. 0 times theorem prover too weak. 1223 trivial. 0 not checked. [2025-01-09 00:08:18,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:18,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596827117] [2025-01-09 00:08:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596827117] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:18,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120545777] [2025-01-09 00:08:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:18,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:18,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:18,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:18,624 INFO L87 Difference]: Start difference. First operand 16125 states and 16743 transitions. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:08:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:19,181 INFO L93 Difference]: Finished difference Result 31590 states and 32817 transitions. [2025-01-09 00:08:19,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:19,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1357 [2025-01-09 00:08:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:19,196 INFO L225 Difference]: With dead ends: 31590 [2025-01-09 00:08:19,196 INFO L226 Difference]: Without dead ends: 16125 [2025-01-09 00:08:19,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:08:19,205 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:19,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:08:19,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2025-01-09 00:08:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2025-01-09 00:08:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16125 states, 16124 states have (on average 1.0359712230215827) internal successors, (16704), 16124 states have internal predecessors, (16704), 0 states have call successors, (0), 0 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:08:19,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 16704 transitions. [2025-01-09 00:08:19,320 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 16704 transitions. Word has length 1357 [2025-01-09 00:08:19,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:19,321 INFO L471 AbstractCegarLoop]: Abstraction has 16125 states and 16704 transitions. [2025-01-09 00:08:19,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:08:19,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 16704 transitions. [2025-01-09 00:08:19,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1394 [2025-01-09 00:08:19,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:19,413 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:19,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:08:19,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:19,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:19,414 INFO L85 PathProgramCache]: Analyzing trace with hash 989417249, now seen corresponding path program 1 times [2025-01-09 00:08:19,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:19,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676095147] [2025-01-09 00:08:19,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:19,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:19,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1393 statements into 1 equivalence classes. [2025-01-09 00:08:19,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1393 of 1393 statements. [2025-01-09 00:08:19,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:19,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:20,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3336 backedges. 2208 proven. 0 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-01-09 00:08:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:20,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676095147] [2025-01-09 00:08:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676095147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:20,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111420328] [2025-01-09 00:08:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:20,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:20,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:20,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:20,106 INFO L87 Difference]: Start difference. First operand 16125 states and 16704 transitions. Second operand has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:08:20,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:20,855 INFO L93 Difference]: Finished difference Result 32906 states and 34119 transitions. [2025-01-09 00:08:20,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:20,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 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 1393 [2025-01-09 00:08:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:20,872 INFO L225 Difference]: With dead ends: 32906 [2025-01-09 00:08:20,873 INFO L226 Difference]: Without dead ends: 17441 [2025-01-09 00:08:20,884 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:08:20,885 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 208 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:20,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 395 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-01-09 00:08:20,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 17441. [2025-01-09 00:08:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0307339449541284) internal successors, (17976), 17440 states have internal predecessors, (17976), 0 states have call successors, (0), 0 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:08:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17976 transitions. [2025-01-09 00:08:21,018 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17976 transitions. Word has length 1393 [2025-01-09 00:08:21,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:21,018 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17976 transitions. [2025-01-09 00:08:21,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.66666666666666) internal successors, (668), 3 states have internal predecessors, (668), 0 states have call successors, (0), 0 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:08:21,018 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17976 transitions. [2025-01-09 00:08:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1395 [2025-01-09 00:08:21,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:21,035 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:21,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:08:21,035 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:21,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:21,036 INFO L85 PathProgramCache]: Analyzing trace with hash 63098263, now seen corresponding path program 1 times [2025-01-09 00:08:21,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:21,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745499273] [2025-01-09 00:08:21,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:21,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1394 statements into 1 equivalence classes. [2025-01-09 00:08:21,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1394 of 1394 statements. [2025-01-09 00:08:21,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:21,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2961 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 2812 trivial. 0 not checked. [2025-01-09 00:08:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:21,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745499273] [2025-01-09 00:08:21,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745499273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:21,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250468720] [2025-01-09 00:08:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:21,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:21,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:21,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:21,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:21,681 INFO L87 Difference]: Start difference. First operand 17441 states and 17976 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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:08:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:22,247 INFO L93 Difference]: Finished difference Result 35538 states and 36626 transitions. [2025-01-09 00:08:22,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:22,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 1394 [2025-01-09 00:08:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:22,263 INFO L225 Difference]: With dead ends: 35538 [2025-01-09 00:08:22,263 INFO L226 Difference]: Without dead ends: 17112 [2025-01-09 00:08:22,275 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:08:22,275 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 309 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:22,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 418 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:08:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-01-09 00:08:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 15467. [2025-01-09 00:08:22,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0245053666106299) internal successors, (15845), 15466 states have internal predecessors, (15845), 0 states have call successors, (0), 0 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:08:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15845 transitions. [2025-01-09 00:08:22,406 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15845 transitions. Word has length 1394 [2025-01-09 00:08:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:22,407 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15845 transitions. [2025-01-09 00:08:22,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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:08:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15845 transitions. [2025-01-09 00:08:22,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1688 [2025-01-09 00:08:22,448 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:22,448 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:22,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:08:22,453 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:22,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:22,454 INFO L85 PathProgramCache]: Analyzing trace with hash -110455105, now seen corresponding path program 1 times [2025-01-09 00:08:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599412871] [2025-01-09 00:08:22,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:22,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:22,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1687 statements into 1 equivalence classes. [2025-01-09 00:08:22,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1687 of 1687 statements. [2025-01-09 00:08:22,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:22,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:25,666 INFO L134 CoverageAnalysis]: Checked inductivity of 4923 backedges. 3062 proven. 1053 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2025-01-09 00:08:25,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599412871] [2025-01-09 00:08:25,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599412871] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:25,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023487175] [2025-01-09 00:08:25,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:25,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:25,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:25,671 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:08:25,676 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:08:25,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1687 statements into 1 equivalence classes. [2025-01-09 00:08:25,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1687 of 1687 statements. [2025-01-09 00:08:25,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:25,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:25,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1911 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:08:26,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:28,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4923 backedges. 2297 proven. 201 refuted. 0 times theorem prover too weak. 2425 trivial. 0 not checked. [2025-01-09 00:08:28,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:08:32,229 INFO L134 CoverageAnalysis]: Checked inductivity of 4923 backedges. 2297 proven. 201 refuted. 0 times theorem prover too weak. 2425 trivial. 0 not checked. [2025-01-09 00:08:32,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023487175] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:08:32,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:08:32,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 3, 3] total 11 [2025-01-09 00:08:32,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406834273] [2025-01-09 00:08:32,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:08:32,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 00:08:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:32,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 00:08:32,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-09 00:08:32,233 INFO L87 Difference]: Start difference. First operand 15467 states and 15845 transitions. Second operand has 11 states, 11 states have (on average 183.0909090909091) internal successors, (2014), 11 states have internal predecessors, (2014), 0 states have call successors, (0), 0 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:08:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:36,458 INFO L93 Difference]: Finished difference Result 29948 states and 30687 transitions. [2025-01-09 00:08:36,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:08:36,458 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 183.0909090909091) internal successors, (2014), 11 states have internal predecessors, (2014), 0 states have call successors, (0), 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 1687 [2025-01-09 00:08:36,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:36,471 INFO L225 Difference]: With dead ends: 29948 [2025-01-09 00:08:36,471 INFO L226 Difference]: Without dead ends: 15141 [2025-01-09 00:08:36,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3399 GetRequests, 3381 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=255, Unknown=0, NotChecked=0, Total=380 [2025-01-09 00:08:36,479 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 2554 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6680 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2554 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 6909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 6680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:36,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2554 Valid, 92 Invalid, 6909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 6680 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 00:08:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15141 states. [2025-01-09 00:08:36,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15141 to 15138. [2025-01-09 00:08:36,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.019224416991478) internal successors, (15428), 15137 states have internal predecessors, (15428), 0 states have call successors, (0), 0 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:08:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15428 transitions. [2025-01-09 00:08:36,624 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15428 transitions. Word has length 1687 [2025-01-09 00:08:36,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:36,625 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15428 transitions. [2025-01-09 00:08:36,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 183.0909090909091) internal successors, (2014), 11 states have internal predecessors, (2014), 0 states have call successors, (0), 0 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:08:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15428 transitions. [2025-01-09 00:08:36,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1844 [2025-01-09 00:08:36,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:36,670 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:08:36,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:08:36,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:36,871 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:36,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:36,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1560355218, now seen corresponding path program 1 times [2025-01-09 00:08:36,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:36,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076287950] [2025-01-09 00:08:36,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:36,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:37,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1843 statements into 1 equivalence classes. [2025-01-09 00:08:37,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1843 of 1843 statements. [2025-01-09 00:08:37,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:37,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:38,561 INFO L134 CoverageAnalysis]: Checked inductivity of 7763 backedges. 2872 proven. 0 refuted. 0 times theorem prover too weak. 4891 trivial. 0 not checked. [2025-01-09 00:08:38,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:38,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076287950] [2025-01-09 00:08:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076287950] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:38,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922706543] [2025-01-09 00:08:38,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:38,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:08:38,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:38,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:08:38,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:08:38,569 INFO L87 Difference]: Start difference. First operand 15138 states and 15428 transitions. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:08:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:39,760 INFO L93 Difference]: Finished difference Result 30603 states and 31206 transitions. [2025-01-09 00:08:39,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:08:39,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 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 1843 [2025-01-09 00:08:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:39,776 INFO L225 Difference]: With dead ends: 30603 [2025-01-09 00:08:39,776 INFO L226 Difference]: Without dead ends: 17441 [2025-01-09 00:08:39,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:08:39,785 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 271 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1523 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:39,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 71 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1523 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:08:39,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-01-09 00:08:39,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 16783. [2025-01-09 00:08:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0197235132880467) internal successors, (17113), 16782 states have internal predecessors, (17113), 0 states have call successors, (0), 0 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:08:39,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17113 transitions. [2025-01-09 00:08:39,937 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17113 transitions. Word has length 1843 [2025-01-09 00:08:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:39,937 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17113 transitions. [2025-01-09 00:08:39,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 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:08:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17113 transitions. [2025-01-09 00:08:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1904 [2025-01-09 00:08:39,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:40,001 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:40,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:08:40,001 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:40,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:40,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1278044976, now seen corresponding path program 1 times [2025-01-09 00:08:40,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:40,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590089288] [2025-01-09 00:08:40,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:40,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:40,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1903 statements into 1 equivalence classes. [2025-01-09 00:08:40,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1903 of 1903 statements. [2025-01-09 00:08:40,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:40,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:41,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7943 backedges. 4851 proven. 0 refuted. 0 times theorem prover too weak. 3092 trivial. 0 not checked. [2025-01-09 00:08:41,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590089288] [2025-01-09 00:08:41,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590089288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:41,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:41,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:41,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787540836] [2025-01-09 00:08:41,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:41,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:41,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:41,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:41,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:41,727 INFO L87 Difference]: Start difference. First operand 16783 states and 17113 transitions. Second operand has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 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:08:42,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:42,392 INFO L93 Difference]: Finished difference Result 30932 states and 31549 transitions. [2025-01-09 00:08:42,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:42,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 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 1903 [2025-01-09 00:08:42,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:42,408 INFO L225 Difference]: With dead ends: 30932 [2025-01-09 00:08:42,408 INFO L226 Difference]: Without dead ends: 17441 [2025-01-09 00:08:42,419 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:08:42,420 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:42,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 425 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:42,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-01-09 00:08:42,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 17441. [2025-01-09 00:08:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.0192087155963303) internal successors, (17775), 17440 states have internal predecessors, (17775), 0 states have call successors, (0), 0 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:08:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17775 transitions. [2025-01-09 00:08:42,623 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17775 transitions. Word has length 1903 [2025-01-09 00:08:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:42,624 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17775 transitions. [2025-01-09 00:08:42,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 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:08:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17775 transitions. [2025-01-09 00:08:42,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1958 [2025-01-09 00:08:42,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:42,715 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:08:42,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:08:42,716 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:42,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1257048520, now seen corresponding path program 1 times [2025-01-09 00:08:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870695129] [2025-01-09 00:08:42,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:42,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1957 statements into 1 equivalence classes. [2025-01-09 00:08:42,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1957 of 1957 statements. [2025-01-09 00:08:42,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:42,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:44,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8143 backedges. 3908 proven. 0 refuted. 0 times theorem prover too weak. 4235 trivial. 0 not checked. [2025-01-09 00:08:44,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:44,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870695129] [2025-01-09 00:08:44,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870695129] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:44,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:44,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:44,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944870711] [2025-01-09 00:08:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:44,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:44,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:44,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:44,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:44,969 INFO L87 Difference]: Start difference. First operand 17441 states and 17775 transitions. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 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:08:45,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:45,600 INFO L93 Difference]: Finished difference Result 32577 states and 33222 transitions. [2025-01-09 00:08:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 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 1957 [2025-01-09 00:08:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:45,619 INFO L225 Difference]: With dead ends: 32577 [2025-01-09 00:08:45,619 INFO L226 Difference]: Without dead ends: 19086 [2025-01-09 00:08:45,629 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:08:45,632 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 207 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:45,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 51 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:08:45,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2025-01-09 00:08:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 17112. [2025-01-09 00:08:45,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.0191105137046343) internal successors, (17438), 17111 states have internal predecessors, (17438), 0 states have call successors, (0), 0 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:08:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17438 transitions. [2025-01-09 00:08:45,806 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17438 transitions. Word has length 1957 [2025-01-09 00:08:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:45,809 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17438 transitions. [2025-01-09 00:08:45,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 0 states have call successors, (0), 0 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:08:45,809 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17438 transitions. [2025-01-09 00:08:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1999 [2025-01-09 00:08:45,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:45,834 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:08:45,834 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:45,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1554992209, now seen corresponding path program 1 times [2025-01-09 00:08:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719981887] [2025-01-09 00:08:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:45,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1998 statements into 1 equivalence classes. [2025-01-09 00:08:46,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1998 of 1998 statements. [2025-01-09 00:08:46,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:46,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7642 backedges. 4583 proven. 2242 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2025-01-09 00:08:50,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:50,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719981887] [2025-01-09 00:08:50,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719981887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:50,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175557091] [2025-01-09 00:08:50,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:50,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:50,151 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:08:50,152 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:08:50,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1998 statements into 1 equivalence classes. [2025-01-09 00:08:50,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1998 of 1998 statements. [2025-01-09 00:08:50,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:50,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:50,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 2272 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:08:50,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:50,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7642 backedges. 4026 proven. 0 refuted. 0 times theorem prover too weak. 3616 trivial. 0 not checked. [2025-01-09 00:08:50,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:50,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175557091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:50,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:50,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-01-09 00:08:50,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560458542] [2025-01-09 00:08:50,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:50,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:50,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:50,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:50,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:08:50,946 INFO L87 Difference]: Start difference. First operand 17112 states and 17438 transitions. Second operand has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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:08:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:51,817 INFO L93 Difference]: Finished difference Result 30274 states and 30864 transitions. [2025-01-09 00:08:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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 1998 [2025-01-09 00:08:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:51,833 INFO L225 Difference]: With dead ends: 30274 [2025-01-09 00:08:51,833 INFO L226 Difference]: Without dead ends: 17112 [2025-01-09 00:08:51,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2008 GetRequests, 2000 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:08:51,842 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 95 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:51,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 51 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:51,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-01-09 00:08:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2025-01-09 00:08:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.018117000759745) internal successors, (17421), 17111 states have internal predecessors, (17421), 0 states have call successors, (0), 0 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:08:52,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17421 transitions. [2025-01-09 00:08:52,014 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17421 transitions. Word has length 1998 [2025-01-09 00:08:52,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:52,015 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17421 transitions. [2025-01-09 00:08:52,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 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:08:52,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17421 transitions. [2025-01-09 00:08:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1999 [2025-01-09 00:08:52,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:52,039 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:52,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:08:52,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:52,244 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:52,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:52,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1622342153, now seen corresponding path program 1 times [2025-01-09 00:08:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817251523] [2025-01-09 00:08:52,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:52,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1998 statements into 1 equivalence classes. [2025-01-09 00:08:52,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1998 of 1998 statements. [2025-01-09 00:08:52,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:52,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:53,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8962 backedges. 1868 proven. 0 refuted. 0 times theorem prover too weak. 7094 trivial. 0 not checked. [2025-01-09 00:08:53,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:53,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817251523] [2025-01-09 00:08:53,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817251523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:53,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:08:53,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:08:53,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203055641] [2025-01-09 00:08:53,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:53,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:53,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:53,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:53,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:08:53,558 INFO L87 Difference]: Start difference. First operand 17112 states and 17421 transitions. Second operand has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 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:08:54,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:54,284 INFO L93 Difference]: Finished difference Result 32248 states and 32877 transitions. [2025-01-09 00:08:54,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:54,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 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 1998 [2025-01-09 00:08:54,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:54,300 INFO L225 Difference]: With dead ends: 32248 [2025-01-09 00:08:54,301 INFO L226 Difference]: Without dead ends: 19086 [2025-01-09 00:08:54,309 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:08:54,311 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 167 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:54,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 25 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:54,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19086 states. [2025-01-09 00:08:54,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19086 to 17112. [2025-01-09 00:08:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.018000116883876) internal successors, (17419), 17111 states have internal predecessors, (17419), 0 states have call successors, (0), 0 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:08:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17419 transitions. [2025-01-09 00:08:54,447 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17419 transitions. Word has length 1998 [2025-01-09 00:08:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:54,449 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17419 transitions. [2025-01-09 00:08:54,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 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:08:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17419 transitions. [2025-01-09 00:08:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2065 [2025-01-09 00:08:54,472 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:54,473 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:08:54,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 00:08:54,473 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:54,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:54,474 INFO L85 PathProgramCache]: Analyzing trace with hash 136539396, now seen corresponding path program 1 times [2025-01-09 00:08:54,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:54,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075746935] [2025-01-09 00:08:54,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:54,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:54,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2064 statements into 1 equivalence classes. [2025-01-09 00:08:54,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2064 of 2064 statements. [2025-01-09 00:08:54,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:54,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 9205 backedges. 5876 proven. 79 refuted. 0 times theorem prover too weak. 3250 trivial. 0 not checked. [2025-01-09 00:08:57,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:57,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075746935] [2025-01-09 00:08:57,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075746935] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:57,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [262103018] [2025-01-09 00:08:57,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:57,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:57,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:57,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:08:57,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:08:57,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2064 statements into 1 equivalence classes. [2025-01-09 00:08:57,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2064 of 2064 statements. [2025-01-09 00:08:57,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:57,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:57,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 2386 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:08:57,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 9205 backedges. 5380 proven. 0 refuted. 0 times theorem prover too weak. 3825 trivial. 0 not checked. [2025-01-09 00:08:58,192 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:08:58,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [262103018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:08:58,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:08:58,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:08:58,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401211211] [2025-01-09 00:08:58,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:58,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:58,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:58,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:58,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:08:58,205 INFO L87 Difference]: Start difference. First operand 17112 states and 17419 transitions. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:08:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:58,945 INFO L93 Difference]: Finished difference Result 29945 states and 30510 transitions. [2025-01-09 00:08:58,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:58,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 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 2064 [2025-01-09 00:08:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:58,981 INFO L225 Difference]: With dead ends: 29945 [2025-01-09 00:08:58,984 INFO L226 Difference]: Without dead ends: 17112 [2025-01-09 00:08:58,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2067 GetRequests, 2064 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:08:58,999 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:59,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 419 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:59,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2025-01-09 00:08:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2025-01-09 00:08:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.017649465256268) internal successors, (17413), 17111 states have internal predecessors, (17413), 0 states have call successors, (0), 0 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:08:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17413 transitions. [2025-01-09 00:08:59,245 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17413 transitions. Word has length 2064 [2025-01-09 00:08:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:59,246 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17413 transitions. [2025-01-09 00:08:59,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 0 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:08:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17413 transitions. [2025-01-09 00:08:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2132 [2025-01-09 00:08:59,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:59,274 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-09 00:08:59,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 00:08:59,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-09 00:08:59,477 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:59,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:59,478 INFO L85 PathProgramCache]: Analyzing trace with hash 740185769, now seen corresponding path program 1 times [2025-01-09 00:08:59,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:59,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909927189] [2025-01-09 00:08:59,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:59,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:59,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2131 statements into 1 equivalence classes. [2025-01-09 00:08:59,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2131 of 2131 statements. [2025-01-09 00:08:59,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:59,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:02,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8688 backedges. 6260 proven. 153 refuted. 0 times theorem prover too weak. 2275 trivial. 0 not checked. [2025-01-09 00:09:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:09:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909927189] [2025-01-09 00:09:02,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909927189] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:09:02,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284323030] [2025-01-09 00:09:02,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:09:02,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:09:02,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:09:02,091 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:09:02,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:09:02,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2131 statements into 1 equivalence classes. [2025-01-09 00:09:02,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2131 of 2131 statements. [2025-01-09 00:09:02,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:09:02,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:09:02,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 2425 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:09:02,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:09:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 8688 backedges. 5697 proven. 67 refuted. 0 times theorem prover too weak. 2924 trivial. 0 not checked. [2025-01-09 00:09:08,450 INFO L312 TraceCheckSpWp]: Computing backward predicates...