./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label16.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/Problem19_label16.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 48af9545dcd019475f02546292be1ef17ee51a35728e2aac72649a5fe37e6e8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:24:18,847 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:24:18,900 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:24:18,904 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:24:18,904 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:24:18,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:24:18,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:24:18,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:24:18,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:24:18,923 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:24:18,923 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:24:18,923 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:24:18,924 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:24:18,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:24:18,924 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:24:18,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:24:18,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:24:18,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:24:18,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:24:18,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:24:18,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:24:18,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:24:18,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:24:18,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:24:18,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:24:18,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:24:18,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:24:18,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:24:18,927 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 -> 48af9545dcd019475f02546292be1ef17ee51a35728e2aac72649a5fe37e6e8f [2025-01-09 00:24:19,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:24:19,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:24:19,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:24:19,184 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:24:19,184 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:24:19,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label16.c [2025-01-09 00:24:20,271 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9cac1c6b/1d7970645fdd4d16994040908308afa9/FLAG2638204c2 [2025-01-09 00:24:20,723 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:24:20,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label16.c [2025-01-09 00:24:20,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9cac1c6b/1d7970645fdd4d16994040908308afa9/FLAG2638204c2 [2025-01-09 00:24:20,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9cac1c6b/1d7970645fdd4d16994040908308afa9 [2025-01-09 00:24:20,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:24:20,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:24:20,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:24:20,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:24:20,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:24:20,849 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:24:20" (1/1) ... [2025-01-09 00:24:20,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@691398c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:20, skipping insertion in model container [2025-01-09 00:24:20,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:24:20" (1/1) ... [2025-01-09 00:24:20,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:24:21,237 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/Problem19_label16.c[6966,6979] [2025-01-09 00:24:21,943 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:24:21,952 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:24:21,970 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/Problem19_label16.c[6966,6979] [2025-01-09 00:24:22,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:24:22,517 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:24:22,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22 WrapperNode [2025-01-09 00:24:22,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:24:22,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:24:22,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:24:22,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:24:22,524 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:24:22" (1/1) ... [2025-01-09 00:24:22,591 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:24:22" (1/1) ... [2025-01-09 00:24:23,338 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-01-09 00:24:23,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:24:23,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:24:23,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:24:23,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:24:23,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:23,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:23,550 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:23,784 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:24:23,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:23,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:23,979 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:24,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:24,039 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:24,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:24,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:24,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:24:24,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:24:24,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:24:24,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:24:24,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (1/1) ... [2025-01-09 00:24:24,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:24:24,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:24:24,242 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:24:24,244 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:24:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:24:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:24:24,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:24:24,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:24:24,314 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:24:24,315 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:24:30,166 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-01-09 00:24:30,166 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:24:30,207 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:24:30,210 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:24:30,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:24:30 BoogieIcfgContainer [2025-01-09 00:24:30,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:24:30,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:24:30,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:24:30,216 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:24:30,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:24:20" (1/3) ... [2025-01-09 00:24:30,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ffcd92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:24:30, skipping insertion in model container [2025-01-09 00:24:30,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:24:22" (2/3) ... [2025-01-09 00:24:30,217 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32ffcd92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:24:30, skipping insertion in model container [2025-01-09 00:24:30,217 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:24:30" (3/3) ... [2025-01-09 00:24:30,218 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label16.c [2025-01-09 00:24:30,228 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:24:30,229 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label16.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:24:30,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:24:30,382 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;@34cf68b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:24:30,382 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:24:30,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 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:24:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 00:24:30,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:30,401 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:24:30,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:30,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:30,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1210903428, now seen corresponding path program 1 times [2025-01-09 00:24:30,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:30,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871225187] [2025-01-09 00:24:30,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:30,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:30,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 00:24:30,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 00:24:30,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:30,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:30,860 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:24:30,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:30,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871225187] [2025-01-09 00:24:30,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871225187] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:30,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:30,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198973313] [2025-01-09 00:24:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:30,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:30,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:30,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:30,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:30,890 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 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 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:24:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:37,907 INFO L93 Difference]: Finished difference Result 4957 states and 9395 transitions. [2025-01-09 00:24:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:24:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-01-09 00:24:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:37,948 INFO L225 Difference]: With dead ends: 4957 [2025-01-09 00:24:37,948 INFO L226 Difference]: Without dead ends: 3129 [2025-01-09 00:24:37,958 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:24:37,969 INFO L435 NwaCegarLoop]: 1377 mSDtfsCounter, 1573 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 4344 mSolverCounterSat, 1517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1573 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1517 IncrementalHoareTripleChecker+Valid, 4344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:37,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1573 Valid, 1599 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1517 Valid, 4344 Invalid, 0 Unknown, 0 Unchecked, 6.8s Time] [2025-01-09 00:24:37,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3129 states. [2025-01-09 00:24:38,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3129 to 3108. [2025-01-09 00:24:38,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 3107 states have (on average 1.6012230447376892) internal successors, (4975), 3107 states have internal predecessors, (4975), 0 states have call successors, (0), 0 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:24:38,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4975 transitions. [2025-01-09 00:24:38,168 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 4975 transitions. Word has length 53 [2025-01-09 00:24:38,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:38,169 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 4975 transitions. [2025-01-09 00:24:38,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 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:24:38,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 4975 transitions. [2025-01-09 00:24:38,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 00:24:38,173 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:38,173 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:24:38,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:24:38,174 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:38,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:38,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1419140506, now seen corresponding path program 1 times [2025-01-09 00:24:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:38,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297802228] [2025-01-09 00:24:38,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:38,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 00:24:38,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 00:24:38,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:38,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:38,537 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:24:38,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:38,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297802228] [2025-01-09 00:24:38,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297802228] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:38,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:38,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:38,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230389559] [2025-01-09 00:24:38,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:38,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:38,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:38,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:38,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:38,540 INFO L87 Difference]: Start difference. First operand 3108 states and 4975 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:24:45,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:45,665 INFO L93 Difference]: Finished difference Result 10359 states and 16187 transitions. [2025-01-09 00:24:45,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:45,665 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2025-01-09 00:24:45,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:45,687 INFO L225 Difference]: With dead ends: 10359 [2025-01-09 00:24:45,687 INFO L226 Difference]: Without dead ends: 7253 [2025-01-09 00:24:45,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:24:45,692 INFO L435 NwaCegarLoop]: 1028 mSDtfsCounter, 4321 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 9504 mSolverCounterSat, 1498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4321 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 11002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1498 IncrementalHoareTripleChecker+Valid, 9504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:45,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4321 Valid, 1300 Invalid, 11002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1498 Valid, 9504 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2025-01-09 00:24:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7253 states. [2025-01-09 00:24:45,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7253 to 7249. [2025-01-09 00:24:45,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 7248 states have (on average 1.4501931567328918) internal successors, (10511), 7248 states have internal predecessors, (10511), 0 states have call successors, (0), 0 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:24:45,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10511 transitions. [2025-01-09 00:24:45,798 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10511 transitions. Word has length 120 [2025-01-09 00:24:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:45,799 INFO L471 AbstractCegarLoop]: Abstraction has 7249 states and 10511 transitions. [2025-01-09 00:24:45,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 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:24:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10511 transitions. [2025-01-09 00:24:45,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-09 00:24:45,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:45,808 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2025-01-09 00:24:45,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:24:45,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:45,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:45,809 INFO L85 PathProgramCache]: Analyzing trace with hash 695280935, now seen corresponding path program 1 times [2025-01-09 00:24:45,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:45,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457105953] [2025-01-09 00:24:45,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:45,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:45,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-09 00:24:45,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-09 00:24:45,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:45,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:46,699 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-01-09 00:24:46,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:46,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457105953] [2025-01-09 00:24:46,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457105953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:46,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276012635] [2025-01-09 00:24:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:46,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:46,703 INFO L87 Difference]: Start difference. First operand 7249 states and 10511 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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:24:53,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:53,045 INFO L93 Difference]: Finished difference Result 17269 states and 24865 transitions. [2025-01-09 00:24:53,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:53,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 337 [2025-01-09 00:24:53,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:53,076 INFO L225 Difference]: With dead ends: 17269 [2025-01-09 00:24:53,076 INFO L226 Difference]: Without dead ends: 11387 [2025-01-09 00:24:53,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:24:53,086 INFO L435 NwaCegarLoop]: 1804 mSDtfsCounter, 3756 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2159 SdHoareTripleChecker+Invalid, 9885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 430 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:53,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2159 Invalid, 9885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [430 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2025-01-09 00:24:53,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11387 states. [2025-01-09 00:24:53,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11387 to 11367. [2025-01-09 00:24:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.328523667077248) internal successors, (15100), 11366 states have internal predecessors, (15100), 0 states have call successors, (0), 0 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:24:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15100 transitions. [2025-01-09 00:24:53,243 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15100 transitions. Word has length 337 [2025-01-09 00:24:53,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:53,244 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15100 transitions. [2025-01-09 00:24:53,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 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:24:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15100 transitions. [2025-01-09 00:24:53,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2025-01-09 00:24:53,249 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:53,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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:24:53,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:24:53,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:53,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:53,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1074651199, now seen corresponding path program 1 times [2025-01-09 00:24:53,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835237886] [2025-01-09 00:24:53,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:53,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:53,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 365 statements into 1 equivalence classes. [2025-01-09 00:24:53,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 365 of 365 statements. [2025-01-09 00:24:53,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:53,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 00:24:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:53,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835237886] [2025-01-09 00:24:53,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835237886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:53,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:53,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:24:53,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920152037] [2025-01-09 00:24:53,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:53,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:24:53,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:53,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:24:53,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:24:53,819 INFO L87 Difference]: Start difference. First operand 11367 states and 15100 transitions. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:24:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:24:58,467 INFO L93 Difference]: Finished difference Result 20033 states and 27481 transitions. [2025-01-09 00:24:58,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:24:58,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 365 [2025-01-09 00:24:58,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:24:58,490 INFO L225 Difference]: With dead ends: 20033 [2025-01-09 00:24:58,490 INFO L226 Difference]: Without dead ends: 11367 [2025-01-09 00:24:58,498 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:24:58,498 INFO L435 NwaCegarLoop]: 1775 mSDtfsCounter, 1138 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 7325 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 2117 SdHoareTripleChecker+Invalid, 7333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 7325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:24:58,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 2117 Invalid, 7333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 7325 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 00:24:58,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11367 states. [2025-01-09 00:24:58,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11367 to 11367. [2025-01-09 00:24:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11367 states, 11366 states have (on average 1.327379904979764) internal successors, (15087), 11366 states have internal predecessors, (15087), 0 states have call successors, (0), 0 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:24:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11367 states to 11367 states and 15087 transitions. [2025-01-09 00:24:58,704 INFO L78 Accepts]: Start accepts. Automaton has 11367 states and 15087 transitions. Word has length 365 [2025-01-09 00:24:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:24:58,705 INFO L471 AbstractCegarLoop]: Abstraction has 11367 states and 15087 transitions. [2025-01-09 00:24:58,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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:24:58,710 INFO L276 IsEmpty]: Start isEmpty. Operand 11367 states and 15087 transitions. [2025-01-09 00:24:58,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2025-01-09 00:24:58,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:24:58,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:58,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:24:58,724 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:24:58,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:24:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1899308326, now seen corresponding path program 1 times [2025-01-09 00:24:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:24:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481066914] [2025-01-09 00:24:58,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:24:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:24:58,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes. [2025-01-09 00:24:58,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements. [2025-01-09 00:24:58,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:24:58,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:24:59,288 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-09 00:24:59,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:24:59,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481066914] [2025-01-09 00:24:59,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481066914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:24:59,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:24:59,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:24:59,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343685465] [2025-01-09 00:24:59,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:24:59,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:24:59,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:24:59,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:24:59,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:24:59,291 INFO L87 Difference]: Start difference. First operand 11367 states and 15087 transitions. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:03,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:03,574 INFO L93 Difference]: Finished difference Result 28418 states and 39498 transitions. [2025-01-09 00:25:03,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:03,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 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 609 [2025-01-09 00:25:03,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:03,604 INFO L225 Difference]: With dead ends: 28418 [2025-01-09 00:25:03,605 INFO L226 Difference]: Without dead ends: 19783 [2025-01-09 00:25:03,613 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:25:03,615 INFO L435 NwaCegarLoop]: 1335 mSDtfsCounter, 1356 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 5626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:03,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1607 Invalid, 5626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4196 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 00:25:03,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19783 states. [2025-01-09 00:25:03,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19783 to 19765. [2025-01-09 00:25:03,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19765 states, 19764 states have (on average 1.2450414895770088) internal successors, (24607), 19764 states have internal predecessors, (24607), 0 states have call successors, (0), 0 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:25:03,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19765 states to 19765 states and 24607 transitions. [2025-01-09 00:25:03,907 INFO L78 Accepts]: Start accepts. Automaton has 19765 states and 24607 transitions. Word has length 609 [2025-01-09 00:25:03,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:03,909 INFO L471 AbstractCegarLoop]: Abstraction has 19765 states and 24607 transitions. [2025-01-09 00:25:03,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 19765 states and 24607 transitions. [2025-01-09 00:25:03,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2025-01-09 00:25:03,916 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:03,917 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:03,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:25:03,917 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:03,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:03,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1462870954, now seen corresponding path program 1 times [2025-01-09 00:25:03,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:03,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229674849] [2025-01-09 00:25:03,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:03,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:03,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes. [2025-01-09 00:25:03,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements. [2025-01-09 00:25:03,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:03,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-09 00:25:04,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:04,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229674849] [2025-01-09 00:25:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229674849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:04,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:25:04,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723251363] [2025-01-09 00:25:04,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:04,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:04,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:04,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:04,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:04,303 INFO L87 Difference]: Start difference. First operand 19765 states and 24607 transitions. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:08,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:08,653 INFO L93 Difference]: Finished difference Result 42284 states and 53767 transitions. [2025-01-09 00:25:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:08,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 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 614 [2025-01-09 00:25:08,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:08,695 INFO L225 Difference]: With dead ends: 42284 [2025-01-09 00:25:08,695 INFO L226 Difference]: Without dead ends: 25251 [2025-01-09 00:25:08,709 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:25:08,710 INFO L435 NwaCegarLoop]: 705 mSDtfsCounter, 1387 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 6050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:08,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 756 Invalid, 6050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 00:25:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25251 states. [2025-01-09 00:25:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25251 to 25235. [2025-01-09 00:25:08,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25235 states, 25234 states have (on average 1.230958230958231) internal successors, (31062), 25234 states have internal predecessors, (31062), 0 states have call successors, (0), 0 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:25:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25235 states to 25235 states and 31062 transitions. [2025-01-09 00:25:08,949 INFO L78 Accepts]: Start accepts. Automaton has 25235 states and 31062 transitions. Word has length 614 [2025-01-09 00:25:08,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:08,949 INFO L471 AbstractCegarLoop]: Abstraction has 25235 states and 31062 transitions. [2025-01-09 00:25:08,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:08,950 INFO L276 IsEmpty]: Start isEmpty. Operand 25235 states and 31062 transitions. [2025-01-09 00:25:08,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2025-01-09 00:25:08,957 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:08,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:08,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:25:08,958 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:08,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:08,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1699809222, now seen corresponding path program 1 times [2025-01-09 00:25:08,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:08,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922902463] [2025-01-09 00:25:08,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:08,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:09,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes. [2025-01-09 00:25:09,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements. [2025-01-09 00:25:09,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:09,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:09,223 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 00:25:09,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:09,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922902463] [2025-01-09 00:25:09,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922902463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:09,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:09,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:25:09,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414894842] [2025-01-09 00:25:09,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:09,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:09,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:09,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:09,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:09,226 INFO L87 Difference]: Start difference. First operand 25235 states and 31062 transitions. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:13,908 INFO L93 Difference]: Finished difference Result 68421 states and 85650 transitions. [2025-01-09 00:25:13,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:13,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 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 617 [2025-01-09 00:25:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:13,971 INFO L225 Difference]: With dead ends: 68421 [2025-01-09 00:25:13,971 INFO L226 Difference]: Without dead ends: 45918 [2025-01-09 00:25:13,993 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:25:13,994 INFO L435 NwaCegarLoop]: 713 mSDtfsCounter, 2112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5114 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 5548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:13,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 983 Invalid, 5548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5114 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 00:25:14,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45918 states. [2025-01-09 00:25:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45918 to 44549. [2025-01-09 00:25:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44549 states, 44548 states have (on average 1.2146673251324414) internal successors, (54111), 44548 states have internal predecessors, (54111), 0 states have call successors, (0), 0 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:25:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44549 states to 44549 states and 54111 transitions. [2025-01-09 00:25:14,596 INFO L78 Accepts]: Start accepts. Automaton has 44549 states and 54111 transitions. Word has length 617 [2025-01-09 00:25:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:14,599 INFO L471 AbstractCegarLoop]: Abstraction has 44549 states and 54111 transitions. [2025-01-09 00:25:14,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 2 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 44549 states and 54111 transitions. [2025-01-09 00:25:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2025-01-09 00:25:14,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:14,610 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:14,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:25:14,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:14,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:14,611 INFO L85 PathProgramCache]: Analyzing trace with hash -173692169, now seen corresponding path program 1 times [2025-01-09 00:25:14,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:14,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187656509] [2025-01-09 00:25:14,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:14,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:14,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 747 statements into 1 equivalence classes. [2025-01-09 00:25:14,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 747 of 747 statements. [2025-01-09 00:25:14,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:14,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 19 proven. 82 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-09 00:25:15,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187656509] [2025-01-09 00:25:15,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187656509] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:25:15,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [782998279] [2025-01-09 00:25:15,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:15,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:25:15,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:25:15,307 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:25:15,308 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:25:15,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 747 statements into 1 equivalence classes. [2025-01-09 00:25:15,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 747 of 747 statements. [2025-01-09 00:25:15,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:15,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:15,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:25:15,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:25:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-09 00:25:15,588 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:25:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [782998279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:15,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:25:15,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:25:15,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096911135] [2025-01-09 00:25:15,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:15,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:15,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:15,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:15,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:25:15,590 INFO L87 Difference]: Start difference. First operand 44549 states and 54111 transitions. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:20,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:20,093 INFO L93 Difference]: Finished difference Result 113815 states and 141094 transitions. [2025-01-09 00:25:20,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:20,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 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 747 [2025-01-09 00:25:20,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:20,171 INFO L225 Difference]: With dead ends: 113815 [2025-01-09 00:25:20,171 INFO L226 Difference]: Without dead ends: 71998 [2025-01-09 00:25:20,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 750 GetRequests, 746 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:25:20,190 INFO L435 NwaCegarLoop]: 2740 mSDtfsCounter, 1469 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 4055 mSolverCounterSat, 1806 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 2913 SdHoareTripleChecker+Invalid, 5861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1806 IncrementalHoareTripleChecker+Valid, 4055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:20,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 2913 Invalid, 5861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1806 Valid, 4055 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2025-01-09 00:25:20,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71998 states. [2025-01-09 00:25:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71998 to 69169. [2025-01-09 00:25:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69169 states, 69168 states have (on average 1.1861988202637057) internal successors, (82047), 69168 states have internal predecessors, (82047), 0 states have call successors, (0), 0 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:25:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69169 states to 69169 states and 82047 transitions. [2025-01-09 00:25:20,911 INFO L78 Accepts]: Start accepts. Automaton has 69169 states and 82047 transitions. Word has length 747 [2025-01-09 00:25:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:20,912 INFO L471 AbstractCegarLoop]: Abstraction has 69169 states and 82047 transitions. [2025-01-09 00:25:20,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:25:20,912 INFO L276 IsEmpty]: Start isEmpty. Operand 69169 states and 82047 transitions. [2025-01-09 00:25:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2025-01-09 00:25:20,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:20,918 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:20,925 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:25:21,122 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:25:21,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:21,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:21,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1146782735, now seen corresponding path program 1 times [2025-01-09 00:25:21,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:21,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790619638] [2025-01-09 00:25:21,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:21,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:21,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 846 statements into 1 equivalence classes. [2025-01-09 00:25:21,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 846 of 846 statements. [2025-01-09 00:25:21,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:21,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 113 proven. 39 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:25:21,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:21,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790619638] [2025-01-09 00:25:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790619638] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:25:21,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838423754] [2025-01-09 00:25:21,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:21,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:25:21,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:25:21,882 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:25:21,883 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:25:21,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 846 statements into 1 equivalence classes. [2025-01-09 00:25:22,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 846 of 846 statements. [2025-01-09 00:25:22,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:22,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:22,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:25:22,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:25:22,203 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:25:22,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:25:22,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838423754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:22,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:25:22,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:25:22,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948819825] [2025-01-09 00:25:22,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:22,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:22,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:22,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:22,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:25:22,207 INFO L87 Difference]: Start difference. First operand 69169 states and 82047 transitions. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:25:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:27,082 INFO L93 Difference]: Finished difference Result 169903 states and 204682 transitions. [2025-01-09 00:25:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 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 846 [2025-01-09 00:25:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:27,197 INFO L225 Difference]: With dead ends: 169903 [2025-01-09 00:25:27,198 INFO L226 Difference]: Without dead ends: 103466 [2025-01-09 00:25:27,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 849 GetRequests, 845 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:25:27,247 INFO L435 NwaCegarLoop]: 1175 mSDtfsCounter, 1563 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 4184 mSolverCounterSat, 1899 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 1307 SdHoareTripleChecker+Invalid, 6083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1899 IncrementalHoareTripleChecker+Valid, 4184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:27,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 1307 Invalid, 6083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1899 Valid, 4184 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 00:25:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103466 states. [2025-01-09 00:25:28,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103466 to 101948. [2025-01-09 00:25:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101948 states, 101947 states have (on average 1.1837523419031457) internal successors, (120680), 101947 states have internal predecessors, (120680), 0 states have call successors, (0), 0 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:25:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101948 states to 101948 states and 120680 transitions. [2025-01-09 00:25:28,163 INFO L78 Accepts]: Start accepts. Automaton has 101948 states and 120680 transitions. Word has length 846 [2025-01-09 00:25:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:28,163 INFO L471 AbstractCegarLoop]: Abstraction has 101948 states and 120680 transitions. [2025-01-09 00:25:28,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 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:25:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 101948 states and 120680 transitions. [2025-01-09 00:25:28,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2025-01-09 00:25:28,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:28,170 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:28,176 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:25:28,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:25:28,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:28,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1276482507, now seen corresponding path program 1 times [2025-01-09 00:25:28,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:28,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471300807] [2025-01-09 00:25:28,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:28,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:28,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 912 statements into 1 equivalence classes. [2025-01-09 00:25:28,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 912 of 912 statements. [2025-01-09 00:25:28,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:28,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 680 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-01-09 00:25:29,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471300807] [2025-01-09 00:25:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471300807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:25:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795292711] [2025-01-09 00:25:29,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:29,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:29,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:29,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:29,390 INFO L87 Difference]: Start difference. First operand 101948 states and 120680 transitions. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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:25:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:34,383 INFO L93 Difference]: Finished difference Result 239528 states and 286173 transitions. [2025-01-09 00:25:34,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:34,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 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 912 [2025-01-09 00:25:34,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:34,539 INFO L225 Difference]: With dead ends: 239528 [2025-01-09 00:25:34,540 INFO L226 Difference]: Without dead ends: 140312 [2025-01-09 00:25:34,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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:25:34,580 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 1581 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 2338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 6576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2338 IncrementalHoareTripleChecker+Valid, 4238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:34,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 656 Invalid, 6576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2338 Valid, 4238 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 00:25:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140312 states. [2025-01-09 00:25:35,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140312 to 133350. [2025-01-09 00:25:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133350 states, 133349 states have (on average 1.2038860433899017) internal successors, (160537), 133349 states have internal predecessors, (160537), 0 states have call successors, (0), 0 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:25:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133350 states to 133350 states and 160537 transitions. [2025-01-09 00:25:36,151 INFO L78 Accepts]: Start accepts. Automaton has 133350 states and 160537 transitions. Word has length 912 [2025-01-09 00:25:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:36,152 INFO L471 AbstractCegarLoop]: Abstraction has 133350 states and 160537 transitions. [2025-01-09 00:25:36,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 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:25:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 133350 states and 160537 transitions. [2025-01-09 00:25:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 944 [2025-01-09 00:25:36,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:36,165 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:36,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:25:36,166 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:36,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:36,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1675776001, now seen corresponding path program 1 times [2025-01-09 00:25:36,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:36,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493184429] [2025-01-09 00:25:36,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:36,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:36,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 943 statements into 1 equivalence classes. [2025-01-09 00:25:36,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 943 of 943 statements. [2025-01-09 00:25:36,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:25:36,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:25:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 886 backedges. 490 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:25:36,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:25:36,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493184429] [2025-01-09 00:25:36,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493184429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:25:36,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:25:36,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:25:36,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581612694] [2025-01-09 00:25:36,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:25:36,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:25:36,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:25:36,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:25:36,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:25:36,803 INFO L87 Difference]: Start difference. First operand 133350 states and 160537 transitions. Second operand has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:25:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:25:41,414 INFO L93 Difference]: Finished difference Result 269438 states and 323941 transitions. [2025-01-09 00:25:41,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:25:41,415 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 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 943 [2025-01-09 00:25:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:25:41,577 INFO L225 Difference]: With dead ends: 269438 [2025-01-09 00:25:41,578 INFO L226 Difference]: Without dead ends: 138820 [2025-01-09 00:25:41,655 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:25:41,655 INFO L435 NwaCegarLoop]: 2908 mSDtfsCounter, 1510 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 3685 mSolverCounterSat, 1464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 3093 SdHoareTripleChecker+Invalid, 5149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1464 IncrementalHoareTripleChecker+Valid, 3685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:25:41,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 3093 Invalid, 5149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1464 Valid, 3685 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2025-01-09 00:25:41,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138820 states. [2025-01-09 00:25:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138820 to 134710. [2025-01-09 00:25:43,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134710 states, 134709 states have (on average 1.146478705951347) internal successors, (154441), 134709 states have internal predecessors, (154441), 0 states have call successors, (0), 0 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:25:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134710 states to 134710 states and 154441 transitions. [2025-01-09 00:25:43,434 INFO L78 Accepts]: Start accepts. Automaton has 134710 states and 154441 transitions. Word has length 943 [2025-01-09 00:25:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:25:43,435 INFO L471 AbstractCegarLoop]: Abstraction has 134710 states and 154441 transitions. [2025-01-09 00:25:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.0) internal successors, (642), 3 states have internal predecessors, (642), 0 states have call successors, (0), 0 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:25:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 134710 states and 154441 transitions. [2025-01-09 00:25:43,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2025-01-09 00:25:43,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:25:43,444 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25:43,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:25:43,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:25:43,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:25:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2124125339, now seen corresponding path program 1 times [2025-01-09 00:25:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:25:43,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905301759] [2025-01-09 00:25:43,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:25:43,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:25:43,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1010 statements into 1 equivalence classes. [2025-01-09 00:25:43,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1010 of 1010 statements.