./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label17.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/Problem15_label17.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 42b374d0017cdae74eebab609ba5393370e8c987522e66a98f57a11c3f33505a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:01:28,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:01:28,105 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:01:28,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:01:28,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:01:28,132 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:01:28,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:01:28,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:01:28,134 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:01:28,134 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:01:28,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:01:28,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:01:28,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:01:28,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:01:28,136 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:01:28,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:01:28,136 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:01:28,136 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:01:28,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:01:28,137 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:01:28,137 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:01:28,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:01:28,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:01:28,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:01:28,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:28,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:28,139 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:01:28,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:01:28,140 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:01:28,140 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:01:28,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:01:28,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:01:28,140 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 -> 42b374d0017cdae74eebab609ba5393370e8c987522e66a98f57a11c3f33505a [2025-01-09 00:01:28,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:01:28,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:01:28,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:01:28,422 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:01:28,422 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:01:28,424 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label17.c [2025-01-09 00:01:29,685 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfce365c5/42e264edf0b54aada0f39e63e4bbf6cf/FLAG404d8a0d0 [2025-01-09 00:01:30,132 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:01:30,133 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c [2025-01-09 00:01:30,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfce365c5/42e264edf0b54aada0f39e63e4bbf6cf/FLAG404d8a0d0 [2025-01-09 00:01:30,169 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cfce365c5/42e264edf0b54aada0f39e63e4bbf6cf [2025-01-09 00:01:30,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:01:30,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:01:30,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:01:30,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:01:30,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:01:30,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:30,180 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c731b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30, skipping insertion in model container [2025-01-09 00:01:30,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:30,232 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:01:30,408 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/Problem15_label17.c[7664,7677] [2025-01-09 00:01:30,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:01:30,672 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:01:30,700 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/Problem15_label17.c[7664,7677] [2025-01-09 00:01:30,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:01:30,880 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:01:30,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30 WrapperNode [2025-01-09 00:01:30,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:01:30,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:01:30,882 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:01:30,882 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:01:30,887 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:01:30" (1/1) ... [2025-01-09 00:01:30,915 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:01:30" (1/1) ... [2025-01-09 00:01:31,042 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1757 [2025-01-09 00:01:31,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:01:31,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:01:31,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:01:31,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:01:31,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,074 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,175 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:01:31,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,388 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:01:31,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:01:31,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:01:31,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:01:31,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (1/1) ... [2025-01-09 00:01:31,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:01:31,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:31,423 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:01:31,429 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:01:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:01:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:01:31,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:01:31,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:01:31,495 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:01:31,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:01:33,824 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2025-01-09 00:01:33,825 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:01:33,855 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:01:33,856 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:01:33,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:33 BoogieIcfgContainer [2025-01-09 00:01:33,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:01:33,860 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:01:33,861 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:01:33,866 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:01:33,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:01:30" (1/3) ... [2025-01-09 00:01:33,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a186ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:01:33, skipping insertion in model container [2025-01-09 00:01:33,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:01:30" (2/3) ... [2025-01-09 00:01:33,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a186ea8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:01:33, skipping insertion in model container [2025-01-09 00:01:33,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:33" (3/3) ... [2025-01-09 00:01:33,869 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem15_label17.c [2025-01-09 00:01:33,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:01:33,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem15_label17.c that has 1 procedures, 424 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:01:33,943 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:01:33,955 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;@1c350f10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:01:33,955 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:01:33,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states 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:01:33,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 00:01:33,966 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:33,967 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:33,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:33,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:33,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1826551956, now seen corresponding path program 1 times [2025-01-09 00:01:33,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443662928] [2025-01-09 00:01:33,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:33,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:34,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 00:01:34,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 00:01:34,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:34,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:34,247 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:01:34,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:34,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443662928] [2025-01-09 00:01:34,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443662928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:34,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:34,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611477897] [2025-01-09 00:01:34,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:34,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:34,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:34,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:34,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:34,272 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7748815165876777) internal successors, (749), 423 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:36,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:36,110 INFO L93 Difference]: Finished difference Result 1191 states and 2154 transitions. [2025-01-09 00:01:36,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:36,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2025-01-09 00:01:36,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:36,121 INFO L225 Difference]: With dead ends: 1191 [2025-01-09 00:01:36,121 INFO L226 Difference]: Without dead ends: 688 [2025-01-09 00:01:36,124 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:01:36,127 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 308 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:36,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 230 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 00:01:36,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-01-09 00:01:36,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2025-01-09 00:01:36,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.609720176730486) internal successors, (1093), 679 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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:01:36,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1093 transitions. [2025-01-09 00:01:36,189 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1093 transitions. Word has length 63 [2025-01-09 00:01:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:36,190 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 1093 transitions. [2025-01-09 00:01:36,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:01:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1093 transitions. [2025-01-09 00:01:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 00:01:36,196 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:36,196 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:36,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:01:36,198 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:36,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:36,198 INFO L85 PathProgramCache]: Analyzing trace with hash -598432580, now seen corresponding path program 1 times [2025-01-09 00:01:36,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:36,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924910763] [2025-01-09 00:01:36,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:36,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:36,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 00:01:36,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 00:01:36,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:36,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:36,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924910763] [2025-01-09 00:01:36,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924910763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941608554] [2025-01-09 00:01:36,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:36,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:36,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:36,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:36,503 INFO L87 Difference]: Start difference. First operand 680 states and 1093 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:01:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:38,230 INFO L93 Difference]: Finished difference Result 1962 states and 3170 transitions. [2025-01-09 00:01:38,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 131 [2025-01-09 00:01:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:38,235 INFO L225 Difference]: With dead ends: 1962 [2025-01-09 00:01:38,236 INFO L226 Difference]: Without dead ends: 1284 [2025-01-09 00:01:38,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:38,241 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 247 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 933 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 933 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:38,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 339 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 933 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 00:01:38,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1284 states. [2025-01-09 00:01:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1284 to 1281. [2025-01-09 00:01:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1281 states, 1280 states have (on average 1.39453125) internal successors, (1785), 1280 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states 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:01:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1281 states to 1281 states and 1785 transitions. [2025-01-09 00:01:38,273 INFO L78 Accepts]: Start accepts. Automaton has 1281 states and 1785 transitions. Word has length 131 [2025-01-09 00:01:38,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:38,273 INFO L471 AbstractCegarLoop]: Abstraction has 1281 states and 1785 transitions. [2025-01-09 00:01:38,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states 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:01:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1281 states and 1785 transitions. [2025-01-09 00:01:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 00:01:38,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:38,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:38,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:01:38,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2056726576, now seen corresponding path program 1 times [2025-01-09 00:01:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876368740] [2025-01-09 00:01:38,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:38,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 00:01:38,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 00:01:38,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:38,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:38,602 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:38,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:38,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876368740] [2025-01-09 00:01:38,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876368740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:38,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:38,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:38,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831349523] [2025-01-09 00:01:38,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:38,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:38,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:38,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:38,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:38,604 INFO L87 Difference]: Start difference. First operand 1281 states and 1785 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:01:39,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:39,697 INFO L93 Difference]: Finished difference Result 2859 states and 3903 transitions. [2025-01-09 00:01:39,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:39,698 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:01:39,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:39,705 INFO L225 Difference]: With dead ends: 2859 [2025-01-09 00:01:39,705 INFO L226 Difference]: Without dead ends: 1580 [2025-01-09 00:01:39,707 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:01:39,707 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:39,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 359 Invalid, 917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:01:39,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-09 00:01:39,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1580. [2025-01-09 00:01:39,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1579 states have (on average 1.323622545915136) internal successors, (2090), 1579 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states 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:01:39,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2090 transitions. [2025-01-09 00:01:39,739 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2090 transitions. Word has length 139 [2025-01-09 00:01:39,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:39,739 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2090 transitions. [2025-01-09 00:01:39,740 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:01:39,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2090 transitions. [2025-01-09 00:01:39,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-09 00:01:39,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:39,745 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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:01:39,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:01:39,745 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:39,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:39,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1414901482, now seen corresponding path program 1 times [2025-01-09 00:01:39,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:39,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614798080] [2025-01-09 00:01:39,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:39,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 00:01:39,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 00:01:39,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:39,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:39,961 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2025-01-09 00:01:39,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:39,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614798080] [2025-01-09 00:01:39,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614798080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:39,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:39,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:39,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038975862] [2025-01-09 00:01:39,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:39,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:39,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:39,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:39,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:39,963 INFO L87 Difference]: Start difference. First operand 1580 states and 2090 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:01:41,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:41,468 INFO L93 Difference]: Finished difference Result 4065 states and 5551 transitions. [2025-01-09 00:01:41,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:41,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-01-09 00:01:41,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:41,476 INFO L225 Difference]: With dead ends: 4065 [2025-01-09 00:01:41,477 INFO L226 Difference]: Without dead ends: 2786 [2025-01-09 00:01:41,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:41,479 INFO L435 NwaCegarLoop]: 293 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:41,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 360 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:01:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states. [2025-01-09 00:01:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 2781. [2025-01-09 00:01:41,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2780 states have (on average 1.249640287769784) internal successors, (3474), 2780 states have internal predecessors, (3474), 0 states have call successors, (0), 0 states 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:01:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3474 transitions. [2025-01-09 00:01:41,523 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3474 transitions. Word has length 222 [2025-01-09 00:01:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:41,523 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3474 transitions. [2025-01-09 00:01:41,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 2 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:01:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3474 transitions. [2025-01-09 00:01:41,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 00:01:41,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:41,526 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:01:41,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:01:41,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1247906346, now seen corresponding path program 1 times [2025-01-09 00:01:41,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:41,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366746245] [2025-01-09 00:01:41,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:41,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:41,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 00:01:41,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 00:01:41,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:41,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-09 00:01:41,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:41,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366746245] [2025-01-09 00:01:41,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366746245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:41,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:41,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:41,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690211394] [2025-01-09 00:01:41,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:41,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:41,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:41,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:41,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:41,739 INFO L87 Difference]: Start difference. First operand 2781 states and 3474 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:01:43,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 00:01:44,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:44,343 INFO L93 Difference]: Finished difference Result 7364 states and 9358 transitions. [2025-01-09 00:01:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:44,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 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 230 [2025-01-09 00:01:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:44,358 INFO L225 Difference]: With dead ends: 7364 [2025-01-09 00:01:44,358 INFO L226 Difference]: Without dead ends: 4884 [2025-01-09 00:01:44,362 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:01:44,363 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:44,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 636 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-09 00:01:44,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4884 states. [2025-01-09 00:01:44,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4884 to 4286. [2025-01-09 00:01:44,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4286 states, 4285 states have (on average 1.1885647607934655) internal successors, (5093), 4285 states have internal predecessors, (5093), 0 states have call successors, (0), 0 states 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:01:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4286 states to 4286 states and 5093 transitions. [2025-01-09 00:01:44,437 INFO L78 Accepts]: Start accepts. Automaton has 4286 states and 5093 transitions. Word has length 230 [2025-01-09 00:01:44,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:44,437 INFO L471 AbstractCegarLoop]: Abstraction has 4286 states and 5093 transitions. [2025-01-09 00:01:44,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states 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:01:44,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4286 states and 5093 transitions. [2025-01-09 00:01:44,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-09 00:01:44,440 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:44,440 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:01:44,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:01:44,441 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:44,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:44,441 INFO L85 PathProgramCache]: Analyzing trace with hash 387965558, now seen corresponding path program 1 times [2025-01-09 00:01:44,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:44,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776222097] [2025-01-09 00:01:44,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:44,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:44,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-09 00:01:44,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-09 00:01:44,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:44,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:44,674 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-09 00:01:44,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:44,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776222097] [2025-01-09 00:01:44,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776222097] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:44,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:44,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:01:44,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906266766] [2025-01-09 00:01:44,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:44,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:44,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:44,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:44,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:44,680 INFO L87 Difference]: Start difference. First operand 4286 states and 5093 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:01:46,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:46,252 INFO L93 Difference]: Finished difference Result 9771 states and 11905 transitions. [2025-01-09 00:01:46,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:46,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 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 236 [2025-01-09 00:01:46,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:46,266 INFO L225 Difference]: With dead ends: 9771 [2025-01-09 00:01:46,267 INFO L226 Difference]: Without dead ends: 5786 [2025-01-09 00:01:46,272 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:01:46,273 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:46,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 364 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:01:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5786 states. [2025-01-09 00:01:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5786 to 5485. [2025-01-09 00:01:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5485 states, 5484 states have (on average 1.1692195477753464) internal successors, (6412), 5484 states have internal predecessors, (6412), 0 states have call successors, (0), 0 states 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:01:46,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 6412 transitions. [2025-01-09 00:01:46,371 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 6412 transitions. Word has length 236 [2025-01-09 00:01:46,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:46,372 INFO L471 AbstractCegarLoop]: Abstraction has 5485 states and 6412 transitions. [2025-01-09 00:01:46,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 2 states have internal predecessors, (158), 0 states have call successors, (0), 0 states 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:01:46,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 6412 transitions. [2025-01-09 00:01:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 00:01:46,375 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:46,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:46,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:01:46,376 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:46,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:46,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1877368107, now seen corresponding path program 1 times [2025-01-09 00:01:46,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:46,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912580437] [2025-01-09 00:01:46,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:46,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:46,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 00:01:46,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 00:01:46,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:46,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:46,701 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:01:46,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:46,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912580437] [2025-01-09 00:01:46,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912580437] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:46,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:46,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:46,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233046431] [2025-01-09 00:01:46,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:46,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:46,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:46,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:46,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:46,703 INFO L87 Difference]: Start difference. First operand 5485 states and 6412 transitions. Second operand has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:01:48,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:48,252 INFO L93 Difference]: Finished difference Result 12470 states and 14901 transitions. [2025-01-09 00:01:48,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:48,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2025-01-09 00:01:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:48,274 INFO L225 Difference]: With dead ends: 12470 [2025-01-09 00:01:48,274 INFO L226 Difference]: Without dead ends: 7286 [2025-01-09 00:01:48,279 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:01:48,280 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 264 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:48,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 638 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:01:48,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7286 states. [2025-01-09 00:01:48,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7286 to 7284. [2025-01-09 00:01:48,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7284 states, 7283 states have (on average 1.148427845667994) internal successors, (8364), 7283 states have internal predecessors, (8364), 0 states have call successors, (0), 0 states 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:01:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7284 states to 7284 states and 8364 transitions. [2025-01-09 00:01:48,386 INFO L78 Accepts]: Start accepts. Automaton has 7284 states and 8364 transitions. Word has length 350 [2025-01-09 00:01:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:48,386 INFO L471 AbstractCegarLoop]: Abstraction has 7284 states and 8364 transitions. [2025-01-09 00:01:48,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 0 states have call successors, (0), 0 states 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:01:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7284 states and 8364 transitions. [2025-01-09 00:01:48,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2025-01-09 00:01:48,394 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:48,394 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:48,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:01:48,395 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:48,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:48,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1680798453, now seen corresponding path program 1 times [2025-01-09 00:01:48,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:48,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51945859] [2025-01-09 00:01:48,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:48,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:48,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 426 statements into 1 equivalence classes. [2025-01-09 00:01:48,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 426 of 426 statements. [2025-01-09 00:01:48,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:48,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 201 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:01:48,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:48,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51945859] [2025-01-09 00:01:48,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51945859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:48,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:48,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:48,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426119169] [2025-01-09 00:01:48,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:48,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:48,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:48,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:48,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:48,735 INFO L87 Difference]: Start difference. First operand 7284 states and 8364 transitions. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:01:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:49,973 INFO L93 Difference]: Finished difference Result 16069 states and 18808 transitions. [2025-01-09 00:01:49,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:49,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 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 426 [2025-01-09 00:01:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:50,003 INFO L225 Difference]: With dead ends: 16069 [2025-01-09 00:01:50,003 INFO L226 Difference]: Without dead ends: 9086 [2025-01-09 00:01:50,013 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:01:50,014 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:50,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 623 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:01:50,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9086 states. [2025-01-09 00:01:50,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9086 to 8481. [2025-01-09 00:01:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8481 states, 8480 states have (on average 1.1377358490566039) internal successors, (9648), 8480 states have internal predecessors, (9648), 0 states have call successors, (0), 0 states 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:01:50,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8481 states to 8481 states and 9648 transitions. [2025-01-09 00:01:50,196 INFO L78 Accepts]: Start accepts. Automaton has 8481 states and 9648 transitions. Word has length 426 [2025-01-09 00:01:50,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:50,196 INFO L471 AbstractCegarLoop]: Abstraction has 8481 states and 9648 transitions. [2025-01-09 00:01:50,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states 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:01:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 8481 states and 9648 transitions. [2025-01-09 00:01:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2025-01-09 00:01:50,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:50,218 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:01:50,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:01:50,222 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:50,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:50,223 INFO L85 PathProgramCache]: Analyzing trace with hash 259978861, now seen corresponding path program 1 times [2025-01-09 00:01:50,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:50,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473610760] [2025-01-09 00:01:50,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:50,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:50,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-01-09 00:01:50,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-01-09 00:01:50,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:50,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:50,864 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 426 proven. 39 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-09 00:01:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473610760] [2025-01-09 00:01:50,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473610760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:50,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40885468] [2025-01-09 00:01:50,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:50,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:50,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:50,868 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:01:50,869 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:01:50,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 514 statements into 1 equivalence classes. [2025-01-09 00:01:51,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 514 of 514 statements. [2025-01-09 00:01:51,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:51,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:51,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:51,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2025-01-09 00:01:51,419 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:51,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40885468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:51,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:51,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177347177] [2025-01-09 00:01:51,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:51,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:51,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:51,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:51,422 INFO L87 Difference]: Start difference. First operand 8481 states and 9648 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:01:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:52,866 INFO L93 Difference]: Finished difference Result 19651 states and 22539 transitions. [2025-01-09 00:01:52,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:52,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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 514 [2025-01-09 00:01:52,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:52,888 INFO L225 Difference]: With dead ends: 19651 [2025-01-09 00:01:52,888 INFO L226 Difference]: Without dead ends: 11471 [2025-01-09 00:01:52,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:52,894 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 148 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:52,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 315 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:01:52,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11471 states. [2025-01-09 00:01:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11471 to 7578. [2025-01-09 00:01:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7578 states, 7577 states have (on average 1.1483436716378514) internal successors, (8701), 7577 states have internal predecessors, (8701), 0 states have call successors, (0), 0 states 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:01:52,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7578 states to 7578 states and 8701 transitions. [2025-01-09 00:01:52,964 INFO L78 Accepts]: Start accepts. Automaton has 7578 states and 8701 transitions. Word has length 514 [2025-01-09 00:01:52,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:52,965 INFO L471 AbstractCegarLoop]: Abstraction has 7578 states and 8701 transitions. [2025-01-09 00:01:52,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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:01:52,965 INFO L276 IsEmpty]: Start isEmpty. Operand 7578 states and 8701 transitions. [2025-01-09 00:01:52,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 548 [2025-01-09 00:01:52,970 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:52,970 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:52,979 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:01:53,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:53,172 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:53,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:53,172 INFO L85 PathProgramCache]: Analyzing trace with hash -466321755, now seen corresponding path program 1 times [2025-01-09 00:01:53,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:53,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822607342] [2025-01-09 00:01:53,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:53,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:53,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-01-09 00:01:53,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-01-09 00:01:53,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:53,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:53,808 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 531 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2025-01-09 00:01:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822607342] [2025-01-09 00:01:53,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822607342] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26553865] [2025-01-09 00:01:53,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:53,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:53,814 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:01:53,815 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:01:53,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 547 statements into 1 equivalence classes. [2025-01-09 00:01:53,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 547 of 547 statements. [2025-01-09 00:01:53,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:53,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:53,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:53,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:54,041 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 00:01:54,041 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:54,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26553865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:54,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:54,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:54,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335702775] [2025-01-09 00:01:54,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:54,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:54,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:54,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:54,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:54,043 INFO L87 Difference]: Start difference. First operand 7578 states and 8701 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:01:55,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:55,380 INFO L93 Difference]: Finished difference Result 17246 states and 20051 transitions. [2025-01-09 00:01:55,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:55,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 547 [2025-01-09 00:01:55,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:55,407 INFO L225 Difference]: With dead ends: 17246 [2025-01-09 00:01:55,407 INFO L226 Difference]: Without dead ends: 9969 [2025-01-09 00:01:55,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 546 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:55,417 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 354 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:55,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 448 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:55,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9969 states. [2025-01-09 00:01:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9969 to 9969. [2025-01-09 00:01:55,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9969 states, 9968 states have (on average 1.1498796147672552) internal successors, (11462), 9968 states have internal predecessors, (11462), 0 states have call successors, (0), 0 states 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:01:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 11462 transitions. [2025-01-09 00:01:55,563 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 11462 transitions. Word has length 547 [2025-01-09 00:01:55,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:55,565 INFO L471 AbstractCegarLoop]: Abstraction has 9969 states and 11462 transitions. [2025-01-09 00:01:55,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states 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:01:55,565 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 11462 transitions. [2025-01-09 00:01:55,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2025-01-09 00:01:55,569 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:55,569 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:55,576 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:01:55,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:55,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:55,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 610645103, now seen corresponding path program 1 times [2025-01-09 00:01:55,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:55,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146678327] [2025-01-09 00:01:55,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:55,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 551 statements into 1 equivalence classes. [2025-01-09 00:01:55,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 551 of 551 statements. [2025-01-09 00:01:55,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:55,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:56,211 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-09 00:01:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146678327] [2025-01-09 00:01:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146678327] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:01:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:01:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89129656] [2025-01-09 00:01:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:56,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:56,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:56,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:01:56,214 INFO L87 Difference]: Start difference. First operand 9969 states and 11462 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states 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:01:57,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:57,607 INFO L93 Difference]: Finished difference Result 24136 states and 28000 transitions. [2025-01-09 00:01:57,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:57,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 551 [2025-01-09 00:01:57,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:57,634 INFO L225 Difference]: With dead ends: 24136 [2025-01-09 00:01:57,634 INFO L226 Difference]: Without dead ends: 14468 [2025-01-09 00:01:57,645 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:01:57,647 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 246 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:57,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 621 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 00:01:57,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14468 states. [2025-01-09 00:01:57,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14468 to 14158. [2025-01-09 00:01:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14158 states, 14157 states have (on average 1.1347743165924984) internal successors, (16065), 14157 states have internal predecessors, (16065), 0 states have call successors, (0), 0 states 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:01:57,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14158 states to 14158 states and 16065 transitions. [2025-01-09 00:01:57,831 INFO L78 Accepts]: Start accepts. Automaton has 14158 states and 16065 transitions. Word has length 551 [2025-01-09 00:01:57,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:01:57,832 INFO L471 AbstractCegarLoop]: Abstraction has 14158 states and 16065 transitions. [2025-01-09 00:01:57,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states 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:01:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 14158 states and 16065 transitions. [2025-01-09 00:01:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2025-01-09 00:01:57,878 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:01:57,878 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:57,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:01:57,879 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:01:57,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:01:57,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1684101720, now seen corresponding path program 1 times [2025-01-09 00:01:57,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:01:57,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882878241] [2025-01-09 00:01:57,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:57,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:01:57,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 00:01:57,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 00:01:57,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:57,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:58,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 688 proven. 39 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-01-09 00:01:58,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:01:58,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882878241] [2025-01-09 00:01:58,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882878241] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:01:58,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481315884] [2025-01-09 00:01:58,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:01:58,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:01:58,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:01:58,485 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:01:58,498 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:01:58,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes. [2025-01-09 00:01:58,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements. [2025-01-09 00:01:58,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:01:58,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:01:58,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:01:58,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:01:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 00:01:58,849 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:01:58,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481315884] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:01:58,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:01:58,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:01:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138493834] [2025-01-09 00:01:58,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:01:58,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:01:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:01:58,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:01:58,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:58,851 INFO L87 Difference]: Start difference. First operand 14158 states and 16065 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:01:59,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:01:59,969 INFO L93 Difference]: Finished difference Result 27712 states and 31488 transitions. [2025-01-09 00:01:59,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:01:59,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 626 [2025-01-09 00:01:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:01:59,987 INFO L225 Difference]: With dead ends: 27712 [2025-01-09 00:01:59,987 INFO L226 Difference]: Without dead ends: 13855 [2025-01-09 00:01:59,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 625 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:01:59,997 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 252 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:01:59,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 605 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:02:00,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13855 states. [2025-01-09 00:02:00,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13855 to 13555. [2025-01-09 00:02:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13555 states, 13554 states have (on average 1.0829275490630073) internal successors, (14678), 13554 states have internal predecessors, (14678), 0 states have call successors, (0), 0 states 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:02:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13555 states to 13555 states and 14678 transitions. [2025-01-09 00:02:00,099 INFO L78 Accepts]: Start accepts. Automaton has 13555 states and 14678 transitions. Word has length 626 [2025-01-09 00:02:00,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:00,099 INFO L471 AbstractCegarLoop]: Abstraction has 13555 states and 14678 transitions. [2025-01-09 00:02:00,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states 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:02:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 13555 states and 14678 transitions. [2025-01-09 00:02:00,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2025-01-09 00:02:00,106 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:00,106 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:00,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 00:02:00,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:00,307 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:00,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:00,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1954071644, now seen corresponding path program 1 times [2025-01-09 00:02:00,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:00,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036394066] [2025-01-09 00:02:00,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:00,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:00,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-01-09 00:02:00,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-01-09 00:02:00,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:00,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:01,020 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 615 proven. 39 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-01-09 00:02:01,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:01,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036394066] [2025-01-09 00:02:01,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036394066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:01,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989699363] [2025-01-09 00:02:01,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:01,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:01,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:01,023 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:02:01,024 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:02:01,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes. [2025-01-09 00:02:01,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements. [2025-01-09 00:02:01,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:01,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:01,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 766 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:02:01,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 615 proven. 39 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-01-09 00:02:01,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:02:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 615 proven. 39 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-01-09 00:02:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989699363] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:02:02,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:02:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-01-09 00:02:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790427841] [2025-01-09 00:02:02,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:02:02,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 00:02:02,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:02,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 00:02:02,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:02:02,452 INFO L87 Difference]: Start difference. First operand 13555 states and 14678 transitions. Second operand has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:02:07,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:07,061 INFO L93 Difference]: Finished difference Result 35143 states and 38047 transitions. [2025-01-09 00:02:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 00:02:07,062 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 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 627 [2025-01-09 00:02:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:07,076 INFO L225 Difference]: With dead ends: 35143 [2025-01-09 00:02:07,076 INFO L226 Difference]: Without dead ends: 15948 [2025-01-09 00:02:07,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1263 GetRequests, 1249 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=151, Unknown=0, NotChecked=0, Total=240 [2025-01-09 00:02:07,085 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 2851 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 5436 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2851 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 5436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:07,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2851 Valid, 215 Invalid, 6124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 5436 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 00:02:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15948 states. [2025-01-09 00:02:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15948 to 12357. [2025-01-09 00:02:07,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12357 states, 12356 states have (on average 1.0382000647458725) internal successors, (12828), 12356 states have internal predecessors, (12828), 0 states have call successors, (0), 0 states 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:02:07,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12357 states to 12357 states and 12828 transitions. [2025-01-09 00:02:07,236 INFO L78 Accepts]: Start accepts. Automaton has 12357 states and 12828 transitions. Word has length 627 [2025-01-09 00:02:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:07,236 INFO L471 AbstractCegarLoop]: Abstraction has 12357 states and 12828 transitions. [2025-01-09 00:02:07,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 86.33333333333333) internal successors, (777), 8 states have internal predecessors, (777), 0 states have call successors, (0), 0 states 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:02:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 12357 states and 12828 transitions. [2025-01-09 00:02:07,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 00:02:07,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:07,243 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:07,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:02:07,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 00:02:07,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:07,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1977583532, now seen corresponding path program 1 times [2025-01-09 00:02:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:07,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37173733] [2025-01-09 00:02:07,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:07,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:07,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 00:02:07,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 00:02:07,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:07,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:08,332 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 266 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:08,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37173733] [2025-01-09 00:02:08,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37173733] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:08,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284904936] [2025-01-09 00:02:08,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:08,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:08,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:08,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:02:08,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:02:08,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 00:02:08,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 00:02:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:08,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:02:08,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:08,964 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 450 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:08,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:02:10,442 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 450 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:02:10,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284904936] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:02:10,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:02:10,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-09 00:02:10,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023327269] [2025-01-09 00:02:10,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:02:10,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 00:02:10,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:10,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 00:02:10,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 00:02:10,447 INFO L87 Difference]: Start difference. First operand 12357 states and 12828 transitions. Second operand has 12 states, 12 states have (on average 143.33333333333334) internal successors, (1720), 12 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states 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:02:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:18,682 INFO L93 Difference]: Finished difference Result 38337 states and 39862 transitions. [2025-01-09 00:02:18,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-01-09 00:02:18,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 143.33333333333334) internal successors, (1720), 12 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 664 [2025-01-09 00:02:18,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:18,701 INFO L225 Difference]: With dead ends: 38337 [2025-01-09 00:02:18,702 INFO L226 Difference]: Without dead ends: 25681 [2025-01-09 00:02:18,707 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1397 GetRequests, 1343 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=591, Invalid=2489, Unknown=0, NotChecked=0, Total=3080 [2025-01-09 00:02:18,708 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 6190 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 13120 mSolverCounterSat, 1403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6190 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 14523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1403 IncrementalHoareTripleChecker+Valid, 13120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:18,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6190 Valid, 392 Invalid, 14523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1403 Valid, 13120 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2025-01-09 00:02:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25681 states. [2025-01-09 00:02:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25681 to 18951. [2025-01-09 00:02:18,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18951 states, 18950 states have (on average 1.0378364116094987) internal successors, (19667), 18950 states have internal predecessors, (19667), 0 states have call successors, (0), 0 states 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:02:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18951 states to 18951 states and 19667 transitions. [2025-01-09 00:02:18,982 INFO L78 Accepts]: Start accepts. Automaton has 18951 states and 19667 transitions. Word has length 664 [2025-01-09 00:02:18,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:18,983 INFO L471 AbstractCegarLoop]: Abstraction has 18951 states and 19667 transitions. [2025-01-09 00:02:18,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 143.33333333333334) internal successors, (1720), 12 states have internal predecessors, (1720), 0 states have call successors, (0), 0 states 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:02:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 18951 states and 19667 transitions. [2025-01-09 00:02:18,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2025-01-09 00:02:18,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:18,996 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:19,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:02:19,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 00:02:19,197 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:19,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:19,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1086117693, now seen corresponding path program 1 times [2025-01-09 00:02:19,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:19,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773065466] [2025-01-09 00:02:19,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:19,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:19,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 731 statements into 1 equivalence classes. [2025-01-09 00:02:19,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 731 of 731 statements. [2025-01-09 00:02:19,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:19,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2025-01-09 00:02:19,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:19,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773065466] [2025-01-09 00:02:19,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773065466] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:19,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976694542] [2025-01-09 00:02:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:19,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:19,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:19,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:19,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:19,513 INFO L87 Difference]: Start difference. First operand 18951 states and 19667 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:20,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:20,237 INFO L93 Difference]: Finished difference Result 37599 states and 39041 transitions. [2025-01-09 00:02:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:20,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 731 [2025-01-09 00:02:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:20,253 INFO L225 Difference]: With dead ends: 37599 [2025-01-09 00:02:20,253 INFO L226 Difference]: Without dead ends: 19248 [2025-01-09 00:02:20,260 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:02:20,260 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 437 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:20,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 69 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19248 states. [2025-01-09 00:02:20,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19248 to 18949. [2025-01-09 00:02:20,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18949 states, 18948 states have (on average 1.0377348532826685) internal successors, (19663), 18948 states have internal predecessors, (19663), 0 states have call successors, (0), 0 states 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:02:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18949 states to 18949 states and 19663 transitions. [2025-01-09 00:02:20,405 INFO L78 Accepts]: Start accepts. Automaton has 18949 states and 19663 transitions. Word has length 731 [2025-01-09 00:02:20,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:20,406 INFO L471 AbstractCegarLoop]: Abstraction has 18949 states and 19663 transitions. [2025-01-09 00:02:20,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 18949 states and 19663 transitions. [2025-01-09 00:02:20,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2025-01-09 00:02:20,414 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:20,415 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:20,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:02:20,415 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:20,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:20,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1759932299, now seen corresponding path program 1 times [2025-01-09 00:02:20,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:20,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392022820] [2025-01-09 00:02:20,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:20,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:20,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 784 statements into 1 equivalence classes. [2025-01-09 00:02:20,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 784 of 784 statements. [2025-01-09 00:02:20,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:20,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:20,880 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2025-01-09 00:02:20,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:20,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392022820] [2025-01-09 00:02:20,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392022820] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:20,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:20,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:20,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065213553] [2025-01-09 00:02:20,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:20,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:20,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:20,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:20,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:20,882 INFO L87 Difference]: Start difference. First operand 18949 states and 19663 transitions. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:02:21,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:21,592 INFO L93 Difference]: Finished difference Result 39978 states and 41496 transitions. [2025-01-09 00:02:21,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:21,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 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 784 [2025-01-09 00:02:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:21,616 INFO L225 Difference]: With dead ends: 39978 [2025-01-09 00:02:21,616 INFO L226 Difference]: Without dead ends: 21629 [2025-01-09 00:02:21,628 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:02:21,629 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 68 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:21,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 528 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:21,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21629 states. [2025-01-09 00:02:21,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21629 to 18334. [2025-01-09 00:02:21,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18334 states, 18333 states have (on average 1.0314187530682377) internal successors, (18909), 18333 states have internal predecessors, (18909), 0 states have call successors, (0), 0 states 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:02:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18334 states to 18334 states and 18909 transitions. [2025-01-09 00:02:21,781 INFO L78 Accepts]: Start accepts. Automaton has 18334 states and 18909 transitions. Word has length 784 [2025-01-09 00:02:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:21,781 INFO L471 AbstractCegarLoop]: Abstraction has 18334 states and 18909 transitions. [2025-01-09 00:02:21,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:02:21,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18334 states and 18909 transitions. [2025-01-09 00:02:21,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2025-01-09 00:02:21,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:21,792 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:21,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:02:21,792 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:21,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:21,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1456693869, now seen corresponding path program 1 times [2025-01-09 00:02:21,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:21,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997855031] [2025-01-09 00:02:21,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:21,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:21,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 813 statements into 1 equivalence classes. [2025-01-09 00:02:21,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 813 of 813 statements. [2025-01-09 00:02:21,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:21,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1075 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-09 00:02:22,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:22,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997855031] [2025-01-09 00:02:22,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997855031] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:22,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:22,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:22,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055189622] [2025-01-09 00:02:22,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:22,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:22,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:22,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:22,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:22,070 INFO L87 Difference]: Start difference. First operand 18334 states and 18909 transitions. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:22,867 INFO L93 Difference]: Finished difference Result 38449 states and 39712 transitions. [2025-01-09 00:02:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:22,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 813 [2025-01-09 00:02:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:22,885 INFO L225 Difference]: With dead ends: 38449 [2025-01-09 00:02:22,885 INFO L226 Difference]: Without dead ends: 20715 [2025-01-09 00:02:22,894 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:02:22,894 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 340 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:22,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 464 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:02:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20715 states. [2025-01-09 00:02:23,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20715 to 19818. [2025-01-09 00:02:23,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19818 states, 19817 states have (on average 1.029015491749508) internal successors, (20392), 19817 states have internal predecessors, (20392), 0 states have call successors, (0), 0 states 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:02:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19818 states to 19818 states and 20392 transitions. [2025-01-09 00:02:23,045 INFO L78 Accepts]: Start accepts. Automaton has 19818 states and 20392 transitions. Word has length 813 [2025-01-09 00:02:23,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:23,045 INFO L471 AbstractCegarLoop]: Abstraction has 19818 states and 20392 transitions. [2025-01-09 00:02:23,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:02:23,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19818 states and 20392 transitions. [2025-01-09 00:02:23,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2025-01-09 00:02:23,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:23,056 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:02:23,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:02:23,056 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:23,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:23,057 INFO L85 PathProgramCache]: Analyzing trace with hash 936993913, now seen corresponding path program 1 times [2025-01-09 00:02:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:23,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164500689] [2025-01-09 00:02:23,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:23,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:23,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-01-09 00:02:23,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-01-09 00:02:23,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:23,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:24,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 946 proven. 263 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-01-09 00:02:24,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164500689] [2025-01-09 00:02:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164500689] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:02:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284606464] [2025-01-09 00:02:24,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:02:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:02:24,527 INFO L229 MonitoredProcess]: Starting monitored process 7 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:02:24,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:02:24,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-01-09 00:02:24,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-01-09 00:02:24,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:24,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:24,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:02:24,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:02:24,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1445 backedges. 803 proven. 0 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2025-01-09 00:02:24,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:02:24,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284606464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:24,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:02:24,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-01-09 00:02:24,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530410028] [2025-01-09 00:02:24,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:24,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:24,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:25,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:25,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:02:25,000 INFO L87 Difference]: Start difference. First operand 19818 states and 20392 transitions. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:02:26,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:26,045 INFO L93 Difference]: Finished difference Result 46820 states and 48184 transitions. [2025-01-09 00:02:26,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:02:26,046 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 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 881 [2025-01-09 00:02:26,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:26,071 INFO L225 Difference]: With dead ends: 46820 [2025-01-09 00:02:26,071 INFO L226 Difference]: Without dead ends: 27303 [2025-01-09 00:02:26,081 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 886 GetRequests, 880 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:02:26,082 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 455 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1514 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 1642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:26,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 176 Invalid, 1642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1514 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:02:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27303 states. [2025-01-09 00:02:26,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27303 to 25505. [2025-01-09 00:02:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25505 states, 25504 states have (on average 1.0254861982434127) internal successors, (26154), 25504 states have internal predecessors, (26154), 0 states have call successors, (0), 0 states 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:02:26,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25505 states to 25505 states and 26154 transitions. [2025-01-09 00:02:26,339 INFO L78 Accepts]: Start accepts. Automaton has 25505 states and 26154 transitions. Word has length 881 [2025-01-09 00:02:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:26,339 INFO L471 AbstractCegarLoop]: Abstraction has 25505 states and 26154 transitions. [2025-01-09 00:02:26,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states 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:02:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 25505 states and 26154 transitions. [2025-01-09 00:02:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 882 [2025-01-09 00:02:26,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:26,351 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:02:26,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 00:02:26,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:02:26,552 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:26,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:26,552 INFO L85 PathProgramCache]: Analyzing trace with hash -672145193, now seen corresponding path program 1 times [2025-01-09 00:02:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201982600] [2025-01-09 00:02:26,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:26,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:26,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 881 statements into 1 equivalence classes. [2025-01-09 00:02:26,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 881 of 881 statements. [2025-01-09 00:02:26,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:26,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:27,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 658 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2025-01-09 00:02:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:27,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201982600] [2025-01-09 00:02:27,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201982600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:27,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:27,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:02:27,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739093149] [2025-01-09 00:02:27,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:27,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:02:27,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:27,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:02:27,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:02:27,404 INFO L87 Difference]: Start difference. First operand 25505 states and 26154 transitions. Second operand has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:02:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:28,541 INFO L93 Difference]: Finished difference Result 32104 states and 32865 transitions. [2025-01-09 00:02:28,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:02:28,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 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 881 [2025-01-09 00:02:28,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:28,570 INFO L225 Difference]: With dead ends: 32104 [2025-01-09 00:02:28,571 INFO L226 Difference]: Without dead ends: 32102 [2025-01-09 00:02:28,580 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:02:28,580 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 476 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1529 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:28,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 132 Invalid, 1693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1529 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:02:28,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32102 states. [2025-01-09 00:02:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32102 to 26406. [2025-01-09 00:02:28,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26406 states, 26405 states have (on average 1.0255254686612385) internal successors, (27079), 26405 states have internal predecessors, (27079), 0 states have call successors, (0), 0 states 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:02:28,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26406 states to 26406 states and 27079 transitions. [2025-01-09 00:02:28,852 INFO L78 Accepts]: Start accepts. Automaton has 26406 states and 27079 transitions. Word has length 881 [2025-01-09 00:02:28,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:28,853 INFO L471 AbstractCegarLoop]: Abstraction has 26406 states and 27079 transitions. [2025-01-09 00:02:28,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states 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:02:28,853 INFO L276 IsEmpty]: Start isEmpty. Operand 26406 states and 27079 transitions. [2025-01-09 00:02:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2025-01-09 00:02:28,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:28,867 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:28,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:02:28,867 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:28,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:28,868 INFO L85 PathProgramCache]: Analyzing trace with hash -444775676, now seen corresponding path program 1 times [2025-01-09 00:02:28,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:28,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991954886] [2025-01-09 00:02:28,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:28,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 981 statements into 1 equivalence classes. [2025-01-09 00:02:28,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 981 of 981 statements. [2025-01-09 00:02:28,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:28,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1583 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 646 trivial. 0 not checked. [2025-01-09 00:02:29,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:29,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991954886] [2025-01-09 00:02:29,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991954886] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:29,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:29,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071105203] [2025-01-09 00:02:29,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:29,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:29,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:29,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:29,224 INFO L87 Difference]: Start difference. First operand 26406 states and 27079 transitions. Second operand has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states 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:02:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:29,924 INFO L93 Difference]: Finished difference Result 53408 states and 54768 transitions. [2025-01-09 00:02:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:29,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 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 981 [2025-01-09 00:02:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:29,950 INFO L225 Difference]: With dead ends: 53408 [2025-01-09 00:02:29,951 INFO L226 Difference]: Without dead ends: 27303 [2025-01-09 00:02:29,967 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:02:29,967 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 98 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:29,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 129 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:29,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27303 states. [2025-01-09 00:02:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27303 to 20418. [2025-01-09 00:02:30,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20418 states, 20417 states have (on average 1.0250281628055051) internal successors, (20928), 20417 states have internal predecessors, (20928), 0 states have call successors, (0), 0 states 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:02:30,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20418 states to 20418 states and 20928 transitions. [2025-01-09 00:02:30,216 INFO L78 Accepts]: Start accepts. Automaton has 20418 states and 20928 transitions. Word has length 981 [2025-01-09 00:02:30,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:30,216 INFO L471 AbstractCegarLoop]: Abstraction has 20418 states and 20928 transitions. [2025-01-09 00:02:30,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 202.0) internal successors, (606), 3 states have internal predecessors, (606), 0 states have call successors, (0), 0 states 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:02:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 20418 states and 20928 transitions. [2025-01-09 00:02:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1025 [2025-01-09 00:02:30,227 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:30,227 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:30,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:02:30,227 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:30,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:30,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1539082407, now seen corresponding path program 1 times [2025-01-09 00:02:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:30,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672192600] [2025-01-09 00:02:30,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:30,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:30,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1024 statements into 1 equivalence classes. [2025-01-09 00:02:30,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1024 of 1024 statements. [2025-01-09 00:02:30,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:30,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1714 backedges. 787 proven. 0 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2025-01-09 00:02:30,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672192600] [2025-01-09 00:02:30,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672192600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:30,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:30,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:30,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64319823] [2025-01-09 00:02:30,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:30,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:30,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:30,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:30,757 INFO L87 Difference]: Start difference. First operand 20418 states and 20928 transitions. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:02:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:31,491 INFO L93 Difference]: Finished difference Result 40833 states and 41858 transitions. [2025-01-09 00:02:31,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:31,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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 1024 [2025-01-09 00:02:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:31,513 INFO L225 Difference]: With dead ends: 40833 [2025-01-09 00:02:31,513 INFO L226 Difference]: Without dead ends: 21015 [2025-01-09 00:02:31,522 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:02:31,523 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 311 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:31,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 507 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:31,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21015 states. [2025-01-09 00:02:31,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21015 to 20118. [2025-01-09 00:02:31,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20118 states, 20117 states have (on average 1.0248546005865686) internal successors, (20617), 20117 states have internal predecessors, (20617), 0 states have call successors, (0), 0 states 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:02:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20118 states to 20118 states and 20617 transitions. [2025-01-09 00:02:31,686 INFO L78 Accepts]: Start accepts. Automaton has 20118 states and 20617 transitions. Word has length 1024 [2025-01-09 00:02:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:31,687 INFO L471 AbstractCegarLoop]: Abstraction has 20118 states and 20617 transitions. [2025-01-09 00:02:31,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states 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:02:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 20118 states and 20617 transitions. [2025-01-09 00:02:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1133 [2025-01-09 00:02:31,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:31,699 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:02:31,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 00:02:31,700 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:31,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:31,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1995297210, now seen corresponding path program 1 times [2025-01-09 00:02:31,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:31,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132323894] [2025-01-09 00:02:31,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:31,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:31,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1132 statements into 1 equivalence classes. [2025-01-09 00:02:31,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1132 of 1132 statements. [2025-01-09 00:02:31,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:31,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:32,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1917 backedges. 1224 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-01-09 00:02:32,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:32,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132323894] [2025-01-09 00:02:32,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132323894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:32,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:32,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:02:32,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543868910] [2025-01-09 00:02:32,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:32,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:02:32,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:32,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:02:32,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:02:32,304 INFO L87 Difference]: Start difference. First operand 20118 states and 20617 transitions. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:02:32,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:32,932 INFO L93 Difference]: Finished difference Result 31821 states and 32519 transitions. [2025-01-09 00:02:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:02:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 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 1132 [2025-01-09 00:02:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:32,948 INFO L225 Difference]: With dead ends: 31821 [2025-01-09 00:02:32,949 INFO L226 Difference]: Without dead ends: 12303 [2025-01-09 00:02:32,958 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:02:32,959 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 322 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:32,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 71 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:02:32,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12303 states. [2025-01-09 00:02:33,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12303 to 11099. [2025-01-09 00:02:33,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11099 states, 11098 states have (on average 1.0154982879798162) internal successors, (11270), 11098 states have internal predecessors, (11270), 0 states have call successors, (0), 0 states 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:02:33,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11099 states to 11099 states and 11270 transitions. [2025-01-09 00:02:33,039 INFO L78 Accepts]: Start accepts. Automaton has 11099 states and 11270 transitions. Word has length 1132 [2025-01-09 00:02:33,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:33,039 INFO L471 AbstractCegarLoop]: Abstraction has 11099 states and 11270 transitions. [2025-01-09 00:02:33,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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:02:33,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11099 states and 11270 transitions. [2025-01-09 00:02:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1220 [2025-01-09 00:02:33,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:02:33,051 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:02:33,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 00:02:33,051 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:02:33,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:02:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash -70383374, now seen corresponding path program 1 times [2025-01-09 00:02:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:02:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162533846] [2025-01-09 00:02:33,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:02:33,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:02:33,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1219 statements into 1 equivalence classes. [2025-01-09 00:02:33,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1219 of 1219 statements. [2025-01-09 00:02:33,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:02:33,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:02:34,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2397 backedges. 1166 proven. 0 refuted. 0 times theorem prover too weak. 1231 trivial. 0 not checked. [2025-01-09 00:02:34,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:02:34,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162533846] [2025-01-09 00:02:34,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162533846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:02:34,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:02:34,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 00:02:34,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229439599] [2025-01-09 00:02:34,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:02:34,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 00:02:34,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:02:34,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 00:02:34,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:02:34,058 INFO L87 Difference]: Start difference. First operand 11099 states and 11270 transitions. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:02:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:02:35,201 INFO L93 Difference]: Finished difference Result 25800 states and 26195 transitions. [2025-01-09 00:02:35,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 00:02:35,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 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 1219 [2025-01-09 00:02:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:02:35,203 INFO L225 Difference]: With dead ends: 25800 [2025-01-09 00:02:35,203 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 00:02:35,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:02:35,209 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 766 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 1872 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 183 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:02:35,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 61 Invalid, 1872 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [183 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:02:35,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 00:02:35,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 00:02:35,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states 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:02:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 00:02:35,210 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1219 [2025-01-09 00:02:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:02:35,211 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 00:02:35,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states 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:02:35,211 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 00:02:35,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 00:02:35,214 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 00:02:35,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 00:02:35,216 INFO L422 BasicCegarLoop]: Path program histogram: [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:02:35,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 00:02:39,656 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 00:02:39,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:02:39 BoogieIcfgContainer [2025-01-09 00:02:39,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 00:02:39,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 00:02:39,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 00:02:39,691 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 00:02:39,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:01:33" (3/4) ... [2025-01-09 00:02:39,694 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 00:02:39,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-01-09 00:02:39,728 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 00:02:39,729 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 00:02:39,735 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 00:02:39,871 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 00:02:39,872 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 00:02:39,872 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 00:02:39,873 INFO L158 Benchmark]: Toolchain (without parser) took 69698.86ms. Allocated memory was 142.6MB in the beginning and 310.4MB in the end (delta: 167.8MB). Free memory was 107.0MB in the beginning and 118.7MB in the end (delta: -11.7MB). Peak memory consumption was 152.6MB. Max. memory is 16.1GB. [2025-01-09 00:02:39,873 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 00:02:39,874 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.58ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 95.3MB in the end (delta: 11.7MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2025-01-09 00:02:39,874 INFO L158 Benchmark]: Boogie Procedure Inliner took 160.30ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 58.1MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 00:02:39,875 INFO L158 Benchmark]: Boogie Preprocessor took 345.24ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 81.3MB in the end (delta: -23.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2025-01-09 00:02:39,875 INFO L158 Benchmark]: RCFGBuilder took 2466.48ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 81.3MB in the beginning and 83.3MB in the end (delta: -2.0MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. [2025-01-09 00:02:39,875 INFO L158 Benchmark]: TraceAbstraction took 65832.74ms. Allocated memory was 251.7MB in the beginning and 310.4MB in the end (delta: 58.7MB). Free memory was 83.3MB in the beginning and 144.4MB in the end (delta: -61.1MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. [2025-01-09 00:02:39,875 INFO L158 Benchmark]: Witness Printer took 180.89ms. Allocated memory is still 310.4MB. Free memory was 144.4MB in the beginning and 118.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 00:02:39,876 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 201.3MB. Free memory is still 123.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 706.58ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 95.3MB in the end (delta: 11.7MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 160.30ms. Allocated memory is still 142.6MB. Free memory was 95.3MB in the beginning and 58.1MB in the end (delta: 37.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 345.24ms. Allocated memory is still 142.6MB. Free memory was 58.1MB in the beginning and 81.3MB in the end (delta: -23.2MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * RCFGBuilder took 2466.48ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 81.3MB in the beginning and 83.3MB in the end (delta: -2.0MB). Peak memory consumption was 151.8MB. Max. memory is 16.1GB. * TraceAbstraction took 65832.74ms. Allocated memory was 251.7MB in the beginning and 310.4MB in the end (delta: 58.7MB). Free memory was 83.3MB in the beginning and 144.4MB in the end (delta: -61.1MB). Peak memory consumption was 277.0MB. Max. memory is 16.1GB. * Witness Printer took 180.89ms. Allocated memory is still 310.4MB. Free memory was 144.4MB in the beginning and 118.7MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 206]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.3s, OverallIterations: 23, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15346 SdHoareTripleChecker+Valid, 36.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15346 mSDsluCounter, 8282 SdHoareTripleChecker+Invalid, 30.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1189 mSDsCounter, 5523 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38733 IncrementalHoareTripleChecker+Invalid, 44256 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5523 mSolverCounterUnsat, 7093 mSDtfsCounter, 38733 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5291 GetRequests, 5185 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26406occurred in iteration=19, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 37317 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 17631 NumberOfCodeBlocks, 17631 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 18891 ConstructedInterpolants, 0 QuantifiedInterpolants, 58414 SizeOfPredicates, 6 NumberOfNonLiveVariables, 4669 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 31 InterpolantComputations, 21 PerfectInterpolantSequences, 24622/25807 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) a0 + 61) <= 0)) || ((((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (5 <= a2)) && (0 <= ((long long) a29 + 143)))) || (((((((long long) 42 + a4) <= 0) && (195722 <= a29)) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || (((2 == a2) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (((long long) a0 + 61) <= 0))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (3 == a2))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) 144 + a0))) && (((long long) 98 + a0) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2))) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 126661 + a29))) && (3 == a2)) && (a29 <= 43))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) a0 + 60))) && (5 <= a2)) && (0 <= ((long long) a29 + 143)))) || (((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 144 + a0))) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (0 <= ((long long) 126661 + a29))) && (a29 <= 43))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) a29 + 143)))) || ((((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2)) && (a29 <= 43))) || ((((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || ((((((120000 <= a0) && (((long long) 89 + a4) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 4)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (((long long) a29 + 127) <= 0))) || (((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (a2 == 1)) && (0 <= ((long long) a29 + 143)))) || (((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && (a2 == 4)) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (((long long) a29 + 127) <= 0))) || (((44 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2))) || (((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (a2 == 4))) || (((((long long) 89 + a4) <= 0) && (a2 == 4)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((((long long) 89 + a4) <= 0) && (a2 == 4)) && (0 <= ((long long) a29 + 143))) && (a29 <= 43))) || ((((((195722 <= a29) && (a2 == 4)) || ((0 <= ((long long) a4 + 85)) && (a2 == 4))) && (((long long) 42 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (143458 <= a29))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) a29 + 192415)))) || ((((((long long) 89 + a4) <= 0) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1)))))) && (3 == a2))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (96176 <= a29)) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (a2 == 1)) && (0 <= ((long long) 44 + a0))) && (((long long) a29 + 127) == 0))) || (((((long long) 89 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && (0 <= ((long long) a29 + 143))) && (a29 <= 43))) || ((((((long long) 89 + a4) <= 0) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || ((((((long long) 89 + a4) <= 0) && (5 <= a2)) && (((long long) a29 + 127) <= 0)) && (((long long) a0 + 61) <= 0))) || (((((((a2 == 1) && (((long long) a0 + 61) <= 0)) || ((0 <= ((long long) a4 + 85)) && (a2 == 1))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 144 + a0))) && (0 <= ((long long) a29 + 143))) && (a29 <= 43))) || ((((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))) && ((((a29 >= 0) ? (a29 % 5) : ((a29 % 5) + 5)) != 0) || (0 < (168748 + ((a29 >= 0) ? (a29 / 5) : ((a29 / 5) - 1))))))) || (((((0 <= ((long long) 600000 + a0)) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (((long long) a0 + 147) <= 0)) && (5 <= a2))) RESULT: Ultimate proved your program to be correct! [2025-01-09 00:02:39,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE