./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label26.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label26.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 d21e74f8974e22fefe5d2a2f720c109d2a535f54b9e443011df3f86444f64325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:12:41,543 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:12:41,622 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:12:41,629 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:12:41,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:12:41,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:12:41,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:12:41,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:12:41,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:12:41,659 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:12:41,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:12:41,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:12:41,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:12:41,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:12:41,661 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:12:41,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:12:41,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:12:41,662 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:12:41,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:12:41,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:12:41,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:12:41,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:12:41,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:12:41,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:12:41,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:12:41,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:12:41,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:12:41,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:12:41,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:12:41,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:12:41,663 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:12:41,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:12:41,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:12:41,664 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:12:41,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:12:41,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:12:41,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:12:41,665 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 -> d21e74f8974e22fefe5d2a2f720c109d2a535f54b9e443011df3f86444f64325 [2025-01-09 00:12:41,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:12:41,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:12:41,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:12:41,945 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:12:41,945 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:12:41,946 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label26.c [2025-01-09 00:12:43,315 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97120e73/4ef792fec9ab45ff8efc2aaae9de2e20/FLAG9117221b2 [2025-01-09 00:12:43,862 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:12:43,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label26.c [2025-01-09 00:12:43,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97120e73/4ef792fec9ab45ff8efc2aaae9de2e20/FLAG9117221b2 [2025-01-09 00:12:43,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d97120e73/4ef792fec9ab45ff8efc2aaae9de2e20 [2025-01-09 00:12:43,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:12:43,914 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:12:43,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:12:43,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:12:43,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:12:43,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:12:43" (1/1) ... [2025-01-09 00:12:43,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bea0c72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:43, skipping insertion in model container [2025-01-09 00:12:43,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:12:43" (1/1) ... [2025-01-09 00:12:43,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:12:44,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label26.c[4393,4406] [2025-01-09 00:12:44,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:12:44,588 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:12:44,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label26.c[4393,4406] [2025-01-09 00:12:44,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:12:44,870 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:12:44,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44 WrapperNode [2025-01-09 00:12:44,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:12:44,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:12:44,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:12:44,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:12:44,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:44,914 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,163 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-01-09 00:12:45,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:12:45,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:12:45,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:12:45,165 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:12:45,173 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,218 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,395 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:12:45,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,491 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,561 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:12:45,635 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:12:45,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:12:45,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:12:45,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (1/1) ... [2025-01-09 00:12:45,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:12:45,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:12:45,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:12:45,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:12:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:12:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:12:45,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:12:45,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:12:45,760 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:12:45,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:12:49,072 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-01-09 00:12:49,072 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:12:49,106 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:12:49,106 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:12:49,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:12:49 BoogieIcfgContainer [2025-01-09 00:12:49,107 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:12:49,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:12:49,114 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:12:49,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:12:49,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:12:43" (1/3) ... [2025-01-09 00:12:49,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070791f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:12:49, skipping insertion in model container [2025-01-09 00:12:49,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:12:44" (2/3) ... [2025-01-09 00:12:49,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070791f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:12:49, skipping insertion in model container [2025-01-09 00:12:49,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:12:49" (3/3) ... [2025-01-09 00:12:49,125 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label26.c [2025-01-09 00:12:49,140 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:12:49,143 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label26.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:12:49,221 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:12:49,234 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;@435d6112, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:12:49,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:12:49,243 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:49,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 00:12:49,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:49,249 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] [2025-01-09 00:12:49,249 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:49,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:49,254 INFO L85 PathProgramCache]: Analyzing trace with hash -161316190, now seen corresponding path program 1 times [2025-01-09 00:12:49,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:49,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086698901] [2025-01-09 00:12:49,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:49,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:49,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 00:12:49,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 00:12:49,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:49,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:49,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086698901] [2025-01-09 00:12:49,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086698901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:49,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:49,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:49,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588441644] [2025-01-09 00:12:49,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:49,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:49,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:49,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:49,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:49,584 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:51,861 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-01-09 00:12:51,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:51,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2025-01-09 00:12:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:51,878 INFO L225 Difference]: With dead ends: 1642 [2025-01-09 00:12:51,879 INFO L226 Difference]: Without dead ends: 975 [2025-01-09 00:12:51,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:51,889 INFO L435 NwaCegarLoop]: 474 mSDtfsCounter, 462 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:51,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:12:51,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-01-09 00:12:51,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-01-09 00:12:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-01-09 00:12:51,978 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 28 [2025-01-09 00:12:51,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:51,978 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-01-09 00:12:51,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-01-09 00:12:51,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 00:12:51,981 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:51,982 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:51,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:12:51,982 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:51,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:51,983 INFO L85 PathProgramCache]: Analyzing trace with hash 42655662, now seen corresponding path program 1 times [2025-01-09 00:12:51,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:51,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880567223] [2025-01-09 00:12:51,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:51,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:52,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 00:12:52,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 00:12:52,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:52,364 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:52,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:52,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880567223] [2025-01-09 00:12:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880567223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:52,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:52,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:12:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236564597] [2025-01-09 00:12:52,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:52,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:52,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:52,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:52,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:52,370 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:54,473 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2025-01-09 00:12:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:54,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2025-01-09 00:12:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:54,483 INFO L225 Difference]: With dead ends: 2814 [2025-01-09 00:12:54,483 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 00:12:54,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:54,487 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 463 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:54,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 920 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 00:12:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 00:12:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2025-01-09 00:12:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:54,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2025-01-09 00:12:54,540 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 98 [2025-01-09 00:12:54,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:54,541 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2025-01-09 00:12:54,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2025-01-09 00:12:54,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 00:12:54,546 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:54,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:54,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:12:54,547 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:54,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:54,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1931117519, now seen corresponding path program 1 times [2025-01-09 00:12:54,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:54,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070788719] [2025-01-09 00:12:54,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:54,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:54,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 00:12:54,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 00:12:54,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:54,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:54,790 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:54,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:54,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070788719] [2025-01-09 00:12:54,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070788719] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:54,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:54,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:54,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592272309] [2025-01-09 00:12:54,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:54,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:54,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:54,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:54,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:54,793 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:57,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:57,047 INFO L93 Difference]: Finished difference Result 5445 states and 7408 transitions. [2025-01-09 00:12:57,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:57,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-01-09 00:12:57,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:57,065 INFO L225 Difference]: With dead ends: 5445 [2025-01-09 00:12:57,066 INFO L226 Difference]: Without dead ends: 3605 [2025-01-09 00:12:57,069 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:57,070 INFO L435 NwaCegarLoop]: 223 mSDtfsCounter, 440 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:57,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 272 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:12:57,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2025-01-09 00:12:57,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 3583. [2025-01-09 00:12:57,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 1.3358458961474038) internal successors, (4785), 3582 states have internal predecessors, (4785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:57,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4785 transitions. [2025-01-09 00:12:57,155 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4785 transitions. Word has length 120 [2025-01-09 00:12:57,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:57,155 INFO L471 AbstractCegarLoop]: Abstraction has 3583 states and 4785 transitions. [2025-01-09 00:12:57,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4785 transitions. [2025-01-09 00:12:57,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 00:12:57,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:57,158 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:57,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:12:57,158 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:57,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:57,159 INFO L85 PathProgramCache]: Analyzing trace with hash 302164911, now seen corresponding path program 1 times [2025-01-09 00:12:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572893245] [2025-01-09 00:12:57,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:57,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:57,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 00:12:57,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 00:12:57,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:57,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:12:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:12:57,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:12:57,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572893245] [2025-01-09 00:12:57,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572893245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:12:57,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:12:57,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:12:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673765623] [2025-01-09 00:12:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:12:57,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:12:57,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:12:57,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:12:57,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:57,594 INFO L87 Difference]: Start difference. First operand 3583 states and 4785 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:12:59,804 INFO L93 Difference]: Finished difference Result 8893 states and 11846 transitions. [2025-01-09 00:12:59,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:12:59,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2025-01-09 00:12:59,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:12:59,821 INFO L225 Difference]: With dead ends: 8893 [2025-01-09 00:12:59,821 INFO L226 Difference]: Without dead ends: 5312 [2025-01-09 00:12:59,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:12:59,826 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 352 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 1800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 1665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:12:59,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 537 Invalid, 1800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 1665 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:12:59,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5312 states. [2025-01-09 00:12:59,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5312 to 5292. [2025-01-09 00:12:59,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5292 states, 5291 states have (on average 1.2797202797202798) internal successors, (6771), 5291 states have internal predecessors, (6771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5292 states to 5292 states and 6771 transitions. [2025-01-09 00:12:59,912 INFO L78 Accepts]: Start accepts. Automaton has 5292 states and 6771 transitions. Word has length 133 [2025-01-09 00:12:59,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:12:59,913 INFO L471 AbstractCegarLoop]: Abstraction has 5292 states and 6771 transitions. [2025-01-09 00:12:59,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:12:59,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5292 states and 6771 transitions. [2025-01-09 00:12:59,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 00:12:59,915 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:12:59,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:12:59,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:12:59,916 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:12:59,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:12:59,917 INFO L85 PathProgramCache]: Analyzing trace with hash -179422496, now seen corresponding path program 1 times [2025-01-09 00:12:59,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:12:59,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390082791] [2025-01-09 00:12:59,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:12:59,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:12:59,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 00:12:59,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 00:12:59,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:12:59,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:00,059 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:00,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:00,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390082791] [2025-01-09 00:13:00,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390082791] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:00,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:00,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:13:00,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400348559] [2025-01-09 00:13:00,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:00,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:00,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:00,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:00,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:00,062 INFO L87 Difference]: Start difference. First operand 5292 states and 6771 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:01,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:01,822 INFO L93 Difference]: Finished difference Result 12705 states and 16558 transitions. [2025-01-09 00:13:01,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:01,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 139 [2025-01-09 00:13:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:01,839 INFO L225 Difference]: With dead ends: 12705 [2025-01-09 00:13:01,839 INFO L226 Difference]: Without dead ends: 5711 [2025-01-09 00:13:01,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:01,849 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 347 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:01,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:13:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5711 states. [2025-01-09 00:13:01,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5711 to 4427. [2025-01-09 00:13:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4427 states, 4426 states have (on average 1.208992318120199) internal successors, (5351), 4426 states have internal predecessors, (5351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4427 states to 4427 states and 5351 transitions. [2025-01-09 00:13:01,930 INFO L78 Accepts]: Start accepts. Automaton has 4427 states and 5351 transitions. Word has length 139 [2025-01-09 00:13:01,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:01,931 INFO L471 AbstractCegarLoop]: Abstraction has 4427 states and 5351 transitions. [2025-01-09 00:13:01,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4427 states and 5351 transitions. [2025-01-09 00:13:01,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 00:13:01,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:01,933 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:13:01,933 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -663103291, now seen corresponding path program 1 times [2025-01-09 00:13:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849318929] [2025-01-09 00:13:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:01,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:01,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 00:13:01,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 00:13:01,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:01,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:02,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849318929] [2025-01-09 00:13:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849318929] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:02,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309966301] [2025-01-09 00:13:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:02,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:02,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:02,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:02,153 INFO L87 Difference]: Start difference. First operand 4427 states and 5351 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:03,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:03,773 INFO L93 Difference]: Finished difference Result 11399 states and 13997 transitions. [2025-01-09 00:13:03,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:03,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2025-01-09 00:13:03,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:03,789 INFO L225 Difference]: With dead ends: 11399 [2025-01-09 00:13:03,789 INFO L226 Difference]: Without dead ends: 6974 [2025-01-09 00:13:03,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:03,794 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:03,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 782 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:03,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6974 states. [2025-01-09 00:13:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6974 to 6974. [2025-01-09 00:13:03,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6974 states, 6973 states have (on average 1.1834217696830633) internal successors, (8252), 6973 states have internal predecessors, (8252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:03,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6974 states to 6974 states and 8252 transitions. [2025-01-09 00:13:03,904 INFO L78 Accepts]: Start accepts. Automaton has 6974 states and 8252 transitions. Word has length 180 [2025-01-09 00:13:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:03,904 INFO L471 AbstractCegarLoop]: Abstraction has 6974 states and 8252 transitions. [2025-01-09 00:13:03,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:03,905 INFO L276 IsEmpty]: Start isEmpty. Operand 6974 states and 8252 transitions. [2025-01-09 00:13:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 00:13:03,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:03,907 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:03,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:13:03,907 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:03,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:03,908 INFO L85 PathProgramCache]: Analyzing trace with hash -475483104, now seen corresponding path program 1 times [2025-01-09 00:13:03,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:03,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483207349] [2025-01-09 00:13:03,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:03,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 00:13:03,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 00:13:03,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:03,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-09 00:13:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483207349] [2025-01-09 00:13:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483207349] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:04,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:04,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:04,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313938396] [2025-01-09 00:13:04,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:04,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:04,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:04,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:04,056 INFO L87 Difference]: Start difference. First operand 6974 states and 8252 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:05,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:05,676 INFO L93 Difference]: Finished difference Result 16914 states and 20159 transitions. [2025-01-09 00:13:05,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:05,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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 182 [2025-01-09 00:13:05,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:05,702 INFO L225 Difference]: With dead ends: 16914 [2025-01-09 00:13:05,702 INFO L226 Difference]: Without dead ends: 9941 [2025-01-09 00:13:05,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:05,709 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 423 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:05,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:05,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9941 states. [2025-01-09 00:13:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9941 to 7373. [2025-01-09 00:13:05,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7372 states have (on average 1.1795984807379274) internal successors, (8696), 7372 states have internal predecessors, (8696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 8696 transitions. [2025-01-09 00:13:05,824 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 8696 transitions. Word has length 182 [2025-01-09 00:13:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:05,824 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 8696 transitions. [2025-01-09 00:13:05,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:05,825 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 8696 transitions. [2025-01-09 00:13:05,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-01-09 00:13:05,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:05,831 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:05,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:13:05,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:05,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:05,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1208215366, now seen corresponding path program 1 times [2025-01-09 00:13:05,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:05,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637547305] [2025-01-09 00:13:05,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:05,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:05,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 00:13:05,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 00:13:05,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:05,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 51 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:06,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:06,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637547305] [2025-01-09 00:13:06,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637547305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:06,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76354281] [2025-01-09 00:13:06,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:06,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:06,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:06,224 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:06,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:13:06,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-01-09 00:13:06,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-01-09 00:13:06,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:06,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:06,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:13:06,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 51 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:06,687 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:13:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:07,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76354281] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:07,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:13:07,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2025-01-09 00:13:07,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872475903] [2025-01-09 00:13:07,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:07,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:07,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:07,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:07,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:13:07,061 INFO L87 Difference]: Start difference. First operand 7373 states and 8696 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:09,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:09,945 INFO L93 Difference]: Finished difference Result 23711 states and 27966 transitions. [2025-01-09 00:13:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:09,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 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 248 [2025-01-09 00:13:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:09,979 INFO L225 Difference]: With dead ends: 23711 [2025-01-09 00:13:09,980 INFO L226 Difference]: Without dead ends: 16340 [2025-01-09 00:13:09,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 497 GetRequests, 491 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:13:09,992 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 971 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2172 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 971 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 2172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:09,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [971 Valid, 153 Invalid, 3188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 2172 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 00:13:10,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16340 states. [2025-01-09 00:13:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16340 to 16337. [2025-01-09 00:13:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16337 states, 16336 states have (on average 1.1649730656219393) internal successors, (19031), 16336 states have internal predecessors, (19031), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16337 states to 16337 states and 19031 transitions. [2025-01-09 00:13:10,276 INFO L78 Accepts]: Start accepts. Automaton has 16337 states and 19031 transitions. Word has length 248 [2025-01-09 00:13:10,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:10,276 INFO L471 AbstractCegarLoop]: Abstraction has 16337 states and 19031 transitions. [2025-01-09 00:13:10,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:10,277 INFO L276 IsEmpty]: Start isEmpty. Operand 16337 states and 19031 transitions. [2025-01-09 00:13:10,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-01-09 00:13:10,281 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:10,281 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:10,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:13:10,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:10,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:10,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:10,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1731845795, now seen corresponding path program 1 times [2025-01-09 00:13:10,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:10,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379546902] [2025-01-09 00:13:10,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:10,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:10,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes. [2025-01-09 00:13:10,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements. [2025-01-09 00:13:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 00:13:10,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379546902] [2025-01-09 00:13:10,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379546902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:10,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:10,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:10,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876133488] [2025-01-09 00:13:10,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:10,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:10,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:10,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:10,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:10,633 INFO L87 Difference]: Start difference. First operand 16337 states and 19031 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:12,296 INFO L93 Difference]: Finished difference Result 36073 states and 42175 transitions. [2025-01-09 00:13:12,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:12,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 260 [2025-01-09 00:13:12,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:12,336 INFO L225 Difference]: With dead ends: 36073 [2025-01-09 00:13:12,336 INFO L226 Difference]: Without dead ends: 19313 [2025-01-09 00:13:12,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:12,354 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 383 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:12,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 841 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19313 states. [2025-01-09 00:13:12,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19313 to 19313. [2025-01-09 00:13:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19313 states, 19312 states have (on average 1.144003728251864) internal successors, (22093), 19312 states have internal predecessors, (22093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:12,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19313 states to 19313 states and 22093 transitions. [2025-01-09 00:13:12,591 INFO L78 Accepts]: Start accepts. Automaton has 19313 states and 22093 transitions. Word has length 260 [2025-01-09 00:13:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:12,591 INFO L471 AbstractCegarLoop]: Abstraction has 19313 states and 22093 transitions. [2025-01-09 00:13:12,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:12,592 INFO L276 IsEmpty]: Start isEmpty. Operand 19313 states and 22093 transitions. [2025-01-09 00:13:12,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2025-01-09 00:13:12,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:12,598 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:12,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:13:12,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:12,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:12,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1772011398, now seen corresponding path program 1 times [2025-01-09 00:13:12,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:12,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522252988] [2025-01-09 00:13:12,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:12,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:12,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 300 statements into 1 equivalence classes. [2025-01-09 00:13:12,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 300 of 300 statements. [2025-01-09 00:13:12,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:12,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-01-09 00:13:12,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:12,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522252988] [2025-01-09 00:13:12,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522252988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:12,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:12,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:12,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63281412] [2025-01-09 00:13:12,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:12,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:12,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:12,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:12,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:12,799 INFO L87 Difference]: Start difference. First operand 19313 states and 22093 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:14,517 INFO L93 Difference]: Finished difference Result 42454 states and 48690 transitions. [2025-01-09 00:13:14,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:14,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 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 300 [2025-01-09 00:13:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:14,570 INFO L225 Difference]: With dead ends: 42454 [2025-01-09 00:13:14,570 INFO L226 Difference]: Without dead ends: 22709 [2025-01-09 00:13:14,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:14,589 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 462 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:14,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 361 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:14,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22709 states. [2025-01-09 00:13:14,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22709 to 21854. [2025-01-09 00:13:14,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21854 states, 21853 states have (on average 1.1356335514574658) internal successors, (24817), 21853 states have internal predecessors, (24817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21854 states to 21854 states and 24817 transitions. [2025-01-09 00:13:14,848 INFO L78 Accepts]: Start accepts. Automaton has 21854 states and 24817 transitions. Word has length 300 [2025-01-09 00:13:14,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:14,848 INFO L471 AbstractCegarLoop]: Abstraction has 21854 states and 24817 transitions. [2025-01-09 00:13:14,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:14,849 INFO L276 IsEmpty]: Start isEmpty. Operand 21854 states and 24817 transitions. [2025-01-09 00:13:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2025-01-09 00:13:14,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:14,855 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:14,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:13:14,855 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:14,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:14,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1522923844, now seen corresponding path program 1 times [2025-01-09 00:13:14,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220375373] [2025-01-09 00:13:14,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:14,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 322 statements into 1 equivalence classes. [2025-01-09 00:13:14,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 322 of 322 statements. [2025-01-09 00:13:14,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:14,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:15,145 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-09 00:13:15,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:15,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220375373] [2025-01-09 00:13:15,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220375373] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:15,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:15,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:15,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743174685] [2025-01-09 00:13:15,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:15,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:15,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:15,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:15,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:15,147 INFO L87 Difference]: Start difference. First operand 21854 states and 24817 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:16,719 INFO L93 Difference]: Finished difference Result 52660 states and 59608 transitions. [2025-01-09 00:13:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:16,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 322 [2025-01-09 00:13:16,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:16,767 INFO L225 Difference]: With dead ends: 52660 [2025-01-09 00:13:16,767 INFO L226 Difference]: Without dead ends: 30808 [2025-01-09 00:13:16,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:16,787 INFO L435 NwaCegarLoop]: 769 mSDtfsCounter, 322 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 826 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:16,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 826 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1351 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:13:16,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30808 states. [2025-01-09 00:13:17,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30808 to 29090. [2025-01-09 00:13:17,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29090 states, 29089 states have (on average 1.1231393310185982) internal successors, (32671), 29089 states have internal predecessors, (32671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:17,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 32671 transitions. [2025-01-09 00:13:17,125 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 32671 transitions. Word has length 322 [2025-01-09 00:13:17,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:17,126 INFO L471 AbstractCegarLoop]: Abstraction has 29090 states and 32671 transitions. [2025-01-09 00:13:17,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:17,126 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 32671 transitions. [2025-01-09 00:13:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-09 00:13:17,134 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:17,134 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:17,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:13:17,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:17,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:17,136 INFO L85 PathProgramCache]: Analyzing trace with hash 310700039, now seen corresponding path program 1 times [2025-01-09 00:13:17,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:17,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303623646] [2025-01-09 00:13:17,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:17,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:17,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 00:13:17,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 00:13:17,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:17,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:17,555 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 212 proven. 78 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:13:17,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303623646] [2025-01-09 00:13:17,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303623646] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:17,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667891595] [2025-01-09 00:13:17,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:17,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:17,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:17,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:17,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:13:17,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 00:13:17,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 00:13:17,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:17,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:17,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 00:13:17,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 212 proven. 78 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:13:17,914 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:13:18,160 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:13:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667891595] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:13:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-09 00:13:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504521012] [2025-01-09 00:13:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:18,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:18,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:18,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:18,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:13:18,164 INFO L87 Difference]: Start difference. First operand 29090 states and 32671 transitions. Second operand has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:20,587 INFO L93 Difference]: Finished difference Result 69692 states and 78483 transitions. [2025-01-09 00:13:20,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:20,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 327 [2025-01-09 00:13:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:20,637 INFO L225 Difference]: With dead ends: 69692 [2025-01-09 00:13:20,637 INFO L226 Difference]: Without dead ends: 40176 [2025-01-09 00:13:20,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 651 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:13:20,665 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 892 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 583 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 892 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 583 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:20,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [892 Valid, 175 Invalid, 2857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [583 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 00:13:20,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40176 states. [2025-01-09 00:13:21,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40176 to 38048. [2025-01-09 00:13:21,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38048 states, 38047 states have (on average 1.1306279075879833) internal successors, (43017), 38047 states have internal predecessors, (43017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:21,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38048 states to 38048 states and 43017 transitions. [2025-01-09 00:13:21,322 INFO L78 Accepts]: Start accepts. Automaton has 38048 states and 43017 transitions. Word has length 327 [2025-01-09 00:13:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:21,323 INFO L471 AbstractCegarLoop]: Abstraction has 38048 states and 43017 transitions. [2025-01-09 00:13:21,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.5) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:21,323 INFO L276 IsEmpty]: Start isEmpty. Operand 38048 states and 43017 transitions. [2025-01-09 00:13:21,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-09 00:13:21,327 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:21,327 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:21,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 00:13:21,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:21,528 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:21,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:21,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2146965459, now seen corresponding path program 1 times [2025-01-09 00:13:21,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:21,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760456423] [2025-01-09 00:13:21,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:21,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:21,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-09 00:13:21,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-09 00:13:21,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:21,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:22,298 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 320 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:13:22,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:22,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760456423] [2025-01-09 00:13:22,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760456423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:22,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:22,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:13:22,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178988518] [2025-01-09 00:13:22,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:22,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:13:22,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:22,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:13:22,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:22,301 INFO L87 Difference]: Start difference. First operand 38048 states and 43017 transitions. Second operand has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:24,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:24,141 INFO L93 Difference]: Finished difference Result 79926 states and 90108 transitions. [2025-01-09 00:13:24,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:24,141 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 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 340 [2025-01-09 00:13:24,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:24,184 INFO L225 Difference]: With dead ends: 79926 [2025-01-09 00:13:24,184 INFO L226 Difference]: Without dead ends: 41880 [2025-01-09 00:13:24,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:13:24,211 INFO L435 NwaCegarLoop]: 764 mSDtfsCounter, 788 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:24,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 864 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:13:24,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41880 states. [2025-01-09 00:13:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41880 to 41879. [2025-01-09 00:13:24,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41879 states, 41878 states have (on average 1.122403171116099) internal successors, (47004), 41878 states have internal predecessors, (47004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41879 states to 41879 states and 47004 transitions. [2025-01-09 00:13:24,607 INFO L78 Accepts]: Start accepts. Automaton has 41879 states and 47004 transitions. Word has length 340 [2025-01-09 00:13:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:24,608 INFO L471 AbstractCegarLoop]: Abstraction has 41879 states and 47004 transitions. [2025-01-09 00:13:24,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.0) internal successors, (315), 5 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 41879 states and 47004 transitions. [2025-01-09 00:13:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-01-09 00:13:24,612 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:24,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:24,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:13:24,612 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:24,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash 797983475, now seen corresponding path program 1 times [2025-01-09 00:13:24,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:24,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660225721] [2025-01-09 00:13:24,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:24,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-01-09 00:13:24,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-01-09 00:13:24,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:24,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:13:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660225721] [2025-01-09 00:13:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660225721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:24,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742759284] [2025-01-09 00:13:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:24,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:24,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:24,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:24,936 INFO L87 Difference]: Start difference. First operand 41879 states and 47004 transitions. Second operand has 4 states, 4 states have (on average 91.75) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:26,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:26,989 INFO L93 Difference]: Finished difference Result 88006 states and 98569 transitions. [2025-01-09 00:13:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:26,991 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 367 [2025-01-09 00:13:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:27,040 INFO L225 Difference]: With dead ends: 88006 [2025-01-09 00:13:27,040 INFO L226 Difference]: Without dead ends: 45704 [2025-01-09 00:13:27,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:27,066 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 594 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2328 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 2328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:27,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 251 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 2328 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:13:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45704 states. [2025-01-09 00:13:27,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45704 to 42304. [2025-01-09 00:13:27,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42304 states, 42303 states have (on average 1.1212207172068174) internal successors, (47431), 42303 states have internal predecessors, (47431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:27,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42304 states to 42304 states and 47431 transitions. [2025-01-09 00:13:27,615 INFO L78 Accepts]: Start accepts. Automaton has 42304 states and 47431 transitions. Word has length 367 [2025-01-09 00:13:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:27,616 INFO L471 AbstractCegarLoop]: Abstraction has 42304 states and 47431 transitions. [2025-01-09 00:13:27,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.75) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:27,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42304 states and 47431 transitions. [2025-01-09 00:13:27,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2025-01-09 00:13:27,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:27,621 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:27,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:13:27,622 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:27,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash -908764786, now seen corresponding path program 1 times [2025-01-09 00:13:27,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:27,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739300811] [2025-01-09 00:13:27,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:27,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 383 statements into 1 equivalence classes. [2025-01-09 00:13:27,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 383 of 383 statements. [2025-01-09 00:13:27,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:27,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:27,894 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 283 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-01-09 00:13:27,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:27,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739300811] [2025-01-09 00:13:27,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739300811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:27,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:27,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781379414] [2025-01-09 00:13:27,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:27,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:27,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:27,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:27,897 INFO L87 Difference]: Start difference. First operand 42304 states and 47431 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:29,456 INFO L93 Difference]: Finished difference Result 98238 states and 110465 transitions. [2025-01-09 00:13:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 383 [2025-01-09 00:13:29,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:29,515 INFO L225 Difference]: With dead ends: 98238 [2025-01-09 00:13:29,515 INFO L226 Difference]: Without dead ends: 55079 [2025-01-09 00:13:29,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:29,547 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 415 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:29,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 661 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55079 states. [2025-01-09 00:13:30,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55079 to 50808. [2025-01-09 00:13:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50808 states, 50807 states have (on average 1.1212825004428524) internal successors, (56969), 50807 states have internal predecessors, (56969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:30,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50808 states to 50808 states and 56969 transitions. [2025-01-09 00:13:30,266 INFO L78 Accepts]: Start accepts. Automaton has 50808 states and 56969 transitions. Word has length 383 [2025-01-09 00:13:30,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:30,267 INFO L471 AbstractCegarLoop]: Abstraction has 50808 states and 56969 transitions. [2025-01-09 00:13:30,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:30,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50808 states and 56969 transitions. [2025-01-09 00:13:30,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-01-09 00:13:30,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:30,273 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:30,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:13:30,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:30,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1221123878, now seen corresponding path program 1 times [2025-01-09 00:13:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335810097] [2025-01-09 00:13:30,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:30,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:30,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 00:13:30,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 00:13:30,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:30,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:31,103 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 511 proven. 80 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:13:31,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:31,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335810097] [2025-01-09 00:13:31,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335810097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:31,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438226553] [2025-01-09 00:13:31,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:31,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:31,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:31,106 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:31,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:13:31,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-01-09 00:13:31,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-01-09 00:13:31,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:31,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:31,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:13:31,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 591 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 00:13:31,673 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:13:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438226553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:13:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 00:13:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588941339] [2025-01-09 00:13:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:31,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:31,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:31,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:31,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:13:31,677 INFO L87 Difference]: Start difference. First operand 50808 states and 56969 transitions. Second operand has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:33,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:33,704 INFO L93 Difference]: Finished difference Result 102889 states and 115291 transitions. [2025-01-09 00:13:33,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:33,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 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 422 [2025-01-09 00:13:33,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:33,775 INFO L225 Difference]: With dead ends: 102889 [2025-01-09 00:13:33,775 INFO L226 Difference]: Without dead ends: 52508 [2025-01-09 00:13:33,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 421 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:13:33,807 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 816 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 816 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:33,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [816 Valid, 352 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:13:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52508 states. [2025-01-09 00:13:34,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52508 to 51658. [2025-01-09 00:13:34,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51658 states, 51657 states have (on average 1.1200998896567744) internal successors, (57861), 51657 states have internal predecessors, (57861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51658 states to 51658 states and 57861 transitions. [2025-01-09 00:13:34,223 INFO L78 Accepts]: Start accepts. Automaton has 51658 states and 57861 transitions. Word has length 422 [2025-01-09 00:13:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:34,224 INFO L471 AbstractCegarLoop]: Abstraction has 51658 states and 57861 transitions. [2025-01-09 00:13:34,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.25) internal successors, (397), 4 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:34,224 INFO L276 IsEmpty]: Start isEmpty. Operand 51658 states and 57861 transitions. [2025-01-09 00:13:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2025-01-09 00:13:34,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:34,228 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:34,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:13:34,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:34,429 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:34,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:34,429 INFO L85 PathProgramCache]: Analyzing trace with hash 713394919, now seen corresponding path program 1 times [2025-01-09 00:13:34,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:34,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699654275] [2025-01-09 00:13:34,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:34,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:34,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes. [2025-01-09 00:13:34,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements. [2025-01-09 00:13:34,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:34,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-01-09 00:13:34,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:34,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699654275] [2025-01-09 00:13:34,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699654275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:34,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:34,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:34,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541767226] [2025-01-09 00:13:34,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:34,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:34,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:34,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:34,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:34,671 INFO L87 Difference]: Start difference. First operand 51658 states and 57861 transitions. Second operand has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:36,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:36,413 INFO L93 Difference]: Finished difference Result 116518 states and 130576 transitions. [2025-01-09 00:13:36,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:36,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 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 428 [2025-01-09 00:13:36,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:36,482 INFO L225 Difference]: With dead ends: 116518 [2025-01-09 00:13:36,482 INFO L226 Difference]: Without dead ends: 64012 [2025-01-09 00:13:36,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:36,508 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 447 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1187 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 1486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:36,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 597 Invalid, 1486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1187 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:36,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64012 states. [2025-01-09 00:13:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64012 to 50809. [2025-01-09 00:13:36,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50809 states, 50808 states have (on average 1.1149228467957801) internal successors, (56647), 50808 states have internal predecessors, (56647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50809 states to 50809 states and 56647 transitions. [2025-01-09 00:13:36,997 INFO L78 Accepts]: Start accepts. Automaton has 50809 states and 56647 transitions. Word has length 428 [2025-01-09 00:13:36,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:36,997 INFO L471 AbstractCegarLoop]: Abstraction has 50809 states and 56647 transitions. [2025-01-09 00:13:36,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 50809 states and 56647 transitions. [2025-01-09 00:13:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 00:13:37,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:37,002 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:37,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:13:37,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:37,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1395504240, now seen corresponding path program 1 times [2025-01-09 00:13:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:37,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600366176] [2025-01-09 00:13:37,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:37,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:37,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 00:13:37,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 00:13:37,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:37,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:37,259 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:13:37,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600366176] [2025-01-09 00:13:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600366176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:37,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:37,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:37,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139848778] [2025-01-09 00:13:37,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:37,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:37,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:37,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:37,260 INFO L87 Difference]: Start difference. First operand 50809 states and 56647 transitions. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:38,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:38,853 INFO L93 Difference]: Finished difference Result 109699 states and 122434 transitions. [2025-01-09 00:13:38,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:38,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 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 432 [2025-01-09 00:13:38,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:38,924 INFO L225 Difference]: With dead ends: 109699 [2025-01-09 00:13:38,924 INFO L226 Difference]: Without dead ends: 58885 [2025-01-09 00:13:38,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:38,961 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 501 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1167 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 1358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:38,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 690 Invalid, 1358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1167 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:13:38,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58885 states. [2025-01-09 00:13:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58885 to 58878. [2025-01-09 00:13:39,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58878 states, 58877 states have (on average 1.1046928342136997) internal successors, (65041), 58877 states have internal predecessors, (65041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58878 states to 58878 states and 65041 transitions. [2025-01-09 00:13:39,680 INFO L78 Accepts]: Start accepts. Automaton has 58878 states and 65041 transitions. Word has length 432 [2025-01-09 00:13:39,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:39,680 INFO L471 AbstractCegarLoop]: Abstraction has 58878 states and 65041 transitions. [2025-01-09 00:13:39,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:39,680 INFO L276 IsEmpty]: Start isEmpty. Operand 58878 states and 65041 transitions. [2025-01-09 00:13:39,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 437 [2025-01-09 00:13:39,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:39,687 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:39,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 00:13:39,687 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:39,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:39,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1910882087, now seen corresponding path program 1 times [2025-01-09 00:13:39,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:39,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547164987] [2025-01-09 00:13:39,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:39,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:39,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-01-09 00:13:39,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-01-09 00:13:39,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:39,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-01-09 00:13:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:39,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547164987] [2025-01-09 00:13:39,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547164987] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:39,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:39,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:13:39,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099653769] [2025-01-09 00:13:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:39,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:13:39,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:39,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:13:39,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:39,969 INFO L87 Difference]: Start difference. First operand 58878 states and 65041 transitions. Second operand has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:42,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:42,427 INFO L93 Difference]: Finished difference Result 130571 states and 143707 transitions. [2025-01-09 00:13:42,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:13:42,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 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 436 [2025-01-09 00:13:42,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:42,503 INFO L225 Difference]: With dead ends: 130571 [2025-01-09 00:13:42,503 INFO L226 Difference]: Without dead ends: 72120 [2025-01-09 00:13:42,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:13:42,540 INFO L435 NwaCegarLoop]: 657 mSDtfsCounter, 882 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2871 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 2871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:42,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 775 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 2871 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 00:13:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72120 states. [2025-01-09 00:13:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72120 to 59728. [2025-01-09 00:13:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59728 states, 59727 states have (on average 1.1042074773553) internal successors, (65951), 59727 states have internal predecessors, (65951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:43,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59728 states to 59728 states and 65951 transitions. [2025-01-09 00:13:43,302 INFO L78 Accepts]: Start accepts. Automaton has 59728 states and 65951 transitions. Word has length 436 [2025-01-09 00:13:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:43,303 INFO L471 AbstractCegarLoop]: Abstraction has 59728 states and 65951 transitions. [2025-01-09 00:13:43,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.5) internal successors, (274), 4 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 59728 states and 65951 transitions. [2025-01-09 00:13:43,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2025-01-09 00:13:43,309 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:43,310 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:43,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:13:43,310 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:43,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1979717524, now seen corresponding path program 1 times [2025-01-09 00:13:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:43,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587946178] [2025-01-09 00:13:43,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:43,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:43,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 452 statements into 1 equivalence classes. [2025-01-09 00:13:43,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 452 of 452 statements. [2025-01-09 00:13:43,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:43,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 628 backedges. 389 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 00:13:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587946178] [2025-01-09 00:13:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587946178] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:43,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:43,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083572833] [2025-01-09 00:13:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:43,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:43,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:43,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:43,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:43,535 INFO L87 Difference]: Start difference. First operand 59728 states and 65951 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:45,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:45,357 INFO L93 Difference]: Finished difference Result 136917 states and 151631 transitions. [2025-01-09 00:13:45,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:45,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 452 [2025-01-09 00:13:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:45,426 INFO L225 Difference]: With dead ends: 136917 [2025-01-09 00:13:45,426 INFO L226 Difference]: Without dead ends: 77616 [2025-01-09 00:13:45,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:45,451 INFO L435 NwaCegarLoop]: 218 mSDtfsCounter, 378 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:45,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 263 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:13:45,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77616 states. [2025-01-09 00:13:46,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77616 to 74188. [2025-01-09 00:13:46,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74188 states, 74187 states have (on average 1.1007049752652083) internal successors, (81658), 74187 states have internal predecessors, (81658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:46,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74188 states to 74188 states and 81658 transitions. [2025-01-09 00:13:46,319 INFO L78 Accepts]: Start accepts. Automaton has 74188 states and 81658 transitions. Word has length 452 [2025-01-09 00:13:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 74188 states and 81658 transitions. [2025-01-09 00:13:46,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 74188 states and 81658 transitions. [2025-01-09 00:13:46,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-01-09 00:13:46,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:46,327 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:46,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:13:46,327 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:46,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:46,328 INFO L85 PathProgramCache]: Analyzing trace with hash 82414908, now seen corresponding path program 1 times [2025-01-09 00:13:46,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:46,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335367622] [2025-01-09 00:13:46,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:46,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:46,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-01-09 00:13:46,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-01-09 00:13:46,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:46,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:46,556 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 527 trivial. 0 not checked. [2025-01-09 00:13:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335367622] [2025-01-09 00:13:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335367622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:13:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:13:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:13:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832363283] [2025-01-09 00:13:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:13:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:13:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:46,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:13:46,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:46,557 INFO L87 Difference]: Start difference. First operand 74188 states and 81658 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:13:48,455 INFO L93 Difference]: Finished difference Result 157752 states and 173394 transitions. [2025-01-09 00:13:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:13:48,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 477 [2025-01-09 00:13:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:13:48,548 INFO L225 Difference]: With dead ends: 157752 [2025-01-09 00:13:48,548 INFO L226 Difference]: Without dead ends: 82284 [2025-01-09 00:13:48,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:13:48,593 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 425 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 1408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:13:48,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 769 Invalid, 1408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1250 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:13:48,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82284 states. [2025-01-09 00:13:49,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82284 to 82265. [2025-01-09 00:13:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82265 states, 82264 states have (on average 1.0905013128464456) internal successors, (89709), 82264 states have internal predecessors, (89709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:49,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82265 states to 82265 states and 89709 transitions. [2025-01-09 00:13:49,596 INFO L78 Accepts]: Start accepts. Automaton has 82265 states and 89709 transitions. Word has length 477 [2025-01-09 00:13:49,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:13:49,596 INFO L471 AbstractCegarLoop]: Abstraction has 82265 states and 89709 transitions. [2025-01-09 00:13:49,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:13:49,596 INFO L276 IsEmpty]: Start isEmpty. Operand 82265 states and 89709 transitions. [2025-01-09 00:13:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-01-09 00:13:49,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:13:49,602 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:13:49,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:13:49,603 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:13:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:13:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 41914178, now seen corresponding path program 1 times [2025-01-09 00:13:49,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:13:49,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727133678] [2025-01-09 00:13:49,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:49,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:13:49,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-01-09 00:13:49,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-01-09 00:13:49,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:49,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:50,159 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 392 proven. 26 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-09 00:13:50,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:13:50,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727133678] [2025-01-09 00:13:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727133678] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:13:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250270462] [2025-01-09 00:13:50,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:13:50,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:13:50,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:13:50,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:13:50,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:13:50,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-01-09 00:13:50,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-01-09 00:13:50,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:13:50,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:13:50,334 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 00:13:50,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:13:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 582 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 00:13:51,358 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:13:51,805 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 448 proven. 52 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-09 00:13:51,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250270462] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:13:51,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:13:51,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 9 [2025-01-09 00:13:51,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505543158] [2025-01-09 00:13:51,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:13:51,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:13:51,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:13:51,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:13:51,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:13:51,808 INFO L87 Difference]: Start difference. First operand 82265 states and 89709 transitions. Second operand has 9 states, 9 states have (on average 74.22222222222223) internal successors, (668), 9 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)