./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label18.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 194fbdc3b3886612fc58320fafee97b7b69b69e44501245b99f854c5cffd6315 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:51:47,767 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:51:47,837 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:51:47,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:51:47,845 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:51:47,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:51:47,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:51:47,872 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:51:47,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:51:47,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:51:47,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:51:47,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:51:47,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:51:47,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:51:47,874 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:51:47,875 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:51:47,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:51:47,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:51:47,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:51:47,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:51:47,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:51:47,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:51:47,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:47,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:47,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:47,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:47,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:51:47,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:51:47,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:51:47,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:51:47,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:47,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:51:47,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:51:47,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:51:47,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:51:47,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:51:47,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:51:47,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:51:47,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:51:47,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:51:47,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:51:47,879 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 -> 194fbdc3b3886612fc58320fafee97b7b69b69e44501245b99f854c5cffd6315 [2025-01-08 23:51:48,144 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:51:48,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:51:48,155 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:51:48,156 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:51:48,156 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:51:48,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label18.c [2025-01-08 23:51:49,402 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e867a647a/05f9272fc2734621a1f8a6edd1acefa4/FLAG283b45b91 [2025-01-08 23:51:49,856 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:51:49,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label18.c [2025-01-08 23:51:49,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e867a647a/05f9272fc2734621a1f8a6edd1acefa4/FLAG283b45b91 [2025-01-08 23:51:49,914 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e867a647a/05f9272fc2734621a1f8a6edd1acefa4 [2025-01-08 23:51:49,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:51:49,918 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:51:49,920 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:49,920 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:51:49,924 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:51:49,925 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:49" (1/1) ... [2025-01-08 23:51:49,926 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4aa655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:49, skipping insertion in model container [2025-01-08 23:51:49,926 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:51:49" (1/1) ... [2025-01-08 23:51:50,030 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:51:50,274 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label18.c[8933,8946] [2025-01-08 23:51:50,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:50,920 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:51:50,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label18.c[8933,8946] [2025-01-08 23:51:51,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:51:51,323 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:51:51,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51 WrapperNode [2025-01-08 23:51:51,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:51:51,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:51,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:51:51,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:51:51,332 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:51,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:51,857 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:51:51,857 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:51:51,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:51:51,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:51:51,858 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:51:51,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:51,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:51,997 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,257 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-08 23:51:52,258 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,258 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,466 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:51:52,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:51:52,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:51:52,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:51:52,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (1/1) ... [2025-01-08 23:51:52,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:51:52,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:51:52,695 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-08 23:51:52,709 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-08 23:51:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:51:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:51:52,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:51:52,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:51:52,857 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:51:52,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:51:58,133 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:51:58,134 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:51:58,162 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:51:58,163 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:51:58,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:58 BoogieIcfgContainer [2025-01-08 23:51:58,163 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:51:58,165 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:51:58,165 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:51:58,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:51:58,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:51:49" (1/3) ... [2025-01-08 23:51:58,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567d5be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:58, skipping insertion in model container [2025-01-08 23:51:58,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:51:51" (2/3) ... [2025-01-08 23:51:58,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@567d5be8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:51:58, skipping insertion in model container [2025-01-08 23:51:58,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:51:58" (3/3) ... [2025-01-08 23:51:58,173 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label18.c [2025-01-08 23:51:58,195 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:51:58,198 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label18.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:51:58,270 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:51:58,280 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;@6e8e5c50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:51:58,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:51:58,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:51:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-08 23:51:58,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:51:58,299 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:51:58,299 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:51:58,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:51:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1826551956, now seen corresponding path program 1 times [2025-01-08 23:51:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:51:58,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122186807] [2025-01-08 23:51:58,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:51:58,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:51:58,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-08 23:51:58,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-08 23:51:58,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:51:58,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:51:58,724 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-08 23:51:58,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:51:58,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122186807] [2025-01-08 23:51:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122186807] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:51:58,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:51:58,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:51:58,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270096511] [2025-01-08 23:51:58,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:51:58,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:51:58,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:51:58,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:51:58,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:51:58,754 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-08 23:52:02,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:02,795 INFO L93 Difference]: Finished difference Result 3035 states and 5640 transitions. [2025-01-08 23:52:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2025-01-08 23:52:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:02,825 INFO L225 Difference]: With dead ends: 3035 [2025-01-08 23:52:02,826 INFO L226 Difference]: Without dead ends: 1873 [2025-01-08 23:52:02,836 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-08 23:52:02,842 INFO L435 NwaCegarLoop]: 991 mSDtfsCounter, 842 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:02,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-08 23:52:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2025-01-08 23:52:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2025-01-08 23:52:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2025-01-08 23:52:02,976 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 63 [2025-01-08 23:52:02,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:02,977 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2025-01-08 23:52:02,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-08 23:52:02,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2025-01-08 23:52:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-08 23:52:02,980 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:02,981 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:02,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:52:02,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:02,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1350208608, now seen corresponding path program 1 times [2025-01-08 23:52:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828373559] [2025-01-08 23:52:02,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:03,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-08 23:52:03,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-08 23:52:03,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:03,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:03,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:03,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828373559] [2025-01-08 23:52:03,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828373559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:03,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:03,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:03,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756586469] [2025-01-08 23:52:03,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:03,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:03,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:03,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:03,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:03,271 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-08 23:52:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:07,451 INFO L93 Difference]: Finished difference Result 5405 states and 8404 transitions. [2025-01-08 23:52:07,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:07,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 135 [2025-01-08 23:52:07,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:07,468 INFO L225 Difference]: With dead ends: 5405 [2025-01-08 23:52:07,468 INFO L226 Difference]: Without dead ends: 3548 [2025-01-08 23:52:07,472 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-08 23:52:07,472 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 862 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 3343 mSolverCounterSat, 442 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 442 IncrementalHoareTripleChecker+Valid, 3343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:07,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 1040 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [442 Valid, 3343 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-01-08 23:52:07,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-01-08 23:52:07,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3476. [2025-01-08 23:52:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3476 states, 3475 states have (on average 1.4897841726618706) internal successors, (5177), 3475 states have internal predecessors, (5177), 0 states have call successors, (0), 0 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-08 23:52:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 5177 transitions. [2025-01-08 23:52:07,564 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 5177 transitions. Word has length 135 [2025-01-08 23:52:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:07,566 INFO L471 AbstractCegarLoop]: Abstraction has 3476 states and 5177 transitions. [2025-01-08 23:52:07,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 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-08 23:52:07,566 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 5177 transitions. [2025-01-08 23:52:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-08 23:52:07,570 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:07,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:07,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:52:07,570 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:07,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:07,571 INFO L85 PathProgramCache]: Analyzing trace with hash -615763991, now seen corresponding path program 1 times [2025-01-08 23:52:07,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834120990] [2025-01-08 23:52:07,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:07,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-08 23:52:07,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-08 23:52:07,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:07,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:07,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:07,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834120990] [2025-01-08 23:52:07,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834120990] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:07,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:07,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:07,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350173217] [2025-01-08 23:52:07,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:07,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:07,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:07,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:07,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:07,786 INFO L87 Difference]: Start difference. First operand 3476 states and 5177 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-08 23:52:10,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:10,743 INFO L93 Difference]: Finished difference Result 10140 states and 15128 transitions. [2025-01-08 23:52:10,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:10,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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 149 [2025-01-08 23:52:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:10,773 INFO L225 Difference]: With dead ends: 10140 [2025-01-08 23:52:10,773 INFO L226 Difference]: Without dead ends: 6666 [2025-01-08 23:52:10,779 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-08 23:52:10,782 INFO L435 NwaCegarLoop]: 712 mSDtfsCounter, 964 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 776 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 964 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 776 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:10,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [964 Valid, 847 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [776 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:52:10,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6666 states. [2025-01-08 23:52:10,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6666 to 6659. [2025-01-08 23:52:10,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6659 states, 6658 states have (on average 1.364373685791529) internal successors, (9084), 6658 states have internal predecessors, (9084), 0 states have call successors, (0), 0 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-08 23:52:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6659 states to 6659 states and 9084 transitions. [2025-01-08 23:52:10,909 INFO L78 Accepts]: Start accepts. Automaton has 6659 states and 9084 transitions. Word has length 149 [2025-01-08 23:52:10,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:10,910 INFO L471 AbstractCegarLoop]: Abstraction has 6659 states and 9084 transitions. [2025-01-08 23:52:10,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 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-08 23:52:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 6659 states and 9084 transitions. [2025-01-08 23:52:10,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-08 23:52:10,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:10,915 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:10,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:52:10,915 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:10,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:10,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1541789798, now seen corresponding path program 1 times [2025-01-08 23:52:10,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:10,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759637909] [2025-01-08 23:52:10,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:10,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:10,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-08 23:52:10,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-08 23:52:10,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:10,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:11,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:11,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759637909] [2025-01-08 23:52:11,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759637909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:11,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:11,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:11,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768875507] [2025-01-08 23:52:11,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:11,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:11,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:11,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:11,297 INFO L87 Difference]: Start difference. First operand 6659 states and 9084 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-08 23:52:13,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:13,809 INFO L93 Difference]: Finished difference Result 14110 states and 19030 transitions. [2025-01-08 23:52:13,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:13,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 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 152 [2025-01-08 23:52:13,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:13,826 INFO L225 Difference]: With dead ends: 14110 [2025-01-08 23:52:13,826 INFO L226 Difference]: Without dead ends: 7453 [2025-01-08 23:52:13,834 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-08 23:52:13,835 INFO L435 NwaCegarLoop]: 1047 mSDtfsCounter, 707 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:13,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1176 Invalid, 2597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:52:13,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7453 states. [2025-01-08 23:52:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7453 to 7446. [2025-01-08 23:52:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7446 states, 7445 states have (on average 1.3305574210879785) internal successors, (9906), 7445 states have internal predecessors, (9906), 0 states have call successors, (0), 0 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-08 23:52:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7446 states to 7446 states and 9906 transitions. [2025-01-08 23:52:13,964 INFO L78 Accepts]: Start accepts. Automaton has 7446 states and 9906 transitions. Word has length 152 [2025-01-08 23:52:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:13,964 INFO L471 AbstractCegarLoop]: Abstraction has 7446 states and 9906 transitions. [2025-01-08 23:52:13,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 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-08 23:52:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 7446 states and 9906 transitions. [2025-01-08 23:52:13,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-08 23:52:13,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:13,966 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:13,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:52:13,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:13,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:13,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1050241686, now seen corresponding path program 1 times [2025-01-08 23:52:13,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:13,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425037044] [2025-01-08 23:52:13,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:13,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:13,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-08 23:52:14,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-08 23:52:14,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:14,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:14,119 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:14,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:14,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425037044] [2025-01-08 23:52:14,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425037044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:14,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:14,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:14,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336746121] [2025-01-08 23:52:14,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:14,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:14,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:14,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:14,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:14,122 INFO L87 Difference]: Start difference. First operand 7446 states and 9906 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-08 23:52:17,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:17,215 INFO L93 Difference]: Finished difference Result 17275 states and 24000 transitions. [2025-01-08 23:52:17,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:17,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 159 [2025-01-08 23:52:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:17,252 INFO L225 Difference]: With dead ends: 17275 [2025-01-08 23:52:17,252 INFO L226 Difference]: Without dead ends: 10618 [2025-01-08 23:52:17,262 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-08 23:52:17,263 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 894 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2406 mSolverCounterSat, 901 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 999 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 901 IncrementalHoareTripleChecker+Valid, 2406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:17,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 999 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [901 Valid, 2406 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:52:17,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10618 states. [2025-01-08 23:52:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10618 to 10608. [2025-01-08 23:52:17,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3126237390402564) internal successors, (13923), 10607 states have internal predecessors, (13923), 0 states have call successors, (0), 0 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-08 23:52:17,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 13923 transitions. [2025-01-08 23:52:17,449 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 13923 transitions. Word has length 159 [2025-01-08 23:52:17,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:17,449 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 13923 transitions. [2025-01-08 23:52:17,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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-08 23:52:17,450 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 13923 transitions. [2025-01-08 23:52:17,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-08 23:52:17,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:17,453 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:52:17,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:52:17,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:17,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:17,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1973206930, now seen corresponding path program 1 times [2025-01-08 23:52:17,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:17,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126931158] [2025-01-08 23:52:17,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:17,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:17,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-08 23:52:17,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-08 23:52:17,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:17,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:17,893 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:52:17,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:17,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126931158] [2025-01-08 23:52:17,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126931158] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:17,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:17,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642167348] [2025-01-08 23:52:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:17,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:52:17,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:17,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:52:17,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:52:17,896 INFO L87 Difference]: Start difference. First operand 10608 states and 13923 transitions. Second operand has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-08 23:52:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:22,634 INFO L93 Difference]: Finished difference Result 29882 states and 39625 transitions. [2025-01-08 23:52:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:52:22,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 168 [2025-01-08 23:52:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:22,680 INFO L225 Difference]: With dead ends: 29882 [2025-01-08 23:52:22,680 INFO L226 Difference]: Without dead ends: 20063 [2025-01-08 23:52:22,690 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-08 23:52:22,690 INFO L435 NwaCegarLoop]: 1007 mSDtfsCounter, 2376 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 4541 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2376 SdHoareTripleChecker+Valid, 1296 SdHoareTripleChecker+Invalid, 5334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 4541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:22,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2376 Valid, 1296 Invalid, 5334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 4541 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-08 23:52:22,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20063 states. [2025-01-08 23:52:22,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20063 to 20062. [2025-01-08 23:52:22,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20062 states, 20061 states have (on average 1.2496884502268082) internal successors, (25070), 20061 states have internal predecessors, (25070), 0 states have call successors, (0), 0 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-08 23:52:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20062 states to 20062 states and 25070 transitions. [2025-01-08 23:52:22,979 INFO L78 Accepts]: Start accepts. Automaton has 20062 states and 25070 transitions. Word has length 168 [2025-01-08 23:52:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:22,980 INFO L471 AbstractCegarLoop]: Abstraction has 20062 states and 25070 transitions. [2025-01-08 23:52:22,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 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-08 23:52:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 20062 states and 25070 transitions. [2025-01-08 23:52:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-08 23:52:22,984 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:22,984 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:52:22,985 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:22,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1204113758, now seen corresponding path program 1 times [2025-01-08 23:52:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923092597] [2025-01-08 23:52:22,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:23,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-08 23:52:23,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-08 23:52:23,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:23,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:23,224 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:52:23,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:23,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923092597] [2025-01-08 23:52:23,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923092597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:23,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:23,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:23,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066552490] [2025-01-08 23:52:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:23,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:23,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:23,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:23,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:23,227 INFO L87 Difference]: Start difference. First operand 20062 states and 25070 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-08 23:52:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:26,381 INFO L93 Difference]: Finished difference Result 55909 states and 70673 transitions. [2025-01-08 23:52:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:26,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 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 244 [2025-01-08 23:52:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:26,443 INFO L225 Difference]: With dead ends: 55909 [2025-01-08 23:52:26,443 INFO L226 Difference]: Without dead ends: 36636 [2025-01-08 23:52:26,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:26,472 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 907 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2887 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 3427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:26,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 641 Invalid, 3427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2887 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:52:26,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36636 states. [2025-01-08 23:52:26,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36636 to 36629. [2025-01-08 23:52:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36629 states, 36628 states have (on average 1.2235175275745331) internal successors, (44815), 36628 states have internal predecessors, (44815), 0 states have call successors, (0), 0 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-08 23:52:27,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36629 states to 36629 states and 44815 transitions. [2025-01-08 23:52:27,049 INFO L78 Accepts]: Start accepts. Automaton has 36629 states and 44815 transitions. Word has length 244 [2025-01-08 23:52:27,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:27,049 INFO L471 AbstractCegarLoop]: Abstraction has 36629 states and 44815 transitions. [2025-01-08 23:52:27,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 2 states have internal predecessors, (161), 0 states have call successors, (0), 0 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-08 23:52:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 36629 states and 44815 transitions. [2025-01-08 23:52:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-01-08 23:52:27,055 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:27,055 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:27,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:52:27,056 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:27,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:27,056 INFO L85 PathProgramCache]: Analyzing trace with hash -741045709, now seen corresponding path program 1 times [2025-01-08 23:52:27,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745620658] [2025-01-08 23:52:27,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:27,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:27,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-01-08 23:52:27,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-01-08 23:52:27,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:27,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:27,309 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:52:27,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:27,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745620658] [2025-01-08 23:52:27,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745620658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:27,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:27,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:52:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080086657] [2025-01-08 23:52:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:27,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:27,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:27,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:27,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:27,312 INFO L87 Difference]: Start difference. First operand 36629 states and 44815 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-08 23:52:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:30,446 INFO L93 Difference]: Finished difference Result 103154 states and 127129 transitions. [2025-01-08 23:52:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 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 293 [2025-01-08 23:52:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:30,583 INFO L225 Difference]: With dead ends: 103154 [2025-01-08 23:52:30,584 INFO L226 Difference]: Without dead ends: 67314 [2025-01-08 23:52:30,622 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-08 23:52:30,622 INFO L435 NwaCegarLoop]: 848 mSDtfsCounter, 852 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:30,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 995 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-08 23:52:30,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67314 states. [2025-01-08 23:52:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67314 to 61011. [2025-01-08 23:52:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61011 states, 61010 states have (on average 1.178019996721849) internal successors, (71871), 61010 states have internal predecessors, (71871), 0 states have call successors, (0), 0 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-08 23:52:31,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61011 states to 61011 states and 71871 transitions. [2025-01-08 23:52:31,668 INFO L78 Accepts]: Start accepts. Automaton has 61011 states and 71871 transitions. Word has length 293 [2025-01-08 23:52:31,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:31,671 INFO L471 AbstractCegarLoop]: Abstraction has 61011 states and 71871 transitions. [2025-01-08 23:52:31,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 2 states have internal predecessors, (190), 0 states have call successors, (0), 0 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-08 23:52:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 61011 states and 71871 transitions. [2025-01-08 23:52:31,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-08 23:52:31,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:31,680 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:31,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:52:31,680 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:31,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:31,682 INFO L85 PathProgramCache]: Analyzing trace with hash 520310513, now seen corresponding path program 1 times [2025-01-08 23:52:31,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:31,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951685173] [2025-01-08 23:52:31,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-08 23:52:31,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-08 23:52:31,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:31,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 23:52:31,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:31,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951685173] [2025-01-08 23:52:31,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951685173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:31,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:31,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504207289] [2025-01-08 23:52:31,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:31,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:52:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:31,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:52:31,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:52:31,963 INFO L87 Difference]: Start difference. First operand 61011 states and 71871 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:38,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:38,189 INFO L93 Difference]: Finished difference Result 172614 states and 205168 transitions. [2025-01-08 23:52:38,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:52:38,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2025-01-08 23:52:38,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:38,370 INFO L225 Difference]: With dead ends: 172614 [2025-01-08 23:52:38,370 INFO L226 Difference]: Without dead ends: 112392 [2025-01-08 23:52:38,432 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-08 23:52:38,433 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 1747 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6028 mSolverCounterSat, 1207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 7235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1207 IncrementalHoareTripleChecker+Valid, 6028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:38,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1747 Valid, 654 Invalid, 7235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1207 Valid, 6028 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2025-01-08 23:52:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112392 states. [2025-01-08 23:52:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112392 to 112261. [2025-01-08 23:52:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112261 states, 112260 states have (on average 1.1699893105291288) internal successors, (131343), 112260 states have internal predecessors, (131343), 0 states have call successors, (0), 0 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-08 23:52:39,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112261 states to 112261 states and 131343 transitions. [2025-01-08 23:52:39,663 INFO L78 Accepts]: Start accepts. Automaton has 112261 states and 131343 transitions. Word has length 351 [2025-01-08 23:52:39,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:39,663 INFO L471 AbstractCegarLoop]: Abstraction has 112261 states and 131343 transitions. [2025-01-08 23:52:39,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:39,663 INFO L276 IsEmpty]: Start isEmpty. Operand 112261 states and 131343 transitions. [2025-01-08 23:52:39,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-08 23:52:39,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:39,671 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:39,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:52:39,671 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:39,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:39,673 INFO L85 PathProgramCache]: Analyzing trace with hash -989420861, now seen corresponding path program 1 times [2025-01-08 23:52:39,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:39,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471456101] [2025-01-08 23:52:39,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:39,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:39,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:52:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:52:39,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:39,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:40,615 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 360 proven. 25 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 23:52:40,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471456101] [2025-01-08 23:52:40,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471456101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:40,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993368780] [2025-01-08 23:52:40,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:40,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:40,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:40,621 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-08 23:52:40,623 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-08 23:52:40,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:52:40,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:52:40,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:40,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:40,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:52:40,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 23:52:41,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:41,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993368780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:41,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:41,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:52:41,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834406965] [2025-01-08 23:52:41,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:41,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:41,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:41,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:41,363 INFO L87 Difference]: Start difference. First operand 112261 states and 131343 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:45,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:45,496 INFO L93 Difference]: Finished difference Result 273301 states and 323625 transitions. [2025-01-08 23:52:45,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:45,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 360 [2025-01-08 23:52:45,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:45,710 INFO L225 Difference]: With dead ends: 273301 [2025-01-08 23:52:45,710 INFO L226 Difference]: Without dead ends: 175220 [2025-01-08 23:52:45,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:52:45,796 INFO L435 NwaCegarLoop]: 958 mSDtfsCounter, 736 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 2457 mSolverCounterSat, 765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 736 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 765 IncrementalHoareTripleChecker+Valid, 2457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:45,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [736 Valid, 1128 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [765 Valid, 2457 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-01-08 23:52:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175220 states. [2025-01-08 23:52:47,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175220 to 120882. [2025-01-08 23:52:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120882 states, 120881 states have (on average 1.1501559384849562) internal successors, (139032), 120881 states have internal predecessors, (139032), 0 states have call successors, (0), 0 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-08 23:52:47,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120882 states to 120882 states and 139032 transitions. [2025-01-08 23:52:47,632 INFO L78 Accepts]: Start accepts. Automaton has 120882 states and 139032 transitions. Word has length 360 [2025-01-08 23:52:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:47,632 INFO L471 AbstractCegarLoop]: Abstraction has 120882 states and 139032 transitions. [2025-01-08 23:52:47,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:52:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 120882 states and 139032 transitions. [2025-01-08 23:52:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-01-08 23:52:47,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:47,641 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:47,652 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-08 23:52:47,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 23:52:47,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:47,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:47,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1411761199, now seen corresponding path program 1 times [2025-01-08 23:52:47,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:47,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403200344] [2025-01-08 23:52:47,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:47,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:47,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-08 23:52:47,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-08 23:52:47,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:47,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 344 proven. 113 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 23:52:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403200344] [2025-01-08 23:52:49,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403200344] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:52:49,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480129005] [2025-01-08 23:52:49,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:52:49,251 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-08 23:52:49,253 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-08 23:52:49,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-01-08 23:52:49,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-01-08 23:52:49,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:49,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:49,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:52:49,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:52:49,646 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2025-01-08 23:52:49,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:52:49,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480129005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:49,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:52:49,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:52:49,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451953776] [2025-01-08 23:52:49,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:49,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:49,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:49,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:49,648 INFO L87 Difference]: Start difference. First operand 120882 states and 139032 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-08 23:52:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:53,213 INFO L93 Difference]: Finished difference Result 240973 states and 277269 transitions. [2025-01-08 23:52:53,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:53,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 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 418 [2025-01-08 23:52:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:53,349 INFO L225 Difference]: With dead ends: 240973 [2025-01-08 23:52:53,349 INFO L226 Difference]: Without dead ends: 120880 [2025-01-08 23:52:53,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 417 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:52:53,381 INFO L435 NwaCegarLoop]: 1359 mSDtfsCounter, 1092 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:53,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1440 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:52:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120880 states. [2025-01-08 23:52:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120880 to 118518. [2025-01-08 23:52:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118518 states, 118517 states have (on average 1.1095792164837113) internal successors, (131504), 118517 states have internal predecessors, (131504), 0 states have call successors, (0), 0 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-08 23:52:54,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118518 states to 118518 states and 131504 transitions. [2025-01-08 23:52:54,479 INFO L78 Accepts]: Start accepts. Automaton has 118518 states and 131504 transitions. Word has length 418 [2025-01-08 23:52:54,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:52:54,479 INFO L471 AbstractCegarLoop]: Abstraction has 118518 states and 131504 transitions. [2025-01-08 23:52:54,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 0 states have call successors, (0), 0 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-08 23:52:54,479 INFO L276 IsEmpty]: Start isEmpty. Operand 118518 states and 131504 transitions. [2025-01-08 23:52:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-01-08 23:52:54,729 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:52:54,729 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:52:54,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:52:54,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:52:54,930 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:52:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:52:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1593092544, now seen corresponding path program 1 times [2025-01-08 23:52:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:52:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126983463] [2025-01-08 23:52:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:52:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:52:54,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 457 statements into 1 equivalence classes. [2025-01-08 23:52:54,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 457 of 457 statements. [2025-01-08 23:52:54,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:52:54,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:52:55,196 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:52:55,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:52:55,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126983463] [2025-01-08 23:52:55,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126983463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:52:55,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:52:55,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:52:55,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156518063] [2025-01-08 23:52:55,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:52:55,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:52:55,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:52:55,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:52:55,199 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:52:55,199 INFO L87 Difference]: Start difference. First operand 118518 states and 131504 transitions. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-08 23:52:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:52:58,686 INFO L93 Difference]: Finished difference Result 274826 states and 307793 transitions. [2025-01-08 23:52:58,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:52:58,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 457 [2025-01-08 23:52:58,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:52:58,848 INFO L225 Difference]: With dead ends: 274826 [2025-01-08 23:52:58,848 INFO L226 Difference]: Without dead ends: 157097 [2025-01-08 23:52:58,909 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-08 23:52:58,909 INFO L435 NwaCegarLoop]: 1809 mSDtfsCounter, 774 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 711 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 3278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 711 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:52:58,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1961 Invalid, 3278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [711 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:52:59,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157097 states. [2025-01-08 23:53:00,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157097 to 150783. [2025-01-08 23:53:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150783 states, 150782 states have (on average 1.094321603374408) internal successors, (165004), 150782 states have internal predecessors, (165004), 0 states have call successors, (0), 0 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-08 23:53:00,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150783 states to 150783 states and 165004 transitions. [2025-01-08 23:53:00,686 INFO L78 Accepts]: Start accepts. Automaton has 150783 states and 165004 transitions. Word has length 457 [2025-01-08 23:53:00,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:53:00,687 INFO L471 AbstractCegarLoop]: Abstraction has 150783 states and 165004 transitions. [2025-01-08 23:53:00,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 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-08 23:53:00,687 INFO L276 IsEmpty]: Start isEmpty. Operand 150783 states and 165004 transitions. [2025-01-08 23:53:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2025-01-08 23:53:00,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:53:00,704 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:53:00,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:53:00,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:53:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:53:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash -35368253, now seen corresponding path program 1 times [2025-01-08 23:53:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:53:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595955507] [2025-01-08 23:53:00,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:53:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:53:00,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 520 statements into 1 equivalence classes. [2025-01-08 23:53:00,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 520 of 520 statements. [2025-01-08 23:53:00,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:53:00,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:53:01,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1061 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-08 23:53:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:53:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595955507] [2025-01-08 23:53:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595955507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:53:01,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:53:01,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:53:01,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283945587] [2025-01-08 23:53:01,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:53:01,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:53:01,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:53:01,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:53:01,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:53:01,077 INFO L87 Difference]: Start difference. First operand 150783 states and 165004 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)