./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/Problem01_label14.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 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:42:43,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:42:43,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:42:43,346 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:42:43,346 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:42:43,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:42:43,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:42:43,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:42:43,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:42:43,372 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:42:43,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:42:43,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:42:43,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:42:43,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:42:43,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:42:43,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:42:43,375 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:42:43,375 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:42:43,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:42:43,375 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:42:43,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:42:43,375 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:42:43,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:42:43,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:42:43,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:42:43,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:42:43,376 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 -> 250149b8db46a8cfd93cca5c9e51a3336d18e5ed9ae8a2faf72fd582a53985cf [2025-02-05 10:42:43,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:42:43,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:42:43,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:42:43,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:42:43,724 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:42:43,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2025-02-05 10:42:44,919 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/999038f1d/636556d60afb4100afa29f8833e23afd/FLAG5706acf32 [2025-02-05 10:42:45,205 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:42:45,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2025-02-05 10:42:45,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/999038f1d/636556d60afb4100afa29f8833e23afd/FLAG5706acf32 [2025-02-05 10:42:45,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/999038f1d/636556d60afb4100afa29f8833e23afd [2025-02-05 10:42:45,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:42:45,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:42:45,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:42:45,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:42:45,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:42:45,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:45,497 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109986f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45, skipping insertion in model container [2025-02-05 10:42:45,498 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:45,521 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:42:45,837 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/Problem01_label14.c[21834,21847] [2025-02-05 10:42:45,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:42:45,874 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:42:45,946 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label14.c[21834,21847] [2025-02-05 10:42:45,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:42:45,962 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:42:45,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45 WrapperNode [2025-02-05 10:42:45,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:42:45,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:42:45,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:42:45,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:42:45,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:45,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,023 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-02-05 10:42:46,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:42:46,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:42:46,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:42:46,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:42:46,038 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,041 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,065 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-02-05 10:42:46,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,082 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,083 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:42:46,086 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:42:46,087 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:42:46,087 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:42:46,087 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (1/1) ... [2025-02-05 10:42:46,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:42:46,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:42:46,115 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-02-05 10:42:46,118 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-02-05 10:42:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:42:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:42:46,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:42:46,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:42:46,191 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:42:46,192 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:42:46,899 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-02-05 10:42:46,899 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:42:46,908 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:42:46,908 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:42:46,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:46 BoogieIcfgContainer [2025-02-05 10:42:46,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:42:46,910 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:42:46,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:42:46,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:42:46,913 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:42:45" (1/3) ... [2025-02-05 10:42:46,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1d528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:42:46, skipping insertion in model container [2025-02-05 10:42:46,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:42:45" (2/3) ... [2025-02-05 10:42:46,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1d528f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:42:46, skipping insertion in model container [2025-02-05 10:42:46,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:46" (3/3) ... [2025-02-05 10:42:46,915 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2025-02-05 10:42:46,924 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:42:46,925 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label14.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:42:46,960 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:42:46,968 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;@4370c746, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:42:46,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:42:46,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:46,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-02-05 10:42:46,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:46,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:42:46,983 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:46,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:46,986 INFO L85 PathProgramCache]: Analyzing trace with hash 482736741, now seen corresponding path program 1 times [2025-02-05 10:42:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588072412] [2025-02-05 10:42:46,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:46,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:47,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-02-05 10:42:47,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-02-05 10:42:47,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:47,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:47,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:42:47,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:47,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588072412] [2025-02-05 10:42:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588072412] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:42:47,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595433063] [2025-02-05 10:42:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:47,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:42:47,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:47,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:42:47,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:42:47,850 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 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 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:48,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:48,738 INFO L93 Difference]: Finished difference Result 662 states and 1174 transitions. [2025-02-05 10:42:48,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:42:48,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2025-02-05 10:42:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:48,747 INFO L225 Difference]: With dead ends: 662 [2025-02-05 10:42:48,747 INFO L226 Difference]: Without dead ends: 397 [2025-02-05 10:42:48,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:42:48,751 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 200 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:48,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 68 Invalid, 1149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-05 10:42:48,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-02-05 10:42:48,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-02-05 10:42:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.3207070707070707) internal successors, (523), 396 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:48,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 523 transitions. [2025-02-05 10:42:48,792 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 523 transitions. Word has length 131 [2025-02-05 10:42:48,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:48,792 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 523 transitions. [2025-02-05 10:42:48,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 523 transitions. [2025-02-05 10:42:48,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 10:42:48,795 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:48,795 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:48,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:42:48,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:48,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:48,797 INFO L85 PathProgramCache]: Analyzing trace with hash 302612710, now seen corresponding path program 1 times [2025-02-05 10:42:48,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:48,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739235385] [2025-02-05 10:42:48,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:48,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:48,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 10:42:48,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 10:42:48,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:48,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:49,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:42:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:49,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739235385] [2025-02-05 10:42:49,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739235385] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:49,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358311419] [2025-02-05 10:42:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:49,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:49,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:49,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:49,117 INFO L87 Difference]: Start difference. First operand 397 states and 523 transitions. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:49,602 INFO L93 Difference]: Finished difference Result 1018 states and 1451 transitions. [2025-02-05 10:42:49,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:49,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 138 [2025-02-05 10:42:49,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:49,605 INFO L225 Difference]: With dead ends: 1018 [2025-02-05 10:42:49,605 INFO L226 Difference]: Without dead ends: 659 [2025-02-05 10:42:49,606 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-02-05 10:42:49,606 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:49,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 81 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:42:49,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2025-02-05 10:42:49,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 397. [2025-02-05 10:42:49,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 396 states have (on average 1.22979797979798) internal successors, (487), 396 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 487 transitions. [2025-02-05 10:42:49,619 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 487 transitions. Word has length 138 [2025-02-05 10:42:49,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:49,619 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 487 transitions. [2025-02-05 10:42:49,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:49,619 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 487 transitions. [2025-02-05 10:42:49,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-02-05 10:42:49,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:49,621 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:49,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:42:49,621 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:49,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash 724253976, now seen corresponding path program 1 times [2025-02-05 10:42:49,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:49,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093920593] [2025-02-05 10:42:49,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:49,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:49,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-02-05 10:42:49,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-02-05 10:42:49,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:49,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:42:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:49,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093920593] [2025-02-05 10:42:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093920593] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120118274] [2025-02-05 10:42:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:49,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:49,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:49,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:49,757 INFO L87 Difference]: Start difference. First operand 397 states and 487 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:50,195 INFO L93 Difference]: Finished difference Result 1316 states and 1672 transitions. [2025-02-05 10:42:50,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:50,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-02-05 10:42:50,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:50,198 INFO L225 Difference]: With dead ends: 1316 [2025-02-05 10:42:50,198 INFO L226 Difference]: Without dead ends: 921 [2025-02-05 10:42:50,199 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-02-05 10:42:50,200 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 374 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:50,200 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 51 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:50,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-02-05 10:42:50,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 659. [2025-02-05 10:42:50,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 1.2112462006079028) internal successors, (797), 658 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 797 transitions. [2025-02-05 10:42:50,215 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 797 transitions. Word has length 148 [2025-02-05 10:42:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:50,215 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 797 transitions. [2025-02-05 10:42:50,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 797 transitions. [2025-02-05 10:42:50,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 10:42:50,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:50,218 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:42:50,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:42:50,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:50,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1502043380, now seen corresponding path program 1 times [2025-02-05 10:42:50,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:50,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984540439] [2025-02-05 10:42:50,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:50,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:50,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 10:42:50,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 10:42:50,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:50,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:50,300 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:42:50,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:50,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984540439] [2025-02-05 10:42:50,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984540439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:50,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:50,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:50,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567752290] [2025-02-05 10:42:50,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:50,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:50,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:50,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:50,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:50,302 INFO L87 Difference]: Start difference. First operand 659 states and 797 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:50,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:50,577 INFO L93 Difference]: Finished difference Result 1709 states and 2041 transitions. [2025-02-05 10:42:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:50,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 157 [2025-02-05 10:42:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:50,580 INFO L225 Difference]: With dead ends: 1709 [2025-02-05 10:42:50,580 INFO L226 Difference]: Without dead ends: 1052 [2025-02-05 10:42:50,581 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-02-05 10:42:50,582 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 130 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:50,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 41 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:42:50,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-02-05 10:42:50,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2025-02-05 10:42:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2043478260869565) internal successors, (1108), 920 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1108 transitions. [2025-02-05 10:42:50,615 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1108 transitions. Word has length 157 [2025-02-05 10:42:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:50,615 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1108 transitions. [2025-02-05 10:42:50,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1108 transitions. [2025-02-05 10:42:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 10:42:50,618 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:50,618 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:42:50,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:42:50,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:50,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:50,619 INFO L85 PathProgramCache]: Analyzing trace with hash -761350083, now seen corresponding path program 1 times [2025-02-05 10:42:50,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:50,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804517355] [2025-02-05 10:42:50,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:50,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:50,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 10:42:50,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 10:42:50,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:50,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:50,773 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:42:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804517355] [2025-02-05 10:42:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804517355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:50,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:50,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:50,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694051637] [2025-02-05 10:42:50,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:50,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:50,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:50,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:50,774 INFO L87 Difference]: Start difference. First operand 921 states and 1108 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:51,177 INFO L93 Difference]: Finished difference Result 2233 states and 2656 transitions. [2025-02-05 10:42:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 163 [2025-02-05 10:42:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:51,181 INFO L225 Difference]: With dead ends: 2233 [2025-02-05 10:42:51,181 INFO L226 Difference]: Without dead ends: 1314 [2025-02-05 10:42:51,182 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-02-05 10:42:51,182 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 370 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:51,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 56 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:51,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-02-05 10:42:51,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183. [2025-02-05 10:42:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1776649746192893) internal successors, (1392), 1182 states have internal predecessors, (1392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:51,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1392 transitions. [2025-02-05 10:42:51,200 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1392 transitions. Word has length 163 [2025-02-05 10:42:51,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:51,200 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1392 transitions. [2025-02-05 10:42:51,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:51,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1392 transitions. [2025-02-05 10:42:51,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-02-05 10:42:51,202 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:51,202 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:42:51,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:42:51,202 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:51,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:51,203 INFO L85 PathProgramCache]: Analyzing trace with hash 263578665, now seen corresponding path program 1 times [2025-02-05 10:42:51,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:51,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311362142] [2025-02-05 10:42:51,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:51,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:51,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-02-05 10:42:51,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-02-05 10:42:51,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:51,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:51,336 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:42:51,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:51,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311362142] [2025-02-05 10:42:51,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311362142] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:51,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:51,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210325824] [2025-02-05 10:42:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:51,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:42:51,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:51,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:42:51,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:42:51,338 INFO L87 Difference]: Start difference. First operand 1183 states and 1392 transitions. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:51,758 INFO L93 Difference]: Finished difference Result 3281 states and 3988 transitions. [2025-02-05 10:42:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:42:51,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 181 [2025-02-05 10:42:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:51,763 INFO L225 Difference]: With dead ends: 3281 [2025-02-05 10:42:51,764 INFO L226 Difference]: Without dead ends: 2100 [2025-02-05 10:42:51,765 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-02-05 10:42:51,765 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 314 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:51,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 56 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:42:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2025-02-05 10:42:51,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1707. [2025-02-05 10:42:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.1670574443141852) internal successors, (1991), 1706 states have internal predecessors, (1991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:51,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1991 transitions. [2025-02-05 10:42:51,790 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1991 transitions. Word has length 181 [2025-02-05 10:42:51,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:51,790 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 1991 transitions. [2025-02-05 10:42:51,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:51,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1991 transitions. [2025-02-05 10:42:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-05 10:42:51,793 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:51,793 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:51,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:42:51,793 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:51,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash 674055505, now seen corresponding path program 1 times [2025-02-05 10:42:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432712183] [2025-02-05 10:42:51,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:51,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:51,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-05 10:42:51,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-05 10:42:51,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:51,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 10:42:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432712183] [2025-02-05 10:42:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432712183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803787980] [2025-02-05 10:42:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:51,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:51,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:51,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:51,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:51,914 INFO L87 Difference]: Start difference. First operand 1707 states and 1991 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:52,213 INFO L93 Difference]: Finished difference Result 3674 states and 4328 transitions. [2025-02-05 10:42:52,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:52,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 197 [2025-02-05 10:42:52,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:52,218 INFO L225 Difference]: With dead ends: 3674 [2025-02-05 10:42:52,219 INFO L226 Difference]: Without dead ends: 1969 [2025-02-05 10:42:52,220 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-02-05 10:42:52,221 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:52,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:42:52,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-02-05 10:42:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2025-02-05 10:42:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.160569105691057) internal successors, (2284), 1968 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2284 transitions. [2025-02-05 10:42:52,248 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2284 transitions. Word has length 197 [2025-02-05 10:42:52,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:52,248 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2284 transitions. [2025-02-05 10:42:52,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2284 transitions. [2025-02-05 10:42:52,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-02-05 10:42:52,252 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:52,252 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:42:52,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:42:52,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:52,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1612567391, now seen corresponding path program 1 times [2025-02-05 10:42:52,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:52,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308430451] [2025-02-05 10:42:52,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:52,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:52,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-02-05 10:42:52,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-02-05 10:42:52,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:52,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 10:42:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:52,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308430451] [2025-02-05 10:42:52,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308430451] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:52,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:52,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:52,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149781174] [2025-02-05 10:42:52,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:52,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:52,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:52,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:52,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:52,407 INFO L87 Difference]: Start difference. First operand 1969 states and 2284 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:52,682 INFO L93 Difference]: Finished difference Result 4198 states and 4838 transitions. [2025-02-05 10:42:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 213 [2025-02-05 10:42:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:52,687 INFO L225 Difference]: With dead ends: 4198 [2025-02-05 10:42:52,687 INFO L226 Difference]: Without dead ends: 2231 [2025-02-05 10:42:52,689 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-02-05 10:42:52,690 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:52,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 42 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:42:52,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-02-05 10:42:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2025-02-05 10:42:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1544715447154472) internal successors, (2272), 1968 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:52,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2272 transitions. [2025-02-05 10:42:52,717 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2272 transitions. Word has length 213 [2025-02-05 10:42:52,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:52,718 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2272 transitions. [2025-02-05 10:42:52,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:52,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2272 transitions. [2025-02-05 10:42:52,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2025-02-05 10:42:52,722 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:52,722 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:52,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:42:52,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:52,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:52,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1676340258, now seen corresponding path program 1 times [2025-02-05 10:42:52,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:52,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217926424] [2025-02-05 10:42:52,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:52,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:52,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 10:42:52,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 10:42:52,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:52,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 185 proven. 88 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 10:42:53,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:53,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217926424] [2025-02-05 10:42:53,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217926424] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:42:53,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193145344] [2025-02-05 10:42:53,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:53,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:42:53,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:42:53,104 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-02-05 10:42:53,106 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-02-05 10:42:53,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 278 statements into 1 equivalence classes. [2025-02-05 10:42:53,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 278 of 278 statements. [2025-02-05 10:42:53,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:53,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:53,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:42:53,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:42:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-05 10:42:53,402 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:42:53,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193145344] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:53,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:42:53,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 10:42:53,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005410402] [2025-02-05 10:42:53,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:53,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:53,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:53,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:53,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:42:53,405 INFO L87 Difference]: Start difference. First operand 1969 states and 2272 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:53,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:53,696 INFO L93 Difference]: Finished difference Result 3936 states and 4542 transitions. [2025-02-05 10:42:53,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:53,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 278 [2025-02-05 10:42:53,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:53,701 INFO L225 Difference]: With dead ends: 3936 [2025-02-05 10:42:53,702 INFO L226 Difference]: Without dead ends: 1969 [2025-02-05 10:42:53,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 278 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-02-05 10:42:53,704 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 15 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:53,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 164 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:42:53,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-02-05 10:42:53,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2025-02-05 10:42:53,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1968 states have (on average 1.1209349593495934) internal successors, (2206), 1968 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:53,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2206 transitions. [2025-02-05 10:42:53,731 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2206 transitions. Word has length 278 [2025-02-05 10:42:53,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:53,731 INFO L471 AbstractCegarLoop]: Abstraction has 1969 states and 2206 transitions. [2025-02-05 10:42:53,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:53,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2206 transitions. [2025-02-05 10:42:53,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-02-05 10:42:53,735 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:53,735 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:53,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:42:53,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:42:53,936 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:53,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash 729403884, now seen corresponding path program 1 times [2025-02-05 10:42:53,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:53,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821284851] [2025-02-05 10:42:53,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:53,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-02-05 10:42:53,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-02-05 10:42:53,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:53,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:54,135 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 168 proven. 92 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 10:42:54,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821284851] [2025-02-05 10:42:54,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821284851] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:42:54,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723175164] [2025-02-05 10:42:54,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:54,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:42:54,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:42:54,140 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-02-05 10:42:54,144 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-02-05 10:42:54,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-02-05 10:42:54,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-02-05 10:42:54,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:54,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:54,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:42:54,281 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:42:54,562 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-02-05 10:42:54,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:42:54,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723175164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:54,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:42:54,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:42:54,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102960129] [2025-02-05 10:42:54,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:54,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:54,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:54,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:54,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:42:54,564 INFO L87 Difference]: Start difference. First operand 1969 states and 2206 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:55,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:55,126 INFO L93 Difference]: Finished difference Result 4329 states and 4887 transitions. [2025-02-05 10:42:55,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:55,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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 282 [2025-02-05 10:42:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:55,132 INFO L225 Difference]: With dead ends: 4329 [2025-02-05 10:42:55,132 INFO L226 Difference]: Without dead ends: 2362 [2025-02-05 10:42:55,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 283 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-02-05 10:42:55,135 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 8 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:55,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 179 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:42:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-02-05 10:42:55,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2231. [2025-02-05 10:42:55,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.12152466367713) internal successors, (2501), 2230 states have internal predecessors, (2501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:55,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2501 transitions. [2025-02-05 10:42:55,161 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2501 transitions. Word has length 282 [2025-02-05 10:42:55,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:55,162 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2501 transitions. [2025-02-05 10:42:55,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:55,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2501 transitions. [2025-02-05 10:42:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2025-02-05 10:42:55,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:55,165 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:42:55,175 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-02-05 10:42:55,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:42:55,371 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:55,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:55,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1055759217, now seen corresponding path program 1 times [2025-02-05 10:42:55,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:55,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058906111] [2025-02-05 10:42:55,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:55,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:55,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 10:42:55,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 10:42:55,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:55,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 273 proven. 64 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 10:42:55,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:55,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058906111] [2025-02-05 10:42:55,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058906111] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:42:55,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227817839] [2025-02-05 10:42:55,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:55,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:42:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:42:55,549 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-02-05 10:42:55,550 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-02-05 10:42:55,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 301 statements into 1 equivalence classes. [2025-02-05 10:42:55,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 301 of 301 statements. [2025-02-05 10:42:55,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:55,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:55,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:42:55,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:42:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-02-05 10:42:55,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:42:55,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227817839] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:55,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:42:55,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:42:55,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932140009] [2025-02-05 10:42:55,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:55,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:55,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:55,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:55,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:42:55,717 INFO L87 Difference]: Start difference. First operand 2231 states and 2501 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-02-05 10:42:56,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:56,013 INFO L93 Difference]: Finished difference Result 4722 states and 5317 transitions. [2025-02-05 10:42:56,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:56,013 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 301 [2025-02-05 10:42:56,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:56,019 INFO L225 Difference]: With dead ends: 4722 [2025-02-05 10:42:56,020 INFO L226 Difference]: Without dead ends: 1838 [2025-02-05 10:42:56,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:42:56,024 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 113 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:56,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 163 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:42:56,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-02-05 10:42:56,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1576. [2025-02-05 10:42:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.0914285714285714) internal successors, (1719), 1575 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1719 transitions. [2025-02-05 10:42:56,046 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1719 transitions. Word has length 301 [2025-02-05 10:42:56,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:56,046 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1719 transitions. [2025-02-05 10:42:56,046 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-02-05 10:42:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1719 transitions. [2025-02-05 10:42:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-02-05 10:42:56,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:56,050 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:56,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 10:42:56,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:42:56,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:56,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 765691611, now seen corresponding path program 1 times [2025-02-05 10:42:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442551084] [2025-02-05 10:42:56,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:56,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:56,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-05 10:42:56,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-05 10:42:56,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:56,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-02-05 10:42:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442551084] [2025-02-05 10:42:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442551084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:56,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649505194] [2025-02-05 10:42:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:56,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:56,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:56,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:56,391 INFO L87 Difference]: Start difference. First operand 1576 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:56,678 INFO L93 Difference]: Finished difference Result 3543 states and 3843 transitions. [2025-02-05 10:42:56,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:56,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 312 [2025-02-05 10:42:56,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:56,683 INFO L225 Difference]: With dead ends: 3543 [2025-02-05 10:42:56,683 INFO L226 Difference]: Without dead ends: 1969 [2025-02-05 10:42:56,684 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-02-05 10:42:56,685 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:56,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 29 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:42:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-02-05 10:42:56,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1576. [2025-02-05 10:42:56,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1575 states have (on average 1.0914285714285714) internal successors, (1719), 1575 states have internal predecessors, (1719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:56,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1719 transitions. [2025-02-05 10:42:56,703 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1719 transitions. Word has length 312 [2025-02-05 10:42:56,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:56,703 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 1719 transitions. [2025-02-05 10:42:56,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:56,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1719 transitions. [2025-02-05 10:42:56,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 10:42:56,706 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:42:56,707 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:42:56,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:42:56,708 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:42:56,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:42:56,708 INFO L85 PathProgramCache]: Analyzing trace with hash 2133258235, now seen corresponding path program 1 times [2025-02-05 10:42:56,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:42:56,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807633317] [2025-02-05 10:42:56,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:42:56,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:42:56,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 10:42:56,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 10:42:56,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:42:56,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:42:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 305 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-02-05 10:42:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:42:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807633317] [2025-02-05 10:42:56,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807633317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:42:56,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:42:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:42:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910718360] [2025-02-05 10:42:56,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:42:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:42:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:42:56,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:42:56,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:42:56,818 INFO L87 Difference]: Start difference. First operand 1576 states and 1719 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:57,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:42:57,066 INFO L93 Difference]: Finished difference Result 3148 states and 3394 transitions. [2025-02-05 10:42:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:42:57,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 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 315 [2025-02-05 10:42:57,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:42:57,067 INFO L225 Difference]: With dead ends: 3148 [2025-02-05 10:42:57,067 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:42:57,069 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-02-05 10:42:57,069 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 122 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:42:57,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 26 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:42:57,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:42:57,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:42:57,070 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-02-05 10:42:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:42:57,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 315 [2025-02-05 10:42:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:42:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:42:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:42:57,071 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:42:57,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:42:57,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:42:57,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 10:42:57,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:42:57,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:42:57,661 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:42:57,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:42:57 BoogieIcfgContainer [2025-02-05 10:42:57,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:42:57,675 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:42:57,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:42:57,676 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:42:57,676 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:42:46" (3/4) ... [2025-02-05 10:42:57,677 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:42:57,691 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:42:57,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:42:57,694 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:42:57,695 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:42:57,790 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:42:57,791 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:42:57,791 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:42:57,791 INFO L158 Benchmark]: Toolchain (without parser) took 12299.52ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 112.2MB in the beginning and 305.2MB in the end (delta: -193.0MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2025-02-05 10:42:57,791 INFO L158 Benchmark]: CDTParser took 0.54ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:42:57,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.68ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 85.1MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:42:57,792 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.61ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 80.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:42:57,792 INFO L158 Benchmark]: Boogie Preprocessor took 58.93ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 75.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:42:57,792 INFO L158 Benchmark]: IcfgBuilder took 822.46ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 60.8MB in the end (delta: 14.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-02-05 10:42:57,792 INFO L158 Benchmark]: TraceAbstraction took 10764.66ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.1MB in the beginning and 317.7MB in the end (delta: -257.6MB). Peak memory consumption was 202.3MB. Max. memory is 16.1GB. [2025-02-05 10:42:57,793 INFO L158 Benchmark]: Witness Printer took 115.30ms. Allocated memory is still 419.4MB. Free memory was 317.7MB in the beginning and 305.2MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:42:57,794 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.54ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.68ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 85.1MB in the end (delta: 27.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.61ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 80.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.93ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 75.5MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 822.46ms. Allocated memory is still 142.6MB. Free memory was 75.5MB in the beginning and 60.8MB in the end (delta: 14.7MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10764.66ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 60.1MB in the beginning and 317.7MB in the end (delta: -257.6MB). Peak memory consumption was 202.3MB. Max. memory is 16.1GB. * Witness Printer took 115.30ms. Allocated memory is still 419.4MB. Free memory was 317.7MB in the beginning and 305.2MB in the end (delta: 12.4MB). 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: 579]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 13, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2013 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2013 mSDsluCounter, 987 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 880 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5266 IncrementalHoareTripleChecker+Invalid, 6146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 880 mSolverCounterUnsat, 886 mSDtfsCounter, 5266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 905 GetRequests, 878 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=10, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 2227 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3677 NumberOfCodeBlocks, 3677 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3661 ConstructedInterpolants, 0 QuantifiedInterpolants, 12448 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1497 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 3093/3337 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: 593]: Location Invariant Derived location invariant: (((((((((((((a7 != 1) && (a17 <= 0)) && (a20 == 1)) || ((((a17 <= 0) && (14 <= a8)) && (a20 == 1)) && (a16 != 4))) || (((((a20 <= 0) && (a17 == 1)) && (a16 <= 5)) || (((a20 <= 0) && (a17 <= 0)) && (a16 <= 5))) && (14 <= a8))) || ((((a20 <= 0) && (a7 != 1)) && (a17 <= 0)) && (15 <= a8))) || ((a21 <= 0) && (a20 == 1))) || ((((a20 <= 0) && (a21 <= 0)) && (a17 == 1)) && (a16 <= 5))) || ((((((a12 == 8) && (a8 == 13)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1)) && (a16 == 4))) || ((((a20 <= 0) && (a7 != 1)) && (a17 == 1)) && (15 <= a8))) || ((((a20 <= 0) && (a7 != 1)) && (a17 <= 0)) && (a16 <= 5))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || ((((a20 <= 0) && (a7 != 1)) && (a17 == 1)) && (a16 <= 5))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:42:57,810 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