./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label05.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/Problem11_label05.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 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:40:30,496 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:40:30,541 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:40:30,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:40:30,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:40:30,562 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:40:30,563 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:40:30,563 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:40:30,563 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:40:30,563 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:40:30,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:40:30,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:40:30,564 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:40:30,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:40:30,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:30,565 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:40:30,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:30,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:40:30,566 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:40:30,566 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 -> 6998e746c84ec80cbdf636f88f142c2942fd045c8cffd9bc8881e887e07cd119 [2025-01-08 23:40:30,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:40:30,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:40:30,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:40:30,808 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:40:30,809 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:40:30,810 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2025-01-08 23:40:31,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09c3fa194/92a82a315734492b8970e5a3f137f5b4/FLAG6b687c22f [2025-01-08 23:40:32,313 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:40:32,316 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label05.c [2025-01-08 23:40:32,330 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09c3fa194/92a82a315734492b8970e5a3f137f5b4/FLAG6b687c22f [2025-01-08 23:40:32,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09c3fa194/92a82a315734492b8970e5a3f137f5b4 [2025-01-08 23:40:32,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:40:32,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:40:32,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:32,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:40:32,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:40:32,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:32,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5193f5e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32, skipping insertion in model container [2025-01-08 23:40:32,549 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:32,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:40:32,747 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/Problem11_label05.c[9225,9238] [2025-01-08 23:40:32,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:32,881 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:40:32,909 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/Problem11_label05.c[9225,9238] [2025-01-08 23:40:32,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:40:32,990 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:40:32,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32 WrapperNode [2025-01-08 23:40:32,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:40:32,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:32,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:40:32,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:40:32,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,073 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:40:33,074 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:40:33,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:40:33,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:40:33,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:40:33,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,169 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:40:33,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,208 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,245 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:40:33,259 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:40:33,260 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:40:33,260 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:40:33,261 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (1/1) ... [2025-01-08 23:40:33,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:40:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:33,286 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:40:33,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:40:33,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:40:33,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:40:33,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:40:33,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:40:33,351 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:40:33,352 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:40:34,578 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:40:34,578 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:40:34,591 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:40:34,591 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:40:34,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:34 BoogieIcfgContainer [2025-01-08 23:40:34,591 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:40:34,593 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:40:34,593 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:40:34,596 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:40:34,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:40:32" (1/3) ... [2025-01-08 23:40:34,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eafd5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:34, skipping insertion in model container [2025-01-08 23:40:34,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:40:32" (2/3) ... [2025-01-08 23:40:34,597 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eafd5c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:40:34, skipping insertion in model container [2025-01-08 23:40:34,597 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:34" (3/3) ... [2025-01-08 23:40:34,598 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label05.c [2025-01-08 23:40:34,607 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:40:34,609 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label05.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:40:34,657 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:40:34,667 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;@a75b580, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:40:34,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:40:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:34,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-08 23:40:34,678 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:34,679 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, 1] [2025-01-08 23:40:34,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:34,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:34,683 INFO L85 PathProgramCache]: Analyzing trace with hash -788531278, now seen corresponding path program 1 times [2025-01-08 23:40:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:34,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639061658] [2025-01-08 23:40:34,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:34,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:34,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-08 23:40:34,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-08 23:40:34,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:34,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:35,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:35,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:35,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639061658] [2025-01-08 23:40:35,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639061658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:35,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:35,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:35,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935054313] [2025-01-08 23:40:35,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:35,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:35,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:35,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:35,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:35,087 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:35,927 INFO L93 Difference]: Finished difference Result 776 states and 1360 transitions. [2025-01-08 23:40:35,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2025-01-08 23:40:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:35,937 INFO L225 Difference]: With dead ends: 776 [2025-01-08 23:40:35,938 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:40:35,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:35,942 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 163 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:35,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 197 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:40:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:40:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2025-01-08 23:40:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2025-01-08 23:40:35,985 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 64 [2025-01-08 23:40:35,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:35,985 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2025-01-08 23:40:35,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 2 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2025-01-08 23:40:35,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-08 23:40:35,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:35,988 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:35,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:40:35,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:35,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:35,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1837197738, now seen corresponding path program 1 times [2025-01-08 23:40:35,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:35,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798602566] [2025-01-08 23:40:35,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:35,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:36,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-08 23:40:36,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-08 23:40:36,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:36,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:36,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798602566] [2025-01-08 23:40:36,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798602566] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:36,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:36,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424985195] [2025-01-08 23:40:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:36,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:36,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:36,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:36,204 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:36,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:36,773 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2025-01-08 23:40:36,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:36,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 132 [2025-01-08 23:40:36,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:36,776 INFO L225 Difference]: With dead ends: 1209 [2025-01-08 23:40:36,776 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:40:36,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:36,777 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:36,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:36,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:40:36,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2025-01-08 23:40:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3854961832061068) internal successors, (1089), 786 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:36,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1089 transitions. [2025-01-08 23:40:36,804 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1089 transitions. Word has length 132 [2025-01-08 23:40:36,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:36,804 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1089 transitions. [2025-01-08 23:40:36,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:36,804 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1089 transitions. [2025-01-08 23:40:36,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-08 23:40:36,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:36,807 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:36,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:40:36,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:36,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:36,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1962311015, now seen corresponding path program 1 times [2025-01-08 23:40:36,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:36,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748887405] [2025-01-08 23:40:36,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:36,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-08 23:40:36,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-08 23:40:36,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:36,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:37,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:37,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748887405] [2025-01-08 23:40:37,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748887405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:37,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:37,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:37,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383720054] [2025-01-08 23:40:37,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:37,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:37,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:37,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:37,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:37,068 INFO L87 Difference]: Start difference. First operand 787 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:37,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:37,658 INFO L93 Difference]: Finished difference Result 1941 states and 2630 transitions. [2025-01-08 23:40:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:37,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133 [2025-01-08 23:40:37,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:37,663 INFO L225 Difference]: With dead ends: 1941 [2025-01-08 23:40:37,663 INFO L226 Difference]: Without dead ends: 1156 [2025-01-08 23:40:37,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:37,664 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 120 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:37,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 193 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-01-08 23:40:37,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1156. [2025-01-08 23:40:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277922077922078) internal successors, (1476), 1155 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:37,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1476 transitions. [2025-01-08 23:40:37,683 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1476 transitions. Word has length 133 [2025-01-08 23:40:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:37,683 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1476 transitions. [2025-01-08 23:40:37,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1476 transitions. [2025-01-08 23:40:37,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-08 23:40:37,687 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:37,689 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, 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] [2025-01-08 23:40:37,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:40:37,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:37,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:37,691 INFO L85 PathProgramCache]: Analyzing trace with hash -793046354, now seen corresponding path program 1 times [2025-01-08 23:40:37,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:37,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766839637] [2025-01-08 23:40:37,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:37,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:37,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-08 23:40:37,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-08 23:40:37,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:37,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:37,858 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2025-01-08 23:40:37,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:37,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766839637] [2025-01-08 23:40:37,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766839637] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:37,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:37,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:40:37,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775352560] [2025-01-08 23:40:37,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:37,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:37,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:37,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:37,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:37,859 INFO L87 Difference]: Start difference. First operand 1156 states and 1476 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:38,489 INFO L93 Difference]: Finished difference Result 3056 states and 3917 transitions. [2025-01-08 23:40:38,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:38,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 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 176 [2025-01-08 23:40:38,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:38,495 INFO L225 Difference]: With dead ends: 3056 [2025-01-08 23:40:38,495 INFO L226 Difference]: Without dead ends: 1902 [2025-01-08 23:40:38,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:38,497 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:38,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 157 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:38,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2025-01-08 23:40:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1901. [2025-01-08 23:40:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1901 states, 1900 states have (on average 1.2205263157894737) internal successors, (2319), 1900 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:38,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1901 states to 1901 states and 2319 transitions. [2025-01-08 23:40:38,522 INFO L78 Accepts]: Start accepts. Automaton has 1901 states and 2319 transitions. Word has length 176 [2025-01-08 23:40:38,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:38,522 INFO L471 AbstractCegarLoop]: Abstraction has 1901 states and 2319 transitions. [2025-01-08 23:40:38,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:38,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1901 states and 2319 transitions. [2025-01-08 23:40:38,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-08 23:40:38,524 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:38,524 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:38,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:40:38,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:38,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:38,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1246394274, now seen corresponding path program 1 times [2025-01-08 23:40:38,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:38,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119763423] [2025-01-08 23:40:38,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:38,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:38,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-08 23:40:38,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-08 23:40:38,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:38,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:38,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119763423] [2025-01-08 23:40:38,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119763423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:38,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:38,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:38,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565525218] [2025-01-08 23:40:38,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:38,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:38,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:38,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:38,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:38,666 INFO L87 Difference]: Start difference. First operand 1901 states and 2319 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:39,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:39,254 INFO L93 Difference]: Finished difference Result 4382 states and 5512 transitions. [2025-01-08 23:40:39,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:39,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 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 191 [2025-01-08 23:40:39,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:39,262 INFO L225 Difference]: With dead ends: 4382 [2025-01-08 23:40:39,262 INFO L226 Difference]: Without dead ends: 2667 [2025-01-08 23:40:39,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:39,265 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 171 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:39,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:39,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2025-01-08 23:40:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2664. [2025-01-08 23:40:39,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2664 states, 2663 states have (on average 1.235448742020278) internal successors, (3290), 2663 states have internal predecessors, (3290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:39,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3290 transitions. [2025-01-08 23:40:39,305 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3290 transitions. Word has length 191 [2025-01-08 23:40:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:39,306 INFO L471 AbstractCegarLoop]: Abstraction has 2664 states and 3290 transitions. [2025-01-08 23:40:39,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3290 transitions. [2025-01-08 23:40:39,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-01-08 23:40:39,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:39,310 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:40:39,310 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:39,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1801927002, now seen corresponding path program 1 times [2025-01-08 23:40:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:39,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842418166] [2025-01-08 23:40:39,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:39,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:39,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-01-08 23:40:39,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-01-08 23:40:39,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:39,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:39,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:39,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842418166] [2025-01-08 23:40:39,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842418166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:39,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:39,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:39,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344950610] [2025-01-08 23:40:39,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:39,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:39,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:39,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:39,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:39,495 INFO L87 Difference]: Start difference. First operand 2664 states and 3290 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:40,164 INFO L93 Difference]: Finished difference Result 6451 states and 8066 transitions. [2025-01-08 23:40:40,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:40,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 244 [2025-01-08 23:40:40,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:40,176 INFO L225 Difference]: With dead ends: 6451 [2025-01-08 23:40:40,176 INFO L226 Difference]: Without dead ends: 3973 [2025-01-08 23:40:40,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:40,180 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:40,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 339 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:40,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3973 states. [2025-01-08 23:40:40,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3973 to 3587. [2025-01-08 23:40:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3587 states, 3586 states have (on average 1.2183491355270497) internal successors, (4369), 3586 states have internal predecessors, (4369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3587 states to 3587 states and 4369 transitions. [2025-01-08 23:40:40,235 INFO L78 Accepts]: Start accepts. Automaton has 3587 states and 4369 transitions. Word has length 244 [2025-01-08 23:40:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:40,236 INFO L471 AbstractCegarLoop]: Abstraction has 3587 states and 4369 transitions. [2025-01-08 23:40:40,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 3587 states and 4369 transitions. [2025-01-08 23:40:40,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2025-01-08 23:40:40,238 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:40,238 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:40,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:40:40,238 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:40,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:40,239 INFO L85 PathProgramCache]: Analyzing trace with hash 818593771, now seen corresponding path program 1 times [2025-01-08 23:40:40,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:40,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803258053] [2025-01-08 23:40:40,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:40,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:40,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-08 23:40:40,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-08 23:40:40,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:40,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:40,420 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 23:40:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803258053] [2025-01-08 23:40:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803258053] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:40,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:40,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:40,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104227328] [2025-01-08 23:40:40,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:40,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:40,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:40,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:40,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:40,422 INFO L87 Difference]: Start difference. First operand 3587 states and 4369 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:40,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:40,975 INFO L93 Difference]: Finished difference Result 8293 states and 10107 transitions. [2025-01-08 23:40:40,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:40,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 245 [2025-01-08 23:40:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:40,986 INFO L225 Difference]: With dead ends: 8293 [2025-01-08 23:40:40,987 INFO L226 Difference]: Without dead ends: 4524 [2025-01-08 23:40:40,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:40,991 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 138 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:40,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 347 Invalid, 614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:40:40,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4524 states. [2025-01-08 23:40:41,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4524 to 4507. [2025-01-08 23:40:41,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4507 states, 4506 states have (on average 1.2052818464269863) internal successors, (5431), 4506 states have internal predecessors, (5431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 5431 transitions. [2025-01-08 23:40:41,051 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 5431 transitions. Word has length 245 [2025-01-08 23:40:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:41,051 INFO L471 AbstractCegarLoop]: Abstraction has 4507 states and 5431 transitions. [2025-01-08 23:40:41,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 5431 transitions. [2025-01-08 23:40:41,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2025-01-08 23:40:41,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:41,054 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:41,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:40:41,054 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:41,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:41,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1833106783, now seen corresponding path program 1 times [2025-01-08 23:40:41,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:41,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259429732] [2025-01-08 23:40:41,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:41,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:41,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-01-08 23:40:41,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-01-08 23:40:41,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:41,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:40:41,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:41,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259429732] [2025-01-08 23:40:41,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259429732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:41,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:41,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:41,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002992735] [2025-01-08 23:40:41,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:41,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:40:41,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:41,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:40:41,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:41,233 INFO L87 Difference]: Start difference. First operand 4507 states and 5431 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:41,867 INFO L93 Difference]: Finished difference Result 9946 states and 12108 transitions. [2025-01-08 23:40:41,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:40:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 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 246 [2025-01-08 23:40:41,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:41,879 INFO L225 Difference]: With dead ends: 9946 [2025-01-08 23:40:41,879 INFO L226 Difference]: Without dead ends: 5441 [2025-01-08 23:40:41,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:40:41,884 INFO L435 NwaCegarLoop]: 356 mSDtfsCounter, 133 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:41,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 377 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5441 states. [2025-01-08 23:40:41,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5441 to 5243. [2025-01-08 23:40:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5243 states, 5242 states have (on average 1.1955360549408622) internal successors, (6267), 5242 states have internal predecessors, (6267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5243 states to 5243 states and 6267 transitions. [2025-01-08 23:40:41,948 INFO L78 Accepts]: Start accepts. Automaton has 5243 states and 6267 transitions. Word has length 246 [2025-01-08 23:40:41,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:41,948 INFO L471 AbstractCegarLoop]: Abstraction has 5243 states and 6267 transitions. [2025-01-08 23:40:41,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:41,948 INFO L276 IsEmpty]: Start isEmpty. Operand 5243 states and 6267 transitions. [2025-01-08 23:40:41,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-01-08 23:40:41,951 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:41,951 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, 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] [2025-01-08 23:40:41,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:40:41,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:41,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:41,952 INFO L85 PathProgramCache]: Analyzing trace with hash 20936303, now seen corresponding path program 1 times [2025-01-08 23:40:41,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:41,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681740470] [2025-01-08 23:40:41,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:41,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:41,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-08 23:40:41,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-08 23:40:41,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:41,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:42,276 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:42,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:42,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681740470] [2025-01-08 23:40:42,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681740470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:42,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:42,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:40:42,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216470133] [2025-01-08 23:40:42,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:42,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:42,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:42,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:42,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:42,278 INFO L87 Difference]: Start difference. First operand 5243 states and 6267 transitions. Second operand has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:43,332 INFO L93 Difference]: Finished difference Result 16426 states and 19865 transitions. [2025-01-08 23:40:43,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:43,333 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 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 266 [2025-01-08 23:40:43,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:43,362 INFO L225 Difference]: With dead ends: 16426 [2025-01-08 23:40:43,362 INFO L226 Difference]: Without dead ends: 11185 [2025-01-08 23:40:43,369 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-08 23:40:43,372 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 273 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:43,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 211 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:40:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2025-01-08 23:40:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 9138. [2025-01-08 23:40:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9138 states, 9137 states have (on average 1.1848527963226443) internal successors, (10826), 9137 states have internal predecessors, (10826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9138 states to 9138 states and 10826 transitions. [2025-01-08 23:40:43,502 INFO L78 Accepts]: Start accepts. Automaton has 9138 states and 10826 transitions. Word has length 266 [2025-01-08 23:40:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:43,503 INFO L471 AbstractCegarLoop]: Abstraction has 9138 states and 10826 transitions. [2025-01-08 23:40:43,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.5) internal successors, (266), 4 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:43,507 INFO L276 IsEmpty]: Start isEmpty. Operand 9138 states and 10826 transitions. [2025-01-08 23:40:43,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-01-08 23:40:43,511 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:43,511 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, 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] [2025-01-08 23:40:43,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:40:43,511 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:43,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1782336150, now seen corresponding path program 1 times [2025-01-08 23:40:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:43,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338227239] [2025-01-08 23:40:43,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:43,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-08 23:40:43,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-08 23:40:43,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:43,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:43,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:43,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338227239] [2025-01-08 23:40:43,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338227239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:43,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:43,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:40:43,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021481633] [2025-01-08 23:40:43,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:43,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:43,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:43,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:43,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:43,775 INFO L87 Difference]: Start difference. First operand 9138 states and 10826 transitions. Second operand has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:44,793 INFO L93 Difference]: Finished difference Result 23083 states and 27700 transitions. [2025-01-08 23:40:44,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 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 276 [2025-01-08 23:40:44,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:44,818 INFO L225 Difference]: With dead ends: 23083 [2025-01-08 23:40:44,819 INFO L226 Difference]: Without dead ends: 13947 [2025-01-08 23:40:44,854 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-08 23:40:44,854 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 278 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:44,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 134 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:40:44,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13947 states. [2025-01-08 23:40:44,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13947 to 13563. [2025-01-08 23:40:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13563 states, 13562 states have (on average 1.1875829523669075) internal successors, (16106), 13562 states have internal predecessors, (16106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:44,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13563 states to 13563 states and 16106 transitions. [2025-01-08 23:40:44,984 INFO L78 Accepts]: Start accepts. Automaton has 13563 states and 16106 transitions. Word has length 276 [2025-01-08 23:40:44,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:44,984 INFO L471 AbstractCegarLoop]: Abstraction has 13563 states and 16106 transitions. [2025-01-08 23:40:44,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.0) internal successors, (276), 4 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 13563 states and 16106 transitions. [2025-01-08 23:40:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-01-08 23:40:44,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:44,990 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:44,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:40:44,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:44,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:44,991 INFO L85 PathProgramCache]: Analyzing trace with hash -2144611478, now seen corresponding path program 1 times [2025-01-08 23:40:44,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:44,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553704457] [2025-01-08 23:40:44,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:44,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:45,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 23:40:45,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 23:40:45,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:45,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 185 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553704457] [2025-01-08 23:40:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553704457] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531860462] [2025-01-08 23:40:45,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:45,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:45,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:45,548 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:45,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:40:45,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-01-08 23:40:45,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-01-08 23:40:45,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:45,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:45,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 23:40:45,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:46,541 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:46,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:40:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 74 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531860462] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:40:47,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:40:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-08 23:40:47,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475419381] [2025-01-08 23:40:47,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:40:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 23:40:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:47,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 23:40:47,478 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-01-08 23:40:47,479 INFO L87 Difference]: Start difference. First operand 13563 states and 16106 transitions. Second operand has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:49,812 INFO L93 Difference]: Finished difference Result 30333 states and 36408 transitions. [2025-01-08 23:40:49,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 23:40:49,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 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 278 [2025-01-08 23:40:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:49,837 INFO L225 Difference]: With dead ends: 30333 [2025-01-08 23:40:49,837 INFO L226 Difference]: Without dead ends: 16760 [2025-01-08 23:40:49,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 568 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=224, Unknown=0, NotChecked=0, Total=342 [2025-01-08 23:40:49,849 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 1610 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 3781 mSolverCounterSat, 649 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 649 IncrementalHoareTripleChecker+Valid, 3781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:49,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 117 Invalid, 4430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [649 Valid, 3781 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:40:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16760 states. [2025-01-08 23:40:49,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16760 to 15369. [2025-01-08 23:40:50,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15369 states, 15368 states have (on average 1.1525247267048413) internal successors, (17712), 15368 states have internal predecessors, (17712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 17712 transitions. [2025-01-08 23:40:50,067 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 17712 transitions. Word has length 278 [2025-01-08 23:40:50,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:50,067 INFO L471 AbstractCegarLoop]: Abstraction has 15369 states and 17712 transitions. [2025-01-08 23:40:50,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 45.81818181818182) internal successors, (504), 10 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:50,068 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 17712 transitions. [2025-01-08 23:40:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-08 23:40:50,072 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:50,073 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, 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] [2025-01-08 23:40:50,081 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-08 23:40:50,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 23:40:50,277 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:50,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash -387579835, now seen corresponding path program 1 times [2025-01-08 23:40:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:50,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780083494] [2025-01-08 23:40:50,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:50,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:50,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-08 23:40:50,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-08 23:40:50,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:50,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:50,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:50,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780083494] [2025-01-08 23:40:50,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780083494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:50,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:40:50,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:40:50,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849846920] [2025-01-08 23:40:50,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:50,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:50,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:50,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:50,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:50,524 INFO L87 Difference]: Start difference. First operand 15369 states and 17712 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:51,335 INFO L93 Difference]: Finished difference Result 29784 states and 34311 transitions. [2025-01-08 23:40:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:51,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 297 [2025-01-08 23:40:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:51,357 INFO L225 Difference]: With dead ends: 29784 [2025-01-08 23:40:51,357 INFO L226 Difference]: Without dead ends: 14233 [2025-01-08 23:40:51,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:40:51,369 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 188 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:51,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 157 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:40:51,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14233 states. [2025-01-08 23:40:51,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14233 to 12753. [2025-01-08 23:40:51,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12753 states, 12752 states have (on average 1.1029642409033877) internal successors, (14065), 12752 states have internal predecessors, (14065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12753 states to 12753 states and 14065 transitions. [2025-01-08 23:40:51,490 INFO L78 Accepts]: Start accepts. Automaton has 12753 states and 14065 transitions. Word has length 297 [2025-01-08 23:40:51,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:51,491 INFO L471 AbstractCegarLoop]: Abstraction has 12753 states and 14065 transitions. [2025-01-08 23:40:51,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 12753 states and 14065 transitions. [2025-01-08 23:40:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2025-01-08 23:40:51,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:51,499 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, 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, 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-08 23:40:51,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:40:51,499 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:51,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 2081864772, now seen corresponding path program 1 times [2025-01-08 23:40:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187070483] [2025-01-08 23:40:51,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:51,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-08 23:40:51,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-08 23:40:51,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:51,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:52,034 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 199 proven. 160 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:40:52,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:52,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187070483] [2025-01-08 23:40:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187070483] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:52,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140430154] [2025-01-08 23:40:52,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:52,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:52,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:52,036 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:40:52,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:40:52,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes. [2025-01-08 23:40:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements. [2025-01-08 23:40:52,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:52,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:52,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:40:52,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:40:52,577 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:40:52,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140430154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:40:52,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:40:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-01-08 23:40:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122241747] [2025-01-08 23:40:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:40:52,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:40:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:52,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:40:52,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:40:52,580 INFO L87 Difference]: Start difference. First operand 12753 states and 14065 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:53,208 INFO L93 Difference]: Finished difference Result 25875 states and 28511 transitions. [2025-01-08 23:40:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:40:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 351 [2025-01-08 23:40:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:53,225 INFO L225 Difference]: With dead ends: 25875 [2025-01-08 23:40:53,225 INFO L226 Difference]: Without dead ends: 13124 [2025-01-08 23:40:53,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:40:53,237 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 290 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:53,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 144 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:40:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13124 states. [2025-01-08 23:40:53,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13124 to 12201. [2025-01-08 23:40:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12201 states, 12200 states have (on average 1.1031967213114755) internal successors, (13459), 12200 states have internal predecessors, (13459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12201 states to 12201 states and 13459 transitions. [2025-01-08 23:40:53,336 INFO L78 Accepts]: Start accepts. Automaton has 12201 states and 13459 transitions. Word has length 351 [2025-01-08 23:40:53,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:53,337 INFO L471 AbstractCegarLoop]: Abstraction has 12201 states and 13459 transitions. [2025-01-08 23:40:53,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:53,337 INFO L276 IsEmpty]: Start isEmpty. Operand 12201 states and 13459 transitions. [2025-01-08 23:40:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-01-08 23:40:53,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:53,345 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:40:53,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:40:53,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:53,546 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:53,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1809256611, now seen corresponding path program 1 times [2025-01-08 23:40:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46186259] [2025-01-08 23:40:53,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:53,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-08 23:40:53,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-08 23:40:53,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:53,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:53,809 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:53,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:53,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46186259] [2025-01-08 23:40:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46186259] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:53,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005871960] [2025-01-08 23:40:53,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:53,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:53,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:53,812 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-08 23:40:53,814 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-08 23:40:53,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-08 23:40:53,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-08 23:40:53,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:53,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:53,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:40:53,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:40:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:54,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:40:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 123 proven. 124 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:55,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005871960] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:40:55,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:40:55,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 4] total 9 [2025-01-08 23:40:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044829605] [2025-01-08 23:40:55,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:40:55,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 23:40:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:40:55,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 23:40:55,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:40:55,181 INFO L87 Difference]: Start difference. First operand 12201 states and 13459 transitions. Second operand has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:57,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:40:57,034 INFO L93 Difference]: Finished difference Result 38954 states and 42800 transitions. [2025-01-08 23:40:57,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 23:40:57,035 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 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 362 [2025-01-08 23:40:57,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:40:57,060 INFO L225 Difference]: With dead ends: 38954 [2025-01-08 23:40:57,060 INFO L226 Difference]: Without dead ends: 26571 [2025-01-08 23:40:57,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 726 GetRequests, 718 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:40:57,072 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 936 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2991 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 2991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:40:57,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 118 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 2991 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-08 23:40:57,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26571 states. [2025-01-08 23:40:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26571 to 23988. [2025-01-08 23:40:57,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23988 states, 23987 states have (on average 1.0936757410263893) internal successors, (26234), 23987 states have internal predecessors, (26234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:57,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23988 states to 23988 states and 26234 transitions. [2025-01-08 23:40:57,302 INFO L78 Accepts]: Start accepts. Automaton has 23988 states and 26234 transitions. Word has length 362 [2025-01-08 23:40:57,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:40:57,303 INFO L471 AbstractCegarLoop]: Abstraction has 23988 states and 26234 transitions. [2025-01-08 23:40:57,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 78.8) internal successors, (788), 9 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:40:57,303 INFO L276 IsEmpty]: Start isEmpty. Operand 23988 states and 26234 transitions. [2025-01-08 23:40:57,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-01-08 23:40:57,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:40:57,311 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, 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, 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] [2025-01-08 23:40:57,318 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-08 23:40:57,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:57,512 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:40:57,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:40:57,512 INFO L85 PathProgramCache]: Analyzing trace with hash 977995327, now seen corresponding path program 1 times [2025-01-08 23:40:57,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:40:57,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308088799] [2025-01-08 23:40:57,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:57,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:40:57,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-01-08 23:40:57,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-01-08 23:40:57,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:57,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:40:58,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:40:58,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308088799] [2025-01-08 23:40:58,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308088799] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:40:58,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209845866] [2025-01-08 23:40:58,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:40:58,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:40:58,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:40:58,021 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-08 23:40:58,022 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-08 23:40:58,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-01-08 23:40:58,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-01-08 23:40:58,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:40:58,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:40:58,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 23:40:58,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 96 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:01,325 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:41:02,147 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 370 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209845866] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:41:02,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:41:02,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-01-08 23:41:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582489476] [2025-01-08 23:41:02,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:41:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-08 23:41:02,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:02,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-08 23:41:02,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2025-01-08 23:41:02,151 INFO L87 Difference]: Start difference. First operand 23988 states and 26234 transitions. Second operand has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:07,532 INFO L93 Difference]: Finished difference Result 60322 states and 66045 transitions. [2025-01-08 23:41:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-08 23:41:07,533 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 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 373 [2025-01-08 23:41:07,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:07,569 INFO L225 Difference]: With dead ends: 60322 [2025-01-08 23:41:07,569 INFO L226 Difference]: Without dead ends: 36152 [2025-01-08 23:41:07,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 750 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=334, Unknown=0, NotChecked=0, Total=506 [2025-01-08 23:41:07,587 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2837 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 6024 mSolverCounterSat, 1007 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2837 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 7031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1007 IncrementalHoareTripleChecker+Valid, 6024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:07,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2837 Valid, 178 Invalid, 7031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1007 Valid, 6024 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2025-01-08 23:41:07,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36152 states. [2025-01-08 23:41:07,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36152 to 22692. [2025-01-08 23:41:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22692 states, 22691 states have (on average 1.0796791679520514) internal successors, (24499), 22691 states have internal predecessors, (24499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22692 states to 22692 states and 24499 transitions. [2025-01-08 23:41:07,888 INFO L78 Accepts]: Start accepts. Automaton has 22692 states and 24499 transitions. Word has length 373 [2025-01-08 23:41:07,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:07,889 INFO L471 AbstractCegarLoop]: Abstraction has 22692 states and 24499 transitions. [2025-01-08 23:41:07,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 82.91666666666667) internal successors, (995), 12 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 22692 states and 24499 transitions. [2025-01-08 23:41:07,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2025-01-08 23:41:07,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:07,900 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:07,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 23:41:08,100 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,SelfDestructingSolverStorable14 [2025-01-08 23:41:08,101 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:08,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:08,101 INFO L85 PathProgramCache]: Analyzing trace with hash 142644118, now seen corresponding path program 1 times [2025-01-08 23:41:08,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897263196] [2025-01-08 23:41:08,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:08,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:08,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 459 statements into 1 equivalence classes. [2025-01-08 23:41:08,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 459 of 459 statements. [2025-01-08 23:41:08,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:08,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:08,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897263196] [2025-01-08 23:41:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897263196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:08,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:08,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 23:41:08,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745586151] [2025-01-08 23:41:08,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:08,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:41:08,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:08,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:41:08,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:41:08,509 INFO L87 Difference]: Start difference. First operand 22692 states and 24499 transitions. Second operand has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:09,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:09,666 INFO L93 Difference]: Finished difference Result 50178 states and 54118 transitions. [2025-01-08 23:41:09,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:41:09,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 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 459 [2025-01-08 23:41:09,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:09,690 INFO L225 Difference]: With dead ends: 50178 [2025-01-08 23:41:09,691 INFO L226 Difference]: Without dead ends: 27672 [2025-01-08 23:41:09,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:41:09,703 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 338 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:09,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 75 Invalid, 1746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:41:09,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27672 states. [2025-01-08 23:41:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27672 to 23432. [2025-01-08 23:41:09,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23432 states, 23431 states have (on average 1.0781016601937603) internal successors, (25261), 23431 states have internal predecessors, (25261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23432 states to 23432 states and 25261 transitions. [2025-01-08 23:41:09,892 INFO L78 Accepts]: Start accepts. Automaton has 23432 states and 25261 transitions. Word has length 459 [2025-01-08 23:41:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:09,892 INFO L471 AbstractCegarLoop]: Abstraction has 23432 states and 25261 transitions. [2025-01-08 23:41:09,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.8) internal successors, (459), 5 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 23432 states and 25261 transitions. [2025-01-08 23:41:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2025-01-08 23:41:09,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:09,907 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, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:09,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:41:09,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:09,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 809696015, now seen corresponding path program 1 times [2025-01-08 23:41:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:09,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340120214] [2025-01-08 23:41:09,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:09,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:09,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 548 statements into 1 equivalence classes. [2025-01-08 23:41:09,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 548 of 548 statements. [2025-01-08 23:41:09,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:09,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 745 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:41:10,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:10,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340120214] [2025-01-08 23:41:10,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340120214] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:10,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:10,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 23:41:10,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976262062] [2025-01-08 23:41:10,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:10,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:41:10,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:10,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:41:10,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:41:10,343 INFO L87 Difference]: Start difference. First operand 23432 states and 25261 transitions. Second operand has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 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-08 23:41:11,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:11,272 INFO L93 Difference]: Finished difference Result 48342 states and 52072 transitions. [2025-01-08 23:41:11,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:41:11,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 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 548 [2025-01-08 23:41:11,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:11,292 INFO L225 Difference]: With dead ends: 48342 [2025-01-08 23:41:11,292 INFO L226 Difference]: Without dead ends: 25096 [2025-01-08 23:41:11,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:41:11,304 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 339 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 1504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:11,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 71 Invalid, 1504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:41:11,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25096 states. [2025-01-08 23:41:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25096 to 19932. [2025-01-08 23:41:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19932 states, 19931 states have (on average 1.0784707239977924) internal successors, (21495), 19931 states have internal predecessors, (21495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:11,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19932 states to 19932 states and 21495 transitions. [2025-01-08 23:41:11,529 INFO L78 Accepts]: Start accepts. Automaton has 19932 states and 21495 transitions. Word has length 548 [2025-01-08 23:41:11,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:11,529 INFO L471 AbstractCegarLoop]: Abstraction has 19932 states and 21495 transitions. [2025-01-08 23:41:11,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.0) internal successors, (445), 5 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-08 23:41:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 19932 states and 21495 transitions. [2025-01-08 23:41:11,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2025-01-08 23:41:11,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:11,545 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, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:11,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:41:11,546 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:11,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:11,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1362391050, now seen corresponding path program 1 times [2025-01-08 23:41:11,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:11,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038603907] [2025-01-08 23:41:11,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:11,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:11,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-08 23:41:11,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-08 23:41:11,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:11,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:12,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 557 proven. 651 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2025-01-08 23:41:12,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038603907] [2025-01-08 23:41:12,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038603907] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:12,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467653859] [2025-01-08 23:41:12,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:12,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:12,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:12,633 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-08 23:41:12,638 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-08 23:41:12,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 693 statements into 1 equivalence classes. [2025-01-08 23:41:12,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 693 of 693 statements. [2025-01-08 23:41:12,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:12,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:12,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 883 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 23:41:12,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:12,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1270 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2025-01-08 23:41:12,994 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:41:12,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467653859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:12,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:41:12,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2025-01-08 23:41:12,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850972222] [2025-01-08 23:41:12,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:12,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:12,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:12,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:12,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:41:12,996 INFO L87 Difference]: Start difference. First operand 19932 states and 21495 transitions. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:13,421 INFO L93 Difference]: Finished difference Result 40232 states and 43370 transitions. [2025-01-08 23:41:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:13,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 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 693 [2025-01-08 23:41:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:13,438 INFO L225 Difference]: With dead ends: 40232 [2025-01-08 23:41:13,438 INFO L226 Difference]: Without dead ends: 20302 [2025-01-08 23:41:13,447 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 701 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:41:13,448 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 125 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:13,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 126 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:41:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20302 states. [2025-01-08 23:41:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20302 to 14224. [2025-01-08 23:41:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14224 states, 14223 states have (on average 1.076847359910005) internal successors, (15316), 14223 states have internal predecessors, (15316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14224 states to 14224 states and 15316 transitions. [2025-01-08 23:41:13,582 INFO L78 Accepts]: Start accepts. Automaton has 14224 states and 15316 transitions. Word has length 693 [2025-01-08 23:41:13,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:13,583 INFO L471 AbstractCegarLoop]: Abstraction has 14224 states and 15316 transitions. [2025-01-08 23:41:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:13,583 INFO L276 IsEmpty]: Start isEmpty. Operand 14224 states and 15316 transitions. [2025-01-08 23:41:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2025-01-08 23:41:13,594 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:13,594 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:13,601 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-08 23:41:13,794 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,SelfDestructingSolverStorable17 [2025-01-08 23:41:13,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:13,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:13,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1470336503, now seen corresponding path program 1 times [2025-01-08 23:41:13,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:13,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607109138] [2025-01-08 23:41:13,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:13,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:13,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-01-08 23:41:13,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-01-08 23:41:13,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:13,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:14,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 186 proven. 942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:14,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607109138] [2025-01-08 23:41:14,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607109138] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:14,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784731923] [2025-01-08 23:41:14,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:14,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:14,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:14,628 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-08 23:41:14,629 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-08 23:41:14,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 705 statements into 1 equivalence classes. [2025-01-08 23:41:14,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 705 of 705 statements. [2025-01-08 23:41:14,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:14,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:14,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-08 23:41:14,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 62 proven. 1066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:15,376 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:41:18,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 771 proven. 233 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:41:18,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784731923] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:41:18,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:41:18,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-01-08 23:41:18,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690187082] [2025-01-08 23:41:18,911 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:41:18,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-08 23:41:18,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:18,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-08 23:41:18,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-01-08 23:41:18,914 INFO L87 Difference]: Start difference. First operand 14224 states and 15316 transitions. Second operand has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:22,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:22,988 INFO L93 Difference]: Finished difference Result 56107 states and 60366 transitions. [2025-01-08 23:41:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-08 23:41:22,989 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 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 705 [2025-01-08 23:41:22,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:22,990 INFO L225 Difference]: With dead ends: 56107 [2025-01-08 23:41:22,990 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:41:23,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1434 GetRequests, 1409 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=212, Invalid=490, Unknown=0, NotChecked=0, Total=702 [2025-01-08 23:41:23,002 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 2622 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 6356 mSolverCounterSat, 1130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2622 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 7486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1130 IncrementalHoareTripleChecker+Valid, 6356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:23,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2622 Valid, 217 Invalid, 7486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1130 Valid, 6356 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-01-08 23:41:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:41:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:41:23,003 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-08 23:41:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:41:23,003 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 705 [2025-01-08 23:41:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:23,003 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:41:23,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 117.05882352941177) internal successors, (1990), 17 states have internal predecessors, (1990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:23,008 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:41:23,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:41:23,012 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:41:23,021 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-08 23:41:23,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:23,219 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] [2025-01-08 23:41:23,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:41:43,028 WARN L286 SmtUtils]: Spent 19.80s on a formula simplification. DAG size of input: 879 DAG size of output: 1103 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 23:41:50,633 WARN L286 SmtUtils]: Spent 7.60s on a formula simplification. DAG size of input: 1103 DAG size of output: 131 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-01-08 23:41:50,640 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:41:50,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:41:50 BoogieIcfgContainer [2025-01-08 23:41:50,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:41:50,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:41:50,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:41:50,691 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:41:50,692 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:40:34" (3/4) ... [2025-01-08 23:41:50,695 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:41:50,736 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:41:50,740 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:41:50,741 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:41:50,742 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:41:50,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:41:50,934 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:41:50,934 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:41:50,935 INFO L158 Benchmark]: Toolchain (without parser) took 78394.86ms. Allocated memory was 142.6MB in the beginning and 436.2MB in the end (delta: 293.6MB). Free memory was 105.5MB in the beginning and 168.2MB in the end (delta: -62.7MB). Peak memory consumption was 223.1MB. Max. memory is 16.1GB. [2025-01-08 23:41:50,936 INFO L158 Benchmark]: CDTParser took 0.74ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:41:50,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 449.41ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 61.8MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:41:50,937 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.23ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 45.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:50,937 INFO L158 Benchmark]: Boogie Preprocessor took 184.13ms. Allocated memory is still 142.6MB. Free memory was 45.1MB in the beginning and 82.6MB in the end (delta: -37.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-01-08 23:41:50,937 INFO L158 Benchmark]: RCFGBuilder took 1332.44ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.6MB in the beginning and 235.1MB in the end (delta: -152.5MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2025-01-08 23:41:50,937 INFO L158 Benchmark]: TraceAbstraction took 76097.53ms. Allocated memory was 285.2MB in the beginning and 436.2MB in the end (delta: 151.0MB). Free memory was 234.1MB in the beginning and 189.2MB in the end (delta: 44.9MB). Peak memory consumption was 299.4MB. Max. memory is 16.1GB. [2025-01-08 23:41:50,937 INFO L158 Benchmark]: Witness Printer took 243.05ms. Allocated memory is still 436.2MB. Free memory was 189.2MB in the beginning and 168.2MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:41:50,938 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.74ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 449.41ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 61.8MB in the end (delta: 43.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.23ms. Allocated memory is still 142.6MB. Free memory was 61.8MB in the beginning and 45.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 184.13ms. Allocated memory is still 142.6MB. Free memory was 45.1MB in the beginning and 82.6MB in the end (delta: -37.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1332.44ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 82.6MB in the beginning and 235.1MB in the end (delta: -152.5MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * TraceAbstraction took 76097.53ms. Allocated memory was 285.2MB in the beginning and 436.2MB in the end (delta: 151.0MB). Free memory was 234.1MB in the beginning and 189.2MB in the end (delta: 44.9MB). Peak memory consumption was 299.4MB. Max. memory is 16.1GB. * Witness Printer took 243.05ms. Allocated memory is still 436.2MB. Free memory was 189.2MB in the beginning and 168.2MB in the end (delta: 21.0MB). Peak memory consumption was 16.8MB. 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: 208]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 48.6s, OverallIterations: 19, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 25.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10949 SdHoareTripleChecker+Valid, 22.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10949 mSDsluCounter, 3599 SdHoareTripleChecker+Invalid, 18.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 933 mSDsCounter, 4857 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30905 IncrementalHoareTripleChecker+Invalid, 35762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4857 mSolverCounterUnsat, 2666 mSDtfsCounter, 30905 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4597 GetRequests, 4492 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23988occurred in iteration=14, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 38370 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 17.9s InterpolantComputationTime, 8801 NumberOfCodeBlocks, 8801 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 10490 ConstructedInterpolants, 152 QuantifiedInterpolants, 70462 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3612 ConjunctsInSsa, 47 ConjunctsInUnsatCore, 29 InterpolantComputations, 15 PerfectInterpolantSequences, 8104/12366 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: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((a25 == 13) && (a29 <= 275)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (130 <= a29)) || (((((((0 <= ((long long) a23 + 599772)) && (a29 <= 140)) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || (((((((((0 <= ((long long) 909625 + a23)) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a4 == 0)) && (((long long) a29 + 22) <= 0)) && (a25 <= 10)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || ((((((((((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0)) && (a29 <= 599998)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12)))) || (((((((((((a29 <= 275) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a4 == 0)) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (246 <= a29)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942))) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && ((a25 == 13) || (a25 == 12)))) || (((((((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) && ((a25 == 13) || (a25 == 12)))) || (((((((((((a29 <= 275) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a25 <= 9)) && (a8 == 15)) && (246 <= a29)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942))) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || (((((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0)) && (((((((a25 <= 10) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42))) || (((((((0 <= ((long long) 909625 + a23)) && (a29 <= 599999)) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)))) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || (((((((((a4 == 0) && ((((a23 >= 0) ? (a23 % 5) : ((a23 % 5) + 5)) != 0) || (0 < (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) && (a29 <= 599998)) && (a25 == 9)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29)) && (0 <= (((a23 >= 0) ? (a23 / 5) : ((a23 / 5) - 1)) + 301942)))) || (((((((((((long long) 275921 + a29) <= 0) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a25 == 11)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (224526 <= a23)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || ((((((((0 <= ((long long) a23 + 599772)) && (a4 == 0)) && (a25 == 11)) && (a29 <= 599998)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29))) || ((((((((long long) a23 + 43) <= 0) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a8 == 15)) && (a25 == 10))) || (((((((a25 == 11) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((a25 == 9) && (a4 == 1)) && (a29 <= 130))) || (((((((((a29 <= 275) && (a25 == 12)) && (0 <= ((long long) 909625 + a23))) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a4 == 0)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))))) || (((((((0 <= ((long long) 909625 + a23)) && (a4 == 0)) && (a25 == 11)) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((((0 <= ((long long) 909625 + a23)) && (a25 == 11)) && (a29 <= 599999)) && (a3 == 1)) && (a4 == 1)) && (214883 <= a29)) && (a23 <= 312)) && (a8 == 15))) || (((((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || (((((((((long long) a23 + 43) <= 0) && (0 <= ((long long) a23 + 599772))) && (a29 <= 140)) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))) || (((((((((((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0)) && (a25 == 11)) && (a29 <= 599999)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a4 == 1)) && (a8 == 15)) && (246 <= a29)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (0 <= ((long long) a23 + 42)))) || ((((((((((181945 <= a23) && ((0 < (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1)))) || ((((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) % 5) + 5)) != 0))) && (a25 == 11)) && (a3 == 1)) && (((0 < (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 25) : ((((long long) -1 * a23) / 25) - 1)) + 1130118)) || (((((long long) a23 * 4) >= 0) ? (((long long) a23 * 4) % 5) : ((((long long) a23 * 4) % 5) + 5)) != 0)) || (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) >= 0) ? (((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) : ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) % 5) + 5)) != 0))) && (a29 <= 220)) && (a4 == 1)) && (a8 == 15)) && (0 <= (1130118 + (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) >= 0) ? ((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) : (((((((long long) -1 * a23) >= 0) ? (((long long) -1 * a23) / 5) : ((((long long) -1 * a23) / 5) - 1)) + 1) / 5) - 1))))) && (130 <= a29))) || ((((((((a29 <= 275) && (0 <= ((long long) a23 + 599772))) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (246 <= a29))) || (((((((((long long) a23 + 43) <= 0) && (a25 == 12)) && (0 <= ((long long) a23 + 599772))) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a29 <= 130))) || ((((((a29 <= 140) && (a25 == 9)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:41:50,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE