./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label09.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/Problem14_label09.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 1b3a5c95c10076386b15606d0ac6559403dceee57f74bca8a711eb692be2f98e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:57:28,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:57:28,461 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:57:28,464 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:57:28,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:57:28,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:57:28,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:57:28,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:57:28,492 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:57:28,492 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:57:28,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:57:28,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:57:28,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:57:28,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:57:28,494 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:57:28,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:57:28,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:57:28,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:57:28,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:57:28,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:57:28,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:57:28,495 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:57:28,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:57:28,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:57:28,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:28,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:57:28,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:57:28,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:57:28,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:57:28,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:28,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:57:28,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:57:28,497 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 -> 1b3a5c95c10076386b15606d0ac6559403dceee57f74bca8a711eb692be2f98e [2025-01-08 23:57:28,726 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:57:28,735 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:57:28,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:57:28,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:57:28,739 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:57:28,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2025-01-08 23:57:29,865 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a0196140/d2f6d2a23df04db8b5abb7f9831195ac/FLAGbfaaecd97 [2025-01-08 23:57:30,181 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:57:30,182 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label09.c [2025-01-08 23:57:30,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a0196140/d2f6d2a23df04db8b5abb7f9831195ac/FLAGbfaaecd97 [2025-01-08 23:57:30,442 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a0196140/d2f6d2a23df04db8b5abb7f9831195ac [2025-01-08 23:57:30,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:57:30,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:57:30,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:57:30,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:57:30,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:57:30,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f73c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30, skipping insertion in model container [2025-01-08 23:57:30,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:57:30,619 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/Problem14_label09.c[4722,4735] [2025-01-08 23:57:30,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:57:30,740 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:57:30,755 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/Problem14_label09.c[4722,4735] [2025-01-08 23:57:30,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:57:30,825 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:57:30,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30 WrapperNode [2025-01-08 23:57:30,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:57:30,827 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:57:30,827 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:57:30,827 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:57:30,831 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:57:30" (1/1) ... [2025-01-08 23:57:30,841 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:57:30" (1/1) ... [2025-01-08 23:57:30,878 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:57:30,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:57:30,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:57:30,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:57:30,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:57:30,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,890 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,921 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:57:30,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,956 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,969 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:57:30,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:57:30,989 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:57:30,990 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:57:30,990 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (1/1) ... [2025-01-08 23:57:30,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:31,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:31,016 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:57:31,018 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:57:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:57:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:57:31,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:57:31,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:57:31,082 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:57:31,084 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:57:31,941 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:57:31,941 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:57:31,955 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:57:31,956 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:57:31,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:31 BoogieIcfgContainer [2025-01-08 23:57:31,956 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:57:31,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:57:31,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:57:31,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:57:31,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:57:30" (1/3) ... [2025-01-08 23:57:31,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5cb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:57:31, skipping insertion in model container [2025-01-08 23:57:31,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:30" (2/3) ... [2025-01-08 23:57:31,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a5cb35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:57:31, skipping insertion in model container [2025-01-08 23:57:31,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:31" (3/3) ... [2025-01-08 23:57:31,963 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label09.c [2025-01-08 23:57:31,973 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:57:31,976 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label09.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:57:32,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:57:32,031 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;@65818bb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:57:32,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:57:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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:57:32,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 23:57:32,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:32,041 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] [2025-01-08 23:57:32,041 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:32,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:32,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1182209948, now seen corresponding path program 1 times [2025-01-08 23:57:32,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:32,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91996904] [2025-01-08 23:57:32,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:32,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:32,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-08 23:57:32,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 23:57:32,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:32,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:32,372 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:57:32,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:32,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91996904] [2025-01-08 23:57:32,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91996904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:32,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:32,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:32,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850625612] [2025-01-08 23:57:32,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:32,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:32,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:32,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:32,390 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 0 states have call successors, (0), 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 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:57:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:33,603 INFO L93 Difference]: Finished difference Result 850 states and 1554 transitions. [2025-01-08 23:57:33,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:33,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2025-01-08 23:57:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:33,613 INFO L225 Difference]: With dead ends: 850 [2025-01-08 23:57:33,613 INFO L226 Difference]: Without dead ends: 538 [2025-01-08 23:57:33,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:57:33,617 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 499 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:33,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 194 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:57:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-08 23:57:33,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2025-01-08 23:57:33,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.4487895716945995) internal successors, (778), 537 states have internal predecessors, (778), 0 states have call successors, (0), 0 states 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:57:33,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 778 transitions. [2025-01-08 23:57:33,669 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 778 transitions. Word has length 45 [2025-01-08 23:57:33,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:33,669 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 778 transitions. [2025-01-08 23:57:33,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states 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:57:33,669 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 778 transitions. [2025-01-08 23:57:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-08 23:57:33,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:33,671 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:33,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:57:33,672 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:33,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:33,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1861774057, now seen corresponding path program 1 times [2025-01-08 23:57:33,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:33,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583062512] [2025-01-08 23:57:33,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:33,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:33,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-08 23:57:33,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-08 23:57:33,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:33,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:33,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:33,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583062512] [2025-01-08 23:57:33,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583062512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:33,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:33,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:33,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518640192] [2025-01-08 23:57:33,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:34,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:34,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:34,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:34,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:34,001 INFO L87 Difference]: Start difference. First operand 538 states and 778 transitions. Second operand has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:57:34,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:34,566 INFO L93 Difference]: Finished difference Result 1281 states and 1978 transitions. [2025-01-08 23:57:34,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:34,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-08 23:57:34,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:34,569 INFO L225 Difference]: With dead ends: 1281 [2025-01-08 23:57:34,569 INFO L226 Difference]: Without dead ends: 894 [2025-01-08 23:57:34,570 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:57:34,570 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 850 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:34,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 119 Invalid, 850 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:57:34,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-08 23:57:34,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 716. [2025-01-08 23:57:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 715 states have (on average 1.220979020979021) internal successors, (873), 715 states have internal predecessors, (873), 0 states have call successors, (0), 0 states 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:57:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 873 transitions. [2025-01-08 23:57:34,591 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 873 transitions. Word has length 125 [2025-01-08 23:57:34,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:34,592 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 873 transitions. [2025-01-08 23:57:34,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.25) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states 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:57:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 873 transitions. [2025-01-08 23:57:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2025-01-08 23:57:34,596 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:34,597 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, 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] [2025-01-08 23:57:34,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:57:34,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:34,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:34,597 INFO L85 PathProgramCache]: Analyzing trace with hash -963027064, now seen corresponding path program 1 times [2025-01-08 23:57:34,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:34,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466777493] [2025-01-08 23:57:34,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:34,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:34,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-08 23:57:34,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-08 23:57:34,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:34,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:34,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466777493] [2025-01-08 23:57:34,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466777493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:34,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042868044] [2025-01-08 23:57:34,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:34,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:34,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:34,993 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:57:34,995 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:57:35,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-08 23:57:35,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-08 23:57:35,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:35,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:35,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:35,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:57:35,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:35,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042868044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:35,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:35,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:57:35,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010664604] [2025-01-08 23:57:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:35,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:35,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:35,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:35,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:35,296 INFO L87 Difference]: Start difference. First operand 716 states and 873 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:57:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:35,737 INFO L93 Difference]: Finished difference Result 1608 states and 2071 transitions. [2025-01-08 23:57:35,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:35,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2025-01-08 23:57:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:35,740 INFO L225 Difference]: With dead ends: 1608 [2025-01-08 23:57:35,741 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:57:35,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:35,742 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:35,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 47 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:57:35,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-01-08 23:57:35,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.2156862745098038) internal successors, (1302), 1071 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states 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:57:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1302 transitions. [2025-01-08 23:57:35,761 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1302 transitions. Word has length 216 [2025-01-08 23:57:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:35,762 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1302 transitions. [2025-01-08 23:57:35,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 2 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:57:35,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1302 transitions. [2025-01-08 23:57:35,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-01-08 23:57:35,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:35,764 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, 2, 2, 2, 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] [2025-01-08 23:57:35,775 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:57:35,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:35,965 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:35,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:35,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1809662858, now seen corresponding path program 1 times [2025-01-08 23:57:35,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:35,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358190538] [2025-01-08 23:57:35,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:35,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:35,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-08 23:57:36,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-08 23:57:36,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:36,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358190538] [2025-01-08 23:57:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358190538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:36,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:36,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672163603] [2025-01-08 23:57:36,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:36,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:36,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:36,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:36,193 INFO L87 Difference]: Start difference. First operand 1072 states and 1302 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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:57:36,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:36,641 INFO L93 Difference]: Finished difference Result 2498 states and 3070 transitions. [2025-01-08 23:57:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:36,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 219 [2025-01-08 23:57:36,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:36,648 INFO L225 Difference]: With dead ends: 2498 [2025-01-08 23:57:36,648 INFO L226 Difference]: Without dead ends: 1606 [2025-01-08 23:57:36,649 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:57:36,650 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 111 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:36,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:36,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2025-01-08 23:57:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1606. [2025-01-08 23:57:36,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.168847352024922) internal successors, (1876), 1605 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states 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:57:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1876 transitions. [2025-01-08 23:57:36,690 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1876 transitions. Word has length 219 [2025-01-08 23:57:36,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:36,690 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1876 transitions. [2025-01-08 23:57:36,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 states 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:57:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1876 transitions. [2025-01-08 23:57:36,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2025-01-08 23:57:36,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:36,694 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:36,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:57:36,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:36,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:36,695 INFO L85 PathProgramCache]: Analyzing trace with hash -256512137, now seen corresponding path program 1 times [2025-01-08 23:57:36,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177133822] [2025-01-08 23:57:36,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:36,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes. [2025-01-08 23:57:36,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements. [2025-01-08 23:57:36,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:36,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2025-01-08 23:57:36,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:36,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177133822] [2025-01-08 23:57:36,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177133822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:36,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:36,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:36,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423127992] [2025-01-08 23:57:36,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:36,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:36,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:36,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:36,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:36,971 INFO L87 Difference]: Start difference. First operand 1606 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:57:37,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:37,481 INFO L93 Difference]: Finished difference Result 3061 states and 3636 transitions. [2025-01-08 23:57:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 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 336 [2025-01-08 23:57:37,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:37,487 INFO L225 Difference]: With dead ends: 3061 [2025-01-08 23:57:37,487 INFO L226 Difference]: Without dead ends: 1784 [2025-01-08 23:57:37,488 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:57:37,488 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:37,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 17 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:57:37,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-01-08 23:57:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1606. [2025-01-08 23:57:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.1196261682242992) internal successors, (1797), 1605 states have internal predecessors, (1797), 0 states have call successors, (0), 0 states 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:57:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1797 transitions. [2025-01-08 23:57:37,516 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1797 transitions. Word has length 336 [2025-01-08 23:57:37,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:37,517 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1797 transitions. [2025-01-08 23:57:37,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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:57:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1797 transitions. [2025-01-08 23:57:37,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2025-01-08 23:57:37,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:37,521 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:37,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:57:37,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:37,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:37,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1101693416, now seen corresponding path program 1 times [2025-01-08 23:57:37,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:37,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098592162] [2025-01-08 23:57:37,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:37,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:37,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-08 23:57:37,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-08 23:57:37,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:37,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:37,912 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2025-01-08 23:57:37,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098592162] [2025-01-08 23:57:37,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098592162] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:37,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553108612] [2025-01-08 23:57:37,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:37,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:37,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:37,915 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:57:37,917 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:57:37,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 425 statements into 1 equivalence classes. [2025-01-08 23:57:38,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 425 of 425 statements. [2025-01-08 23:57:38,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:38,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:38,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:38,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:38,474 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2025-01-08 23:57:38,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:38,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553108612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:38,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:38,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 23:57:38,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113561151] [2025-01-08 23:57:38,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:38,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:38,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:38,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:38,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:57:38,476 INFO L87 Difference]: Start difference. First operand 1606 states and 1797 transitions. Second operand has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:57:38,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:38,857 INFO L93 Difference]: Finished difference Result 2320 states and 2566 transitions. [2025-01-08 23:57:38,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:38,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 425 [2025-01-08 23:57:38,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:38,863 INFO L225 Difference]: With dead ends: 2320 [2025-01-08 23:57:38,863 INFO L226 Difference]: Without dead ends: 2318 [2025-01-08 23:57:38,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:57:38,864 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:38,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 11 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:38,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2025-01-08 23:57:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 1428. [2025-01-08 23:57:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.0939032936229853) internal successors, (1561), 1427 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states 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:57:38,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1561 transitions. [2025-01-08 23:57:38,890 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1561 transitions. Word has length 425 [2025-01-08 23:57:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:38,890 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1561 transitions. [2025-01-08 23:57:38,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 0 states 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:57:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1561 transitions. [2025-01-08 23:57:38,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-08 23:57:38,909 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:38,910 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, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:38,916 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:57:39,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:39,114 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:39,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -941353718, now seen corresponding path program 1 times [2025-01-08 23:57:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358330344] [2025-01-08 23:57:39,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:39,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-08 23:57:39,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-08 23:57:39,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:39,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:57:39,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:39,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358330344] [2025-01-08 23:57:39,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358330344] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:39,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985255074] [2025-01-08 23:57:39,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:39,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:39,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:39,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:39,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:39,438 INFO L87 Difference]: Start difference. First operand 1428 states and 1561 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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:57:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:39,884 INFO L93 Difference]: Finished difference Result 3210 states and 3559 transitions. [2025-01-08 23:57:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 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 431 [2025-01-08 23:57:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:39,890 INFO L225 Difference]: With dead ends: 3210 [2025-01-08 23:57:39,890 INFO L226 Difference]: Without dead ends: 1962 [2025-01-08 23:57:39,891 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:57:39,892 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:39,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 245 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:39,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2025-01-08 23:57:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1606. [2025-01-08 23:57:39,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1606 states, 1605 states have (on average 1.0841121495327102) internal successors, (1740), 1605 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states 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:57:39,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1606 states to 1606 states and 1740 transitions. [2025-01-08 23:57:39,913 INFO L78 Accepts]: Start accepts. Automaton has 1606 states and 1740 transitions. Word has length 431 [2025-01-08 23:57:39,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:39,914 INFO L471 AbstractCegarLoop]: Abstraction has 1606 states and 1740 transitions. [2025-01-08 23:57:39,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states 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:57:39,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1606 states and 1740 transitions. [2025-01-08 23:57:39,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-01-08 23:57:39,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:39,917 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, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:39,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:57:39,918 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:39,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:39,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1755453354, now seen corresponding path program 1 times [2025-01-08 23:57:39,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:39,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515632744] [2025-01-08 23:57:39,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:39,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:39,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-01-08 23:57:39,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-01-08 23:57:39,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:39,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:40,242 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:57:40,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:40,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515632744] [2025-01-08 23:57:40,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515632744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:40,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:40,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:40,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984703871] [2025-01-08 23:57:40,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:40,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:40,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:40,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:40,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:40,245 INFO L87 Difference]: Start difference. First operand 1606 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:57:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:40,669 INFO L93 Difference]: Finished difference Result 3566 states and 3917 transitions. [2025-01-08 23:57:40,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:40,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 438 [2025-01-08 23:57:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:40,675 INFO L225 Difference]: With dead ends: 3566 [2025-01-08 23:57:40,675 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:57:40,677 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:57:40,677 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:40,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:57:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-01-08 23:57:40,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.0770015298317186) internal successors, (2112), 1961 states have internal predecessors, (2112), 0 states have call successors, (0), 0 states 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:57:40,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2112 transitions. [2025-01-08 23:57:40,703 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2112 transitions. Word has length 438 [2025-01-08 23:57:40,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:40,704 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2112 transitions. [2025-01-08 23:57:40,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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:57:40,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2112 transitions. [2025-01-08 23:57:40,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-01-08 23:57:40,709 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:40,709 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, 4, 4, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:40,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:57:40,709 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:40,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:40,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1379388280, now seen corresponding path program 1 times [2025-01-08 23:57:40,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:40,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123312309] [2025-01-08 23:57:40,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:40,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:40,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-01-08 23:57:40,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-01-08 23:57:40,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:40,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:41,361 INFO L134 CoverageAnalysis]: Checked inductivity of 691 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-08 23:57:41,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:41,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123312309] [2025-01-08 23:57:41,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123312309] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:41,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:41,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:41,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355352603] [2025-01-08 23:57:41,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:41,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:41,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:41,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:41,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:41,364 INFO L87 Difference]: Start difference. First operand 1962 states and 2112 transitions. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:57:41,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:41,727 INFO L93 Difference]: Finished difference Result 3922 states and 4225 transitions. [2025-01-08 23:57:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:41,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 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 483 [2025-01-08 23:57:41,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:41,734 INFO L225 Difference]: With dead ends: 3922 [2025-01-08 23:57:41,735 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:57:41,736 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:57:41,739 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:41,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 67 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:57:41,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:57:41,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 2140. [2025-01-08 23:57:41,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2140 states, 2139 states have (on average 1.0715287517531558) internal successors, (2292), 2139 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states 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:57:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2292 transitions. [2025-01-08 23:57:41,768 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2292 transitions. Word has length 483 [2025-01-08 23:57:41,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:41,769 INFO L471 AbstractCegarLoop]: Abstraction has 2140 states and 2292 transitions. [2025-01-08 23:57:41,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states 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:57:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2292 transitions. [2025-01-08 23:57:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-08 23:57:41,775 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:41,775 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, 5, 5, 5, 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, 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, 1] [2025-01-08 23:57:41,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:57:41,776 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:41,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:41,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1248621525, now seen corresponding path program 1 times [2025-01-08 23:57:41,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:41,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384168287] [2025-01-08 23:57:41,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:41,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:41,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-08 23:57:41,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-08 23:57:41,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:41,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2025-01-08 23:57:42,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:42,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384168287] [2025-01-08 23:57:42,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384168287] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:42,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:42,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:42,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626106100] [2025-01-08 23:57:42,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:42,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:42,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:42,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:42,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:42,080 INFO L87 Difference]: Start difference. First operand 2140 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:57:42,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:42,486 INFO L93 Difference]: Finished difference Result 4456 states and 4840 transitions. [2025-01-08 23:57:42,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:42,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 593 [2025-01-08 23:57:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:42,492 INFO L225 Difference]: With dead ends: 4456 [2025-01-08 23:57:42,492 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:57:42,494 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:57:42,494 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 110 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:42,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 241 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:57:42,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2025-01-08 23:57:42,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2495 states have (on average 1.0733466933867735) internal successors, (2678), 2495 states have internal predecessors, (2678), 0 states have call successors, (0), 0 states 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:57:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 2678 transitions. [2025-01-08 23:57:42,525 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 2678 transitions. Word has length 593 [2025-01-08 23:57:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:42,525 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 2678 transitions. [2025-01-08 23:57:42,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states 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:57:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 2678 transitions. [2025-01-08 23:57:42,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 612 [2025-01-08 23:57:42,532 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:42,532 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, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:42,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:57:42,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:42,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:42,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1794699960, now seen corresponding path program 1 times [2025-01-08 23:57:42,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:42,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629021379] [2025-01-08 23:57:42,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:42,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:42,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes. [2025-01-08 23:57:42,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements. [2025-01-08 23:57:42,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:42,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 769 proven. 0 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2025-01-08 23:57:42,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:42,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629021379] [2025-01-08 23:57:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629021379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:42,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:42,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245618180] [2025-01-08 23:57:42,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:42,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:42,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:42,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:42,834 INFO L87 Difference]: Start difference. First operand 2496 states and 2678 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:57:43,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:43,229 INFO L93 Difference]: Finished difference Result 5524 states and 5939 transitions. [2025-01-08 23:57:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:43,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 611 [2025-01-08 23:57:43,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:43,238 INFO L225 Difference]: With dead ends: 5524 [2025-01-08 23:57:43,238 INFO L226 Difference]: Without dead ends: 3208 [2025-01-08 23:57:43,242 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:57:43,242 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 7 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:43,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 65 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2025-01-08 23:57:43,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 3030. [2025-01-08 23:57:43,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 3029 states have (on average 1.067679102013866) internal successors, (3234), 3029 states have internal predecessors, (3234), 0 states have call successors, (0), 0 states 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:57:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3234 transitions. [2025-01-08 23:57:43,290 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3234 transitions. Word has length 611 [2025-01-08 23:57:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:43,290 INFO L471 AbstractCegarLoop]: Abstraction has 3030 states and 3234 transitions. [2025-01-08 23:57:43,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states 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:57:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3234 transitions. [2025-01-08 23:57:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2025-01-08 23:57:43,297 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:43,297 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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] [2025-01-08 23:57:43,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:57:43,297 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:43,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:43,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1711513909, now seen corresponding path program 1 times [2025-01-08 23:57:43,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:43,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844558618] [2025-01-08 23:57:43,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:43,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:43,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-01-08 23:57:43,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-01-08 23:57:43,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:43,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:43,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:57:43,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:43,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844558618] [2025-01-08 23:57:43,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844558618] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:43,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773172872] [2025-01-08 23:57:43,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:43,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:43,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:43,548 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:57:43,549 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:57:43,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes. [2025-01-08 23:57:43,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements. [2025-01-08 23:57:43,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:43,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:43,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:57:43,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:57:43,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:57:44,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1281 backedges. 857 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-01-08 23:57:44,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773172872] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:57:44,171 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:57:44,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-08 23:57:44,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658853542] [2025-01-08 23:57:44,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:57:44,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-08 23:57:44,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:44,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-08 23:57:44,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:44,174 INFO L87 Difference]: Start difference. First operand 3030 states and 3234 transitions. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:57:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:45,030 INFO L93 Difference]: Finished difference Result 7306 states and 7852 transitions. [2025-01-08 23:57:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 23:57:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 634 [2025-01-08 23:57:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:45,039 INFO L225 Difference]: With dead ends: 7306 [2025-01-08 23:57:45,039 INFO L226 Difference]: Without dead ends: 4456 [2025-01-08 23:57:45,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1270 GetRequests, 1266 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:45,042 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 201 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:45,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 64 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:57:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4456 states. [2025-01-08 23:57:45,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4456 to 3920. [2025-01-08 23:57:45,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3920 states, 3919 states have (on average 1.069915794845624) internal successors, (4193), 3919 states have internal predecessors, (4193), 0 states have call successors, (0), 0 states 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:57:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3920 states to 3920 states and 4193 transitions. [2025-01-08 23:57:45,087 INFO L78 Accepts]: Start accepts. Automaton has 3920 states and 4193 transitions. Word has length 634 [2025-01-08 23:57:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:45,090 INFO L471 AbstractCegarLoop]: Abstraction has 3920 states and 4193 transitions. [2025-01-08 23:57:45,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:57:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3920 states and 4193 transitions. [2025-01-08 23:57:45,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2025-01-08 23:57:45,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:45,095 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 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:57:45,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 23:57:45,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:45,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:45,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:45,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1534054259, now seen corresponding path program 1 times [2025-01-08 23:57:45,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:45,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331603264] [2025-01-08 23:57:45,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:45,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:45,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-01-08 23:57:45,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-01-08 23:57:45,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:45,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 755 proven. 258 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2025-01-08 23:57:46,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331603264] [2025-01-08 23:57:46,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331603264] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:46,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869447567] [2025-01-08 23:57:46,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:46,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:46,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:46,145 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:57:46,147 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:57:46,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 762 statements into 1 equivalence classes. [2025-01-08 23:57:46,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 762 of 762 statements. [2025-01-08 23:57:46,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:46,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:46,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:57:46,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1716 backedges. 601 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2025-01-08 23:57:46,998 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:46,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869447567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:46,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:46,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-01-08 23:57:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793308911] [2025-01-08 23:57:46,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:46,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:46,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:46,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:57:47,001 INFO L87 Difference]: Start difference. First operand 3920 states and 4193 transitions. Second operand has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:57:47,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:47,530 INFO L93 Difference]: Finished difference Result 7838 states and 8407 transitions. [2025-01-08 23:57:47,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:47,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 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 762 [2025-01-08 23:57:47,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:47,543 INFO L225 Difference]: With dead ends: 7838 [2025-01-08 23:57:47,543 INFO L226 Difference]: Without dead ends: 3920 [2025-01-08 23:57:47,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 761 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:57:47,548 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:47,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 49 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:57:47,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3920 states. [2025-01-08 23:57:47,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3920 to 3742. [2025-01-08 23:57:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3742 states, 3741 states have (on average 1.0601443464314355) internal successors, (3966), 3741 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states 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:57:47,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3742 states to 3742 states and 3966 transitions. [2025-01-08 23:57:47,607 INFO L78 Accepts]: Start accepts. Automaton has 3742 states and 3966 transitions. Word has length 762 [2025-01-08 23:57:47,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:47,608 INFO L471 AbstractCegarLoop]: Abstraction has 3742 states and 3966 transitions. [2025-01-08 23:57:47,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states 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:57:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3742 states and 3966 transitions. [2025-01-08 23:57:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2025-01-08 23:57:47,614 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:47,614 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:47,621 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:57:47,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-08 23:57:47,815 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:47,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1684093837, now seen corresponding path program 1 times [2025-01-08 23:57:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:47,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584736673] [2025-01-08 23:57:47,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:47,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:47,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-01-08 23:57:47,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-01-08 23:57:47,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:47,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:48,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 840 proven. 325 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2025-01-08 23:57:48,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584736673] [2025-01-08 23:57:48,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584736673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:48,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288766822] [2025-01-08 23:57:48,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:48,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:48,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:48,461 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:57:48,462 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:57:48,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 796 statements into 1 equivalence classes. [2025-01-08 23:57:48,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 796 of 796 statements. [2025-01-08 23:57:48,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:48,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:48,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 991 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:57:48,620 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 670 proven. 0 refuted. 0 times theorem prover too weak. 1490 trivial. 0 not checked. [2025-01-08 23:57:49,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:49,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288766822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:49,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:49,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-08 23:57:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317722298] [2025-01-08 23:57:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:49,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:49,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:49,123 INFO L87 Difference]: Start difference. First operand 3742 states and 3966 transitions. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:57:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:49,433 INFO L93 Difference]: Finished difference Result 8550 states and 9059 transitions. [2025-01-08 23:57:49,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:49,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 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 796 [2025-01-08 23:57:49,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:49,447 INFO L225 Difference]: With dead ends: 8550 [2025-01-08 23:57:49,447 INFO L226 Difference]: Without dead ends: 4988 [2025-01-08 23:57:49,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 800 GetRequests, 795 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:49,450 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:49,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 49 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:57:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4988 states. [2025-01-08 23:57:49,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4988 to 4098. [2025-01-08 23:57:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.061020258725897) internal successors, (4347), 4097 states have internal predecessors, (4347), 0 states have call successors, (0), 0 states 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:57:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 4347 transitions. [2025-01-08 23:57:49,483 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 4347 transitions. Word has length 796 [2025-01-08 23:57:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:49,483 INFO L471 AbstractCegarLoop]: Abstraction has 4098 states and 4347 transitions. [2025-01-08 23:57:49,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states 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:57:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 4347 transitions. [2025-01-08 23:57:49,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 802 [2025-01-08 23:57:49,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:49,488 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 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:57:49,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 23:57:49,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-08 23:57:49,689 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:49,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:49,690 INFO L85 PathProgramCache]: Analyzing trace with hash 624510713, now seen corresponding path program 1 times [2025-01-08 23:57:49,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:49,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103012413] [2025-01-08 23:57:49,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:49,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:49,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-01-08 23:57:49,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-01-08 23:57:49,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:49,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:50,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 1166 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-08 23:57:50,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103012413] [2025-01-08 23:57:50,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103012413] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:50,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836293815] [2025-01-08 23:57:50,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:50,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:50,635 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:57:50,636 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:57:50,696 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 801 statements into 1 equivalence classes. [2025-01-08 23:57:50,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 801 of 801 statements. [2025-01-08 23:57:50,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:50,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:50,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:57:50,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:51,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 879 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2025-01-08 23:57:51,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836293815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:51,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:51,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-08 23:57:51,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278270573] [2025-01-08 23:57:51,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:51,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:51,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:51,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:51,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:51,031 INFO L87 Difference]: Start difference. First operand 4098 states and 4347 transitions. Second operand has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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:57:51,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:51,621 INFO L93 Difference]: Finished difference Result 9262 states and 9838 transitions. [2025-01-08 23:57:51,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:51,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 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 801 [2025-01-08 23:57:51,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:51,629 INFO L225 Difference]: With dead ends: 9262 [2025-01-08 23:57:51,629 INFO L226 Difference]: Without dead ends: 5344 [2025-01-08 23:57:51,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 805 GetRequests, 800 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:51,632 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 211 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:51,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 50 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:57:51,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-01-08 23:57:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 4810. [2025-01-08 23:57:51,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4810 states, 4809 states have (on average 1.0603035974215014) internal successors, (5099), 4809 states have internal predecessors, (5099), 0 states have call successors, (0), 0 states 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:57:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 5099 transitions. [2025-01-08 23:57:51,669 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 5099 transitions. Word has length 801 [2025-01-08 23:57:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:51,670 INFO L471 AbstractCegarLoop]: Abstraction has 4810 states and 5099 transitions. [2025-01-08 23:57:51,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.5) internal successors, (334), 4 states have internal predecessors, (334), 0 states have call successors, (0), 0 states 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:57:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 5099 transitions. [2025-01-08 23:57:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 818 [2025-01-08 23:57:51,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:51,675 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:51,681 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:57:51,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-08 23:57:51,876 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:51,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash 244638118, now seen corresponding path program 1 times [2025-01-08 23:57:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290463084] [2025-01-08 23:57:51,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:51,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:51,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-01-08 23:57:51,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-01-08 23:57:51,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:51,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2186 backedges. 1264 proven. 325 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-01-08 23:57:52,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290463084] [2025-01-08 23:57:52,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290463084] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:52,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355869579] [2025-01-08 23:57:52,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:52,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:52,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:52,507 INFO L229 MonitoredProcess]: Starting monitored process 8 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:57:52,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 23:57:52,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 817 statements into 1 equivalence classes. [2025-01-08 23:57:52,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 817 of 817 statements. [2025-01-08 23:57:52,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:52,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:52,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:57:52,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:53,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2186 backedges. 1199 proven. 0 refuted. 0 times theorem prover too weak. 987 trivial. 0 not checked. [2025-01-08 23:57:53,437 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:53,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355869579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:53,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:53,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:57:53,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836100244] [2025-01-08 23:57:53,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:53,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:53,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:53,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:53,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:57:53,438 INFO L87 Difference]: Start difference. First operand 4810 states and 5099 transitions. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:57:53,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:53,875 INFO L93 Difference]: Finished difference Result 9974 states and 10595 transitions. [2025-01-08 23:57:53,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:53,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 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 817 [2025-01-08 23:57:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:53,883 INFO L225 Difference]: With dead ends: 9974 [2025-01-08 23:57:53,883 INFO L226 Difference]: Without dead ends: 5344 [2025-01-08 23:57:53,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 821 GetRequests, 815 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:57:53,887 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:53,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 45 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:53,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5344 states. [2025-01-08 23:57:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5344 to 5166. [2025-01-08 23:57:53,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5166 states, 5165 states have (on average 1.0621490803484994) internal successors, (5486), 5165 states have internal predecessors, (5486), 0 states have call successors, (0), 0 states 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:57:53,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5166 states to 5166 states and 5486 transitions. [2025-01-08 23:57:53,940 INFO L78 Accepts]: Start accepts. Automaton has 5166 states and 5486 transitions. Word has length 817 [2025-01-08 23:57:53,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:53,940 INFO L471 AbstractCegarLoop]: Abstraction has 5166 states and 5486 transitions. [2025-01-08 23:57:53,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states 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:57:53,941 INFO L276 IsEmpty]: Start isEmpty. Operand 5166 states and 5486 transitions. [2025-01-08 23:57:53,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2025-01-08 23:57:53,945 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:53,946 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:53,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 23:57:54,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:54,147 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:54,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:54,148 INFO L85 PathProgramCache]: Analyzing trace with hash 2039329760, now seen corresponding path program 1 times [2025-01-08 23:57:54,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:54,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871603101] [2025-01-08 23:57:54,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:54,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:54,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 834 statements into 1 equivalence classes. [2025-01-08 23:57:54,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 834 of 834 statements. [2025-01-08 23:57:54,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:54,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1202 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-08 23:57:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871603101] [2025-01-08 23:57:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871603101] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974843364] [2025-01-08 23:57:55,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:55,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:55,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:55,063 INFO L229 MonitoredProcess]: Starting monitored process 9 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:57:55,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 23:57:55,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 834 statements into 1 equivalence classes. [2025-01-08 23:57:55,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 834 of 834 statements. [2025-01-08 23:57:55,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:55,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:55,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-08 23:57:55,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:55,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1305 proven. 522 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2025-01-08 23:57:55,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:57:56,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2218 backedges. 1274 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2025-01-08 23:57:56,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974843364] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:56,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:57:56,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 6] total 10 [2025-01-08 23:57:56,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25691132] [2025-01-08 23:57:56,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:56,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:57:56,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:56,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:57:56,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:57:56,378 INFO L87 Difference]: Start difference. First operand 5166 states and 5486 transitions. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:57:56,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:56,798 INFO L93 Difference]: Finished difference Result 10686 states and 11363 transitions. [2025-01-08 23:57:56,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:56,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 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 834 [2025-01-08 23:57:56,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:56,804 INFO L225 Difference]: With dead ends: 10686 [2025-01-08 23:57:56,805 INFO L226 Difference]: Without dead ends: 5700 [2025-01-08 23:57:56,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1671 GetRequests, 1663 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-08 23:57:56,808 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 235 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:56,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 10 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:56,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5700 states. [2025-01-08 23:57:56,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5700 to 5344. [2025-01-08 23:57:56,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5344 states, 5343 states have (on average 1.063073179861501) internal successors, (5680), 5343 states have internal predecessors, (5680), 0 states have call successors, (0), 0 states 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:57:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5680 transitions. [2025-01-08 23:57:56,847 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5680 transitions. Word has length 834 [2025-01-08 23:57:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:56,847 INFO L471 AbstractCegarLoop]: Abstraction has 5344 states and 5680 transitions. [2025-01-08 23:57:56,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 0 states have call successors, (0), 0 states 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:57:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5680 transitions. [2025-01-08 23:57:56,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2025-01-08 23:57:56,854 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:56,854 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:56,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-08 23:57:57,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-08 23:57:57,055 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:57,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:57,056 INFO L85 PathProgramCache]: Analyzing trace with hash 131541164, now seen corresponding path program 1 times [2025-01-08 23:57:57,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:57,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909937613] [2025-01-08 23:57:57,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:57,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:57,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 979 statements into 1 equivalence classes. [2025-01-08 23:57:57,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 979 of 979 statements. [2025-01-08 23:57:57,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:57,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 3510 backedges. 1565 proven. 0 refuted. 0 times theorem prover too weak. 1945 trivial. 0 not checked. [2025-01-08 23:57:57,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:57,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909937613] [2025-01-08 23:57:57,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909937613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:57,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:57,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:57:57,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948596899] [2025-01-08 23:57:57,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:57,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:57:57,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:57,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:57:57,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:57,606 INFO L87 Difference]: Start difference. First operand 5344 states and 5680 transitions. Second operand has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:57:58,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:58,082 INFO L93 Difference]: Finished difference Result 10480 states and 11145 transitions. [2025-01-08 23:57:58,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 23:57:58,083 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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 979 [2025-01-08 23:57:58,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:58,090 INFO L225 Difference]: With dead ends: 10480 [2025-01-08 23:57:58,090 INFO L226 Difference]: Without dead ends: 5209 [2025-01-08 23:57:58,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:58,094 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:58,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 31 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:58,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5209 states. [2025-01-08 23:57:58,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5209 to 5031. [2025-01-08 23:57:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5031 states, 5030 states have (on average 1.0542743538767396) internal successors, (5303), 5030 states have internal predecessors, (5303), 0 states have call successors, (0), 0 states 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:57:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 5303 transitions. [2025-01-08 23:57:58,132 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 5303 transitions. Word has length 979 [2025-01-08 23:57:58,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:58,133 INFO L471 AbstractCegarLoop]: Abstraction has 5031 states and 5303 transitions. [2025-01-08 23:57:58,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:57:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 5303 transitions. [2025-01-08 23:57:58,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1098 [2025-01-08 23:57:58,141 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:58,141 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:57:58,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:57:58,141 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:58,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:58,142 INFO L85 PathProgramCache]: Analyzing trace with hash 169330994, now seen corresponding path program 1 times [2025-01-08 23:57:58,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:58,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565574605] [2025-01-08 23:57:58,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:58,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:58,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1097 statements into 1 equivalence classes. [2025-01-08 23:57:58,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1097 of 1097 statements. [2025-01-08 23:57:58,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:58,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 3702 backedges. 2414 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2025-01-08 23:57:58,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565574605] [2025-01-08 23:57:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565574605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:58,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:58,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:58,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164860338] [2025-01-08 23:57:58,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:58,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:58,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:58,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:58,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:58,735 INFO L87 Difference]: Start difference. First operand 5031 states and 5303 transitions. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:57:59,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:59,022 INFO L93 Difference]: Finished difference Result 10238 states and 10831 transitions. [2025-01-08 23:57:59,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:59,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 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 1097 [2025-01-08 23:57:59,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:59,029 INFO L225 Difference]: With dead ends: 10238 [2025-01-08 23:57:59,030 INFO L226 Difference]: Without dead ends: 5387 [2025-01-08 23:57:59,033 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:57:59,034 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:59,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 218 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:57:59,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5387 states. [2025-01-08 23:57:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5387 to 5031. [2025-01-08 23:57:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5031 states, 5030 states have (on average 1.052882703777336) internal successors, (5296), 5030 states have internal predecessors, (5296), 0 states have call successors, (0), 0 states 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:57:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 5296 transitions. [2025-01-08 23:57:59,069 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 5296 transitions. Word has length 1097 [2025-01-08 23:57:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:59,069 INFO L471 AbstractCegarLoop]: Abstraction has 5031 states and 5296 transitions. [2025-01-08 23:57:59,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states 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:57:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 5296 transitions. [2025-01-08 23:57:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1172 [2025-01-08 23:57:59,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:59,077 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:59,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:57:59,077 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:59,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:59,078 INFO L85 PathProgramCache]: Analyzing trace with hash -472865019, now seen corresponding path program 1 times [2025-01-08 23:57:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:59,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392162290] [2025-01-08 23:57:59,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:59,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1171 statements into 1 equivalence classes. [2025-01-08 23:57:59,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1171 of 1171 statements. [2025-01-08 23:57:59,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:59,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:59,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4025 backedges. 2023 proven. 95 refuted. 0 times theorem prover too weak. 1907 trivial. 0 not checked. [2025-01-08 23:57:59,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:59,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392162290] [2025-01-08 23:57:59,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392162290] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:59,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369989322] [2025-01-08 23:57:59,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:59,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:59,799 INFO L229 MonitoredProcess]: Starting monitored process 10 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:57:59,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 23:57:59,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1171 statements into 1 equivalence classes. [2025-01-08 23:58:00,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1171 of 1171 statements. [2025-01-08 23:58:00,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:00,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:00,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 1414 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:00,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:00,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4025 backedges. 386 proven. 0 refuted. 0 times theorem prover too weak. 3639 trivial. 0 not checked. [2025-01-08 23:58:00,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:00,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369989322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:00,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:00,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:00,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989753396] [2025-01-08 23:58:00,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:00,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:00,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:00,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:00,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:00,098 INFO L87 Difference]: Start difference. First operand 5031 states and 5296 transitions. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:58:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:00,361 INFO L93 Difference]: Finished difference Result 5923 states and 6206 transitions. [2025-01-08 23:58:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 1171 [2025-01-08 23:58:00,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:00,368 INFO L225 Difference]: With dead ends: 5923 [2025-01-08 23:58:00,369 INFO L226 Difference]: Without dead ends: 5921 [2025-01-08 23:58:00,370 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1174 GetRequests, 1170 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:00,370 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 157 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 409 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:00,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 11 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 409 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 23:58:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5921 states. [2025-01-08 23:58:00,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5921 to 5031. [2025-01-08 23:58:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5031 states, 5030 states have (on average 1.0526838966202783) internal successors, (5295), 5030 states have internal predecessors, (5295), 0 states have call successors, (0), 0 states 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:58:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5031 states to 5031 states and 5295 transitions. [2025-01-08 23:58:00,409 INFO L78 Accepts]: Start accepts. Automaton has 5031 states and 5295 transitions. Word has length 1171 [2025-01-08 23:58:00,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:00,410 INFO L471 AbstractCegarLoop]: Abstraction has 5031 states and 5295 transitions. [2025-01-08 23:58:00,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states 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:58:00,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5031 states and 5295 transitions. [2025-01-08 23:58:00,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1201 [2025-01-08 23:58:00,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:58:00,418 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:00,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 23:58:00,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:00,619 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:58:00,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:58:00,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1025480702, now seen corresponding path program 1 times [2025-01-08 23:58:00,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:58:00,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212799073] [2025-01-08 23:58:00,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:58:00,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1200 statements into 1 equivalence classes. [2025-01-08 23:58:00,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1200 of 1200 statements. [2025-01-08 23:58:00,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:00,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4233 backedges. 2226 proven. 95 refuted. 0 times theorem prover too weak. 1912 trivial. 0 not checked. [2025-01-08 23:58:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:58:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212799073] [2025-01-08 23:58:01,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212799073] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:58:01,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381902968] [2025-01-08 23:58:01,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:58:01,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:01,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:58:01,309 INFO L229 MonitoredProcess]: Starting monitored process 11 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:58:01,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 23:58:01,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1200 statements into 1 equivalence classes. [2025-01-08 23:58:01,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1200 of 1200 statements. [2025-01-08 23:58:01,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:58:01,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:58:01,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 1445 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:58:01,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:58:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4233 backedges. 1153 proven. 0 refuted. 0 times theorem prover too weak. 3080 trivial. 0 not checked. [2025-01-08 23:58:01,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:58:01,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381902968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:58:01,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:58:01,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:58:01,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323372932] [2025-01-08 23:58:01,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:58:01,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:58:01,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:58:01,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:58:01,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:01,614 INFO L87 Difference]: Start difference. First operand 5031 states and 5295 transitions. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:58:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:58:01,928 INFO L93 Difference]: Finished difference Result 10414 states and 10972 transitions. [2025-01-08 23:58:01,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:58:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 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 1200 [2025-01-08 23:58:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:58:01,929 INFO L225 Difference]: With dead ends: 10414 [2025-01-08 23:58:01,929 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:58:01,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1203 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:58:01,935 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 84 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:58:01,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 221 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:58:01,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:58:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:58:01,936 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:58:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:58:01,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1200 [2025-01-08 23:58:01,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:58:01,936 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:58:01,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states 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:58:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:58:01,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:58:01,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:58:01,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-01-08 23:58:02,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:58:02,142 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:58:02,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:58:02,753 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:58:02,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:58:02 BoogieIcfgContainer [2025-01-08 23:58:02,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:58:02,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:58:02,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:58:02,772 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:58:02,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:31" (3/4) ... [2025-01-08 23:58:02,775 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:58:02,792 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:58:02,795 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:58:02,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:58:02,796 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:58:02,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:58:02,907 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:58:02,907 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:58:02,908 INFO L158 Benchmark]: Toolchain (without parser) took 32462.70ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 110.0MB in the beginning and 96.5MB in the end (delta: 13.6MB). Peak memory consumption was 69.6MB. Max. memory is 16.1GB. [2025-01-08 23:58:02,908 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:58:02,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.01ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 78.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 23:58:02,908 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.85ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 68.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:02,909 INFO L158 Benchmark]: Boogie Preprocessor took 109.23ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 56.4MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:58:02,909 INFO L158 Benchmark]: RCFGBuilder took 966.87ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 68.8MB in the end (delta: -12.4MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:02,909 INFO L158 Benchmark]: TraceAbstraction took 30813.66ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 67.9MB in the beginning and 111.0MB in the end (delta: -43.1MB). Peak memory consumption was 221.8MB. Max. memory is 16.1GB. [2025-01-08 23:58:02,909 INFO L158 Benchmark]: Witness Printer took 135.63ms. Allocated memory is still 201.3MB. Free memory was 111.0MB in the beginning and 96.5MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:58:02,910 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.01ms. Allocated memory is still 142.6MB. Free memory was 110.0MB in the beginning and 78.1MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.85ms. Allocated memory is still 142.6MB. Free memory was 78.1MB in the beginning and 68.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 109.23ms. Allocated memory is still 142.6MB. Free memory was 68.9MB in the beginning and 56.4MB in the end (delta: 12.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 966.87ms. Allocated memory is still 142.6MB. Free memory was 56.4MB in the beginning and 68.8MB in the end (delta: -12.4MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30813.66ms. Allocated memory was 142.6MB in the beginning and 201.3MB in the end (delta: 58.7MB). Free memory was 67.9MB in the beginning and 111.0MB in the end (delta: -43.1MB). Peak memory consumption was 221.8MB. Max. memory is 16.1GB. * Witness Printer took 135.63ms. Allocated memory is still 201.3MB. Free memory was 111.0MB in the beginning and 96.5MB in the end (delta: 14.5MB). Peak memory consumption was 8.4MB. 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: 149]: 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, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.1s, OverallIterations: 21, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2474 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2474 mSDsluCounter, 2073 SdHoareTripleChecker+Invalid, 7.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 1442 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12817 IncrementalHoareTripleChecker+Invalid, 14259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1442 mSolverCounterUnsat, 1921 mSDtfsCounter, 12817 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9196 GetRequests, 9126 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5344occurred in iteration=17, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 6054 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 20669 NumberOfCodeBlocks, 20669 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 22104 ConstructedInterpolants, 115 QuantifiedInterpolants, 74177 SizeOfPredicates, 1 NumberOfNonLiveVariables, 9486 ConjunctsInSsa, 33 ConjunctsInUnsatCore, 33 InterpolantComputations, 20 PerfectInterpolantSequences, 54507/56808 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: 890]: Loop Invariant Derived loop invariant: ((((((((((((a21 == 8) && (a24 == 1)) && (8 <= a15)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 545667)) || ((((a24 == 1) && (7 == a21)) && (a15 <= 8)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 545667))) || ((((a12 <= 80) && (a24 == 1)) && (a15 <= 8)) && ((a21 != 6) || (a15 == 8)))) || ((((a24 == 1) && (81 <= a12)) && (8 <= a15)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 545667))) || (((((a24 == 1) && (5 == a15)) && (a21 == 6)) && (81 <= a12)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 545667))) || (((a12 <= 11) && (9 <= a21)) && (a24 == 1))) || ((((6 <= a15) && (a24 == 1)) && (a15 <= 8)) && (((((long long) a12 * 9) >= 0) ? (((long long) a12 * 9) / 10) : ((((long long) a12 * 9) / 10) - 1)) <= 545667))) || ((((a12 <= 73282) && (a24 == 1)) && ((a21 != 6) || (a15 == 8))) && (81 <= a12))) || (((a12 <= 11) && (a15 <= 8)) && (a21 <= 6))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:58:02,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE