./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.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/bitvector/soft_float_4-3a.c.cil.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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:38:38,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:38:38,472 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:38:38,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:38:38,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:38:38,493 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:38:38,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:38:38,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:38:38,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:38:38,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:38:38,494 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:38:38,494 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:38:38,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:38:38,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:38:38,494 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:38:38,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:38:38,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:38:38,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:38:38,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:38:38,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:38:38,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:38:38,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:38:38,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:38:38,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:38,497 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:38:38,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:38:38,497 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:38:38,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:38:38,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:38:38,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:38:38,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:38:38,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:38:38,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:38:38,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:38:38,498 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2025-02-05 10:38:38,734 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:38:38,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:38:38,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:38:38,746 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:38:38,746 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:38:38,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-02-05 10:38:39,909 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/216ec59dc/54b2a8105d91448b83ef09279cb458c4/FLAG5aa5cefcd [2025-02-05 10:38:40,134 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:38:40,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-02-05 10:38:40,140 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/216ec59dc/54b2a8105d91448b83ef09279cb458c4/FLAG5aa5cefcd [2025-02-05 10:38:40,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/216ec59dc/54b2a8105d91448b83ef09279cb458c4 [2025-02-05 10:38:40,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:38:40,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:38:40,480 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:40,480 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:38:40,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:38:40,483 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397e8066 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40, skipping insertion in model container [2025-02-05 10:38:40,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,499 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:38:40,594 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-02-05 10:38:40,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:40,636 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:38:40,642 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-02-05 10:38:40,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:38:40,666 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:38:40,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40 WrapperNode [2025-02-05 10:38:40,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:38:40,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:40,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:38:40,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:38:40,672 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:38:40" (1/1) ... [2025-02-05 10:38:40,677 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:38:40" (1/1) ... [2025-02-05 10:38:40,688 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 56 [2025-02-05 10:38:40,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:38:40,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:38:40,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:38:40,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:38:40,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,703 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:38:40,704 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,704 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,707 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,709 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,710 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:38:40,710 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:38:40,710 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:38:40,710 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:38:40,711 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (1/1) ... [2025-02-05 10:38:40,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:38:40,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:40,736 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:38:40,738 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:38:40,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:38:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:38:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-05 10:38:40,753 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-05 10:38:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:38:40,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:38:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-02-05 10:38:40,753 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-02-05 10:38:40,753 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 10:38:40,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 10:38:40,793 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:38:40,795 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:38:41,052 INFO L? ?]: Removed 53 outVars from TransFormulas that were not future-live. [2025-02-05 10:38:41,053 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:38:41,083 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:38:41,085 INFO L337 CfgBuilder]: Removed 1 assume(true) statements. [2025-02-05 10:38:41,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:41 BoogieIcfgContainer [2025-02-05 10:38:41,085 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:38:41,087 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:38:41,088 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:38:41,092 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:38:41,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:38:40" (1/3) ... [2025-02-05 10:38:41,092 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d2220f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:41, skipping insertion in model container [2025-02-05 10:38:41,092 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:38:40" (2/3) ... [2025-02-05 10:38:41,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40d2220f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:38:41, skipping insertion in model container [2025-02-05 10:38:41,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:41" (3/3) ... [2025-02-05 10:38:41,094 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-02-05 10:38:41,104 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:38:41,105 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 79 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:38:41,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:38:41,159 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;@6d42c0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:38:41,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:38:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 64 states have (on average 1.46875) internal successors, (94), 66 states have internal predecessors, (94), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 10:38:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 10:38:41,170 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:41,171 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:38:41,171 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash -894104835, now seen corresponding path program 1 times [2025-02-05 10:38:41,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:41,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514525263] [2025-02-05 10:38:41,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:41,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:38:41,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:38:41,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:41,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:41,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514525263] [2025-02-05 10:38:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514525263] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:41,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459363819] [2025-02-05 10:38:41,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:41,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:41,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:41,651 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:38:41,653 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:38:41,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:38:41,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:38:41,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:41,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:41,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:38:41,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:41,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:41,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459363819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:41,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:41,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 12 [2025-02-05 10:38:41,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895118413] [2025-02-05 10:38:41,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:41,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:38:41,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:41,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:38:41,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:38:41,787 INFO L87 Difference]: Start difference. First operand has 79 states, 64 states have (on average 1.46875) internal successors, (94), 66 states have internal predecessors, (94), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:41,896 INFO L93 Difference]: Finished difference Result 175 states and 260 transitions. [2025-02-05 10:38:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:41,898 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-05 10:38:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:41,904 INFO L225 Difference]: With dead ends: 175 [2025-02-05 10:38:41,904 INFO L226 Difference]: Without dead ends: 92 [2025-02-05 10:38:41,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:38:41,909 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 14 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:41,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 647 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-05 10:38:41,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 85. [2025-02-05 10:38:41,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 71 states have internal predecessors, (93), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2025-02-05 10:38:41,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2025-02-05 10:38:41,954 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 115 transitions. Word has length 35 [2025-02-05 10:38:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:41,954 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 115 transitions. [2025-02-05 10:38:41,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 115 transitions. [2025-02-05 10:38:41,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:38:41,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:41,959 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:41,965 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:38:42,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 10:38:42,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:42,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:42,160 INFO L85 PathProgramCache]: Analyzing trace with hash -99123177, now seen corresponding path program 1 times [2025-02-05 10:38:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:42,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401954890] [2025-02-05 10:38:42,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:42,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:38:42,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:38:42,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401954890] [2025-02-05 10:38:42,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401954890] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:42,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606727063] [2025-02-05 10:38:42,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:42,352 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:38:42,369 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:38:42,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:38:42,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:38:42,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:42,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 10:38:42,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:42,452 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:42,588 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:42,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606727063] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:42,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:42,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-02-05 10:38:42,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967491429] [2025-02-05 10:38:42,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:42,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 10:38:42,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:42,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 10:38:42,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:38:42,590 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. Second operand has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:42,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:42,746 INFO L93 Difference]: Finished difference Result 156 states and 211 transitions. [2025-02-05 10:38:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:38:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2025-02-05 10:38:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:42,748 INFO L225 Difference]: With dead ends: 156 [2025-02-05 10:38:42,748 INFO L226 Difference]: Without dead ends: 111 [2025-02-05 10:38:42,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:42,749 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 30 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:42,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 873 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-05 10:38:42,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 95. [2025-02-05 10:38:42,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 76 states have (on average 1.3289473684210527) internal successors, (101), 78 states have internal predecessors, (101), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-05 10:38:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 128 transitions. [2025-02-05 10:38:42,764 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 128 transitions. Word has length 39 [2025-02-05 10:38:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:42,764 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 128 transitions. [2025-02-05 10:38:42,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.1875) internal successors, (35), 12 states have internal predecessors, (35), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-05 10:38:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 128 transitions. [2025-02-05 10:38:42,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:42,767 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:42,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:42,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:38:42,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:42,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash -198281096, now seen corresponding path program 1 times [2025-02-05 10:38:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:42,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074573249] [2025-02-05 10:38:42,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:42,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:42,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:42,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:42,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:43,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:43,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074573249] [2025-02-05 10:38:43,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074573249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:43,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:43,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:38:43,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105373105] [2025-02-05 10:38:43,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:43,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:38:43,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:43,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:38:43,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:43,115 INFO L87 Difference]: Start difference. First operand 95 states and 128 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:43,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:43,244 INFO L93 Difference]: Finished difference Result 178 states and 243 transitions. [2025-02-05 10:38:43,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:43,245 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 43 [2025-02-05 10:38:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:43,246 INFO L225 Difference]: With dead ends: 178 [2025-02-05 10:38:43,247 INFO L226 Difference]: Without dead ends: 138 [2025-02-05 10:38:43,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:43,250 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 83 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:43,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 725 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-05 10:38:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2025-02-05 10:38:43,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 106 states have (on average 1.349056603773585) internal successors, (143), 108 states have internal predecessors, (143), 16 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2025-02-05 10:38:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 178 transitions. [2025-02-05 10:38:43,265 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 178 transitions. Word has length 43 [2025-02-05 10:38:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:43,266 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 178 transitions. [2025-02-05 10:38:43,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 7 states have internal predecessors, (28), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 178 transitions. [2025-02-05 10:38:43,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:43,267 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:43,267 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:38:43,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:38:43,267 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:43,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:43,268 INFO L85 PathProgramCache]: Analyzing trace with hash -394794601, now seen corresponding path program 1 times [2025-02-05 10:38:43,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:43,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718186551] [2025-02-05 10:38:43,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:43,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:43,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:43,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:43,386 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718186551] [2025-02-05 10:38:43,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718186551] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:43,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041249239] [2025-02-05 10:38:43,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:43,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:43,391 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:38:43,393 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:38:43,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:43,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:43,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:43,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-05 10:38:43,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:43,477 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:43,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041249239] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:43,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:43,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-02-05 10:38:43,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246146343] [2025-02-05 10:38:43,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:43,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:38:43,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:43,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:38:43,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-05 10:38:43,595 INFO L87 Difference]: Start difference. First operand 130 states and 178 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:38:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:43,689 INFO L93 Difference]: Finished difference Result 224 states and 307 transitions. [2025-02-05 10:38:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:38:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2025-02-05 10:38:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:43,690 INFO L225 Difference]: With dead ends: 224 [2025-02-05 10:38:43,690 INFO L226 Difference]: Without dead ends: 153 [2025-02-05 10:38:43,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:38:43,691 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:43,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 917 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-05 10:38:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 140. [2025-02-05 10:38:43,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 115 states have internal predecessors, (150), 18 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (21), 17 states have call predecessors, (21), 17 states have call successors, (21) [2025-02-05 10:38:43,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 189 transitions. [2025-02-05 10:38:43,700 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 189 transitions. Word has length 43 [2025-02-05 10:38:43,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:43,700 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 189 transitions. [2025-02-05 10:38:43,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:38:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 189 transitions. [2025-02-05 10:38:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-05 10:38:43,703 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:43,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:43,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:43,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:43,909 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:43,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:43,910 INFO L85 PathProgramCache]: Analyzing trace with hash -416119720, now seen corresponding path program 1 times [2025-02-05 10:38:43,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:43,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717534466] [2025-02-05 10:38:43,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:43,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:43,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-05 10:38:43,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-05 10:38:43,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:43,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 10:38:44,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:44,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717534466] [2025-02-05 10:38:44,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717534466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:44,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:44,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-05 10:38:44,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133906900] [2025-02-05 10:38:44,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:44,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-05 10:38:44,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:44,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-05 10:38:44,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-02-05 10:38:44,138 INFO L87 Difference]: Start difference. First operand 140 states and 189 transitions. Second operand has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:38:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:44,383 INFO L93 Difference]: Finished difference Result 203 states and 272 transitions. [2025-02-05 10:38:44,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 10:38:44,383 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2025-02-05 10:38:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:44,385 INFO L225 Difference]: With dead ends: 203 [2025-02-05 10:38:44,385 INFO L226 Difference]: Without dead ends: 195 [2025-02-05 10:38:44,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-02-05 10:38:44,386 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1379 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:44,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1379 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:44,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-05 10:38:44,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 145. [2025-02-05 10:38:44,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 118 states have internal predecessors, (154), 19 states have call successors, (19), 7 states have call predecessors, (19), 8 states have return successors, (22), 19 states have call predecessors, (22), 18 states have call successors, (22) [2025-02-05 10:38:44,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 195 transitions. [2025-02-05 10:38:44,406 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 195 transitions. Word has length 44 [2025-02-05 10:38:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:44,407 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 195 transitions. [2025-02-05 10:38:44,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.9166666666666667) internal successors, (23), 11 states have internal predecessors, (23), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-05 10:38:44,407 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 195 transitions. [2025-02-05 10:38:44,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:44,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:44,409 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:44,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:38:44,409 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:44,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:44,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2033888829, now seen corresponding path program 2 times [2025-02-05 10:38:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:44,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547720334] [2025-02-05 10:38:44,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:44,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:44,416 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-05 10:38:44,434 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 25 of 43 statements. [2025-02-05 10:38:44,435 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 10:38:44,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:44,701 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547720334] [2025-02-05 10:38:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547720334] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 10:38:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830444924] [2025-02-05 10:38:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:44,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:38:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:44,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:38:44,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:38:44,702 INFO L87 Difference]: Start difference. First operand 145 states and 195 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:44,951 INFO L93 Difference]: Finished difference Result 290 states and 394 transitions. [2025-02-05 10:38:44,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:38:44,952 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2025-02-05 10:38:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:44,953 INFO L225 Difference]: With dead ends: 290 [2025-02-05 10:38:44,955 INFO L226 Difference]: Without dead ends: 233 [2025-02-05 10:38:44,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:38:44,957 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 131 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:44,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1262 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:38:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-05 10:38:44,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 204. [2025-02-05 10:38:44,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 166 states have (on average 1.3072289156626506) internal successors, (217), 169 states have internal predecessors, (217), 25 states have call successors, (25), 10 states have call predecessors, (25), 12 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2025-02-05 10:38:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 274 transitions. [2025-02-05 10:38:44,975 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 274 transitions. Word has length 43 [2025-02-05 10:38:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:44,975 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 274 transitions. [2025-02-05 10:38:44,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 10 states have internal predecessors, (27), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:38:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 274 transitions. [2025-02-05 10:38:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 10:38:44,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:44,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:44,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:38:44,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:44,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:44,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1837375324, now seen corresponding path program 1 times [2025-02-05 10:38:44,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:44,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717968580] [2025-02-05 10:38:44,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:44,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:44,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:44,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:44,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:44,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:45,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717968580] [2025-02-05 10:38:45,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717968580] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:45,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56354580] [2025-02-05 10:38:45,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:45,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:45,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:38:45,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 10:38:45,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 10:38:45,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-05 10:38:45,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:45,312 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:45,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56354580] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:45,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:45,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [9] total 17 [2025-02-05 10:38:45,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715709404] [2025-02-05 10:38:45,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:45,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 10:38:45,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:45,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 10:38:45,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:38:45,313 INFO L87 Difference]: Start difference. First operand 204 states and 274 transitions. Second operand has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:45,520 INFO L93 Difference]: Finished difference Result 375 states and 515 transitions. [2025-02-05 10:38:45,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 10:38:45,520 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2025-02-05 10:38:45,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:45,522 INFO L225 Difference]: With dead ends: 375 [2025-02-05 10:38:45,522 INFO L226 Difference]: Without dead ends: 296 [2025-02-05 10:38:45,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:38:45,523 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 67 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:45,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1316 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:45,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-02-05 10:38:45,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 278. [2025-02-05 10:38:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 228 states have (on average 1.3114035087719298) internal successors, (299), 231 states have internal predecessors, (299), 34 states have call successors, (34), 13 states have call predecessors, (34), 15 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2025-02-05 10:38:45,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 376 transitions. [2025-02-05 10:38:45,541 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 376 transitions. Word has length 43 [2025-02-05 10:38:45,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:45,541 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 376 transitions. [2025-02-05 10:38:45,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 10 states have internal predecessors, (26), 4 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:45,542 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 376 transitions. [2025-02-05 10:38:45,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 10:38:45,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:45,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:45,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:45,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 10:38:45,747 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:45,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:45,748 INFO L85 PathProgramCache]: Analyzing trace with hash 726834618, now seen corresponding path program 1 times [2025-02-05 10:38:45,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:45,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698612902] [2025-02-05 10:38:45,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:45,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 10:38:45,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 10:38:45,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 10:38:45,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:45,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698612902] [2025-02-05 10:38:45,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698612902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:45,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:45,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 10:38:45,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882353946] [2025-02-05 10:38:45,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:45,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 10:38:45,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:45,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 10:38:45,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:38:45,804 INFO L87 Difference]: Start difference. First operand 278 states and 376 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:38:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:45,854 INFO L93 Difference]: Finished difference Result 286 states and 383 transitions. [2025-02-05 10:38:45,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 10:38:45,855 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 46 [2025-02-05 10:38:45,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:45,856 INFO L225 Difference]: With dead ends: 286 [2025-02-05 10:38:45,856 INFO L226 Difference]: Without dead ends: 271 [2025-02-05 10:38:45,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:38:45,856 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 3 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:45,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 451 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:45,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-02-05 10:38:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2025-02-05 10:38:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 223 states have (on average 1.3139013452914798) internal successors, (293), 227 states have internal predecessors, (293), 32 states have call successors, (32), 13 states have call predecessors, (32), 15 states have return successors, (40), 30 states have call predecessors, (40), 31 states have call successors, (40) [2025-02-05 10:38:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 365 transitions. [2025-02-05 10:38:45,874 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 365 transitions. Word has length 46 [2025-02-05 10:38:45,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:45,875 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 365 transitions. [2025-02-05 10:38:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-02-05 10:38:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 365 transitions. [2025-02-05 10:38:45,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:38:45,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:45,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:45,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:38:45,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1469344579, now seen corresponding path program 1 times [2025-02-05 10:38:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593607372] [2025-02-05 10:38:45,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:45,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:45,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:45,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:45,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:45,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:38:46,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:46,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593607372] [2025-02-05 10:38:46,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593607372] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:46,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:38:46,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:38:46,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226376088] [2025-02-05 10:38:46,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:46,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:38:46,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:46,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:38:46,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:38:46,003 INFO L87 Difference]: Start difference. First operand 271 states and 365 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:46,087 INFO L93 Difference]: Finished difference Result 290 states and 385 transitions. [2025-02-05 10:38:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:38:46,087 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 47 [2025-02-05 10:38:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:46,089 INFO L225 Difference]: With dead ends: 290 [2025-02-05 10:38:46,089 INFO L226 Difference]: Without dead ends: 250 [2025-02-05 10:38:46,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-05 10:38:46,090 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 11 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:46,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 816 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:38:46,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2025-02-05 10:38:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 244. [2025-02-05 10:38:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 199 states have (on average 1.2964824120603016) internal successors, (258), 203 states have internal predecessors, (258), 29 states have call successors, (29), 13 states have call predecessors, (29), 15 states have return successors, (37), 27 states have call predecessors, (37), 28 states have call successors, (37) [2025-02-05 10:38:46,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 324 transitions. [2025-02-05 10:38:46,103 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 324 transitions. Word has length 47 [2025-02-05 10:38:46,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:46,104 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 324 transitions. [2025-02-05 10:38:46,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:38:46,104 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 324 transitions. [2025-02-05 10:38:46,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:46,105 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:46,105 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:46,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:38:46,105 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:46,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:46,106 INFO L85 PathProgramCache]: Analyzing trace with hash 2022623933, now seen corresponding path program 1 times [2025-02-05 10:38:46,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:46,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160169587] [2025-02-05 10:38:46,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:46,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:46,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:46,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:46,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:46,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160169587] [2025-02-05 10:38:46,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160169587] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:46,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216872738] [2025-02-05 10:38:46,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:46,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:46,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:46,256 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:46,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:38:46,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:46,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:46,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:46,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:46,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 10:38:46,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:46,455 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:46,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:46,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216872738] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:46,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:46,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 13] total 32 [2025-02-05 10:38:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698932346] [2025-02-05 10:38:46,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:46,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 10:38:46,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:46,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 10:38:46,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:38:46,766 INFO L87 Difference]: Start difference. First operand 244 states and 324 transitions. Second operand has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:38:48,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:48,126 INFO L93 Difference]: Finished difference Result 457 states and 643 transitions. [2025-02-05 10:38:48,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-05 10:38:48,126 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) Word has length 48 [2025-02-05 10:38:48,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:48,128 INFO L225 Difference]: With dead ends: 457 [2025-02-05 10:38:48,128 INFO L226 Difference]: Without dead ends: 432 [2025-02-05 10:38:48,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=3579, Unknown=0, NotChecked=0, Total=3906 [2025-02-05 10:38:48,131 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 267 mSDsluCounter, 3381 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 3567 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:48,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 3567 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:38:48,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-02-05 10:38:48,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 287. [2025-02-05 10:38:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.2857142857142858) internal successors, (297), 239 states have internal predecessors, (297), 35 states have call successors, (35), 12 states have call predecessors, (35), 20 states have return successors, (55), 35 states have call predecessors, (55), 34 states have call successors, (55) [2025-02-05 10:38:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 387 transitions. [2025-02-05 10:38:48,154 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 387 transitions. Word has length 48 [2025-02-05 10:38:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:48,155 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 387 transitions. [2025-02-05 10:38:48,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 25 states have internal predecessors, (50), 6 states have call successors, (9), 2 states have call predecessors, (9), 6 states have return successors, (10), 8 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:38:48,156 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 387 transitions. [2025-02-05 10:38:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-05 10:38:48,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:48,157 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:48,164 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:38:48,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-05 10:38:48,361 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:48,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1274576056, now seen corresponding path program 1 times [2025-02-05 10:38:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377142812] [2025-02-05 10:38:48,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:48,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:48,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:48,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:48,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:48,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377142812] [2025-02-05 10:38:48,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377142812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:48,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785288394] [2025-02-05 10:38:48,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:48,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:48,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:48,401 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:48,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:38:48,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-02-05 10:38:48,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-02-05 10:38:48,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:48,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:48,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:38:48,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:48,444 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:38:48,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:48,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785288394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-02-05 10:38:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234047750] [2025-02-05 10:38:48,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:48,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:48,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:48,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:48,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:38:48,445 INFO L87 Difference]: Start difference. First operand 287 states and 387 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:48,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:48,501 INFO L93 Difference]: Finished difference Result 573 states and 775 transitions. [2025-02-05 10:38:48,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:48,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 47 [2025-02-05 10:38:48,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:48,507 INFO L225 Difference]: With dead ends: 573 [2025-02-05 10:38:48,507 INFO L226 Difference]: Without dead ends: 289 [2025-02-05 10:38:48,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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:38:48,508 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 7 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:48,508 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 171 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2025-02-05 10:38:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2025-02-05 10:38:48,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 231 states have (on average 1.2813852813852813) internal successors, (296), 239 states have internal predecessors, (296), 35 states have call successors, (35), 12 states have call predecessors, (35), 20 states have return successors, (55), 35 states have call predecessors, (55), 34 states have call successors, (55) [2025-02-05 10:38:48,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 386 transitions. [2025-02-05 10:38:48,522 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 386 transitions. Word has length 47 [2025-02-05 10:38:48,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:48,522 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 386 transitions. [2025-02-05 10:38:48,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:48,522 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 386 transitions. [2025-02-05 10:38:48,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:48,523 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:48,523 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:48,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:48,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-05 10:38:48,727 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:48,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:48,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1865446607, now seen corresponding path program 2 times [2025-02-05 10:38:48,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:48,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515187234] [2025-02-05 10:38:48,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:48,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:48,735 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-05 10:38:48,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:48,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:48,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:48,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515187234] [2025-02-05 10:38:48,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515187234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:48,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124995427] [2025-02-05 10:38:48,902 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:38:48,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:48,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:48,903 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:48,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 10:38:48,931 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 48 statements into 2 equivalence classes. [2025-02-05 10:38:48,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:48,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:38:48,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:48,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 10:38:48,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:49,066 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:38:49,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:38:49,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124995427] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:38:49,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:38:49,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 13] total 30 [2025-02-05 10:38:49,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034723339] [2025-02-05 10:38:49,344 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:38:49,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-05 10:38:49,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:49,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-05 10:38:49,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=786, Unknown=0, NotChecked=0, Total=870 [2025-02-05 10:38:49,345 INFO L87 Difference]: Start difference. First operand 287 states and 386 transitions. Second operand has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 10:38:50,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:50,483 INFO L93 Difference]: Finished difference Result 455 states and 647 transitions. [2025-02-05 10:38:50,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-02-05 10:38:50,484 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) Word has length 48 [2025-02-05 10:38:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:50,486 INFO L225 Difference]: With dead ends: 455 [2025-02-05 10:38:50,487 INFO L226 Difference]: Without dead ends: 442 [2025-02-05 10:38:50,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=265, Invalid=2705, Unknown=0, NotChecked=0, Total=2970 [2025-02-05 10:38:50,488 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 297 mSDsluCounter, 3196 mSDsCounter, 0 mSdLazyCounter, 1479 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 3381 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:50,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 3381 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1479 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:38:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-02-05 10:38:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 300. [2025-02-05 10:38:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 239 states have (on average 1.2719665271966527) internal successors, (304), 247 states have internal predecessors, (304), 39 states have call successors, (39), 13 states have call predecessors, (39), 21 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2025-02-05 10:38:50,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 412 transitions. [2025-02-05 10:38:50,515 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 412 transitions. Word has length 48 [2025-02-05 10:38:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:50,515 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 412 transitions. [2025-02-05 10:38:50,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 2.0) internal successors, (56), 24 states have internal predecessors, (56), 6 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 9 states have call predecessors, (11), 5 states have call successors, (11) [2025-02-05 10:38:50,516 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 412 transitions. [2025-02-05 10:38:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-05 10:38:50,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:50,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:50,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-05 10:38:50,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:50,718 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:50,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:50,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1645148889, now seen corresponding path program 1 times [2025-02-05 10:38:50,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:50,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671686815] [2025-02-05 10:38:50,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:50,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:50,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:50,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:50,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:50,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:38:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671686815] [2025-02-05 10:38:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671686815] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:50,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167652366] [2025-02-05 10:38:50,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:50,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:50,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:50,788 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:50,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 10:38:50,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-05 10:38:50,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-05 10:38:50,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:50,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:50,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-05 10:38:50,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:50,858 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-05 10:38:50,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:38:50,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167652366] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:38:50,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:38:50,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-02-05 10:38:50,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273485693] [2025-02-05 10:38:50,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:38:50,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:38:50,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:38:50,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:38:50,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:50,859 INFO L87 Difference]: Start difference. First operand 300 states and 412 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:50,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:38:50,899 INFO L93 Difference]: Finished difference Result 602 states and 832 transitions. [2025-02-05 10:38:50,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:38:50,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 48 [2025-02-05 10:38:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:38:50,901 INFO L225 Difference]: With dead ends: 602 [2025-02-05 10:38:50,901 INFO L226 Difference]: Without dead ends: 305 [2025-02-05 10:38:50,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:38:50,902 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:38:50,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 174 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:38:50,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-05 10:38:50,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2025-02-05 10:38:50,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 239 states have (on average 1.2677824267782427) internal successors, (303), 247 states have internal predecessors, (303), 39 states have call successors, (39), 13 states have call predecessors, (39), 21 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2025-02-05 10:38:50,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 411 transitions. [2025-02-05 10:38:50,922 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 411 transitions. Word has length 48 [2025-02-05 10:38:50,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:38:50,922 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 411 transitions. [2025-02-05 10:38:50,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:38:50,922 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 411 transitions. [2025-02-05 10:38:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:38:50,923 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:38:50,923 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:38:50,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 10:38:51,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:51,124 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:38:51,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:38:51,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1488174014, now seen corresponding path program 1 times [2025-02-05 10:38:51,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:38:51,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747390639] [2025-02-05 10:38:51,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:38:51,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:38:51,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:38:51,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:38:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747390639] [2025-02-05 10:38:51,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747390639] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:38:51,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99359734] [2025-02-05 10:38:51,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:38:51,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:38:51,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:38:51,261 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:38:51,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 10:38:51,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:38:51,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:38:51,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:38:51,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:38:51,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-05 10:38:51,308 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:38:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:38:51,477 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:39:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99359734] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:48,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:39:48,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 17, 15] total 32 [2025-02-05 10:39:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994367918] [2025-02-05 10:39:48,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:48,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 10:39:48,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:48,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 10:39:48,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=900, Unknown=10, NotChecked=0, Total=992 [2025-02-05 10:39:48,546 INFO L87 Difference]: Start difference. First operand 300 states and 411 transitions. Second operand has 32 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 24 states have internal predecessors, (62), 9 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 10:39:52,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:52,337 INFO L93 Difference]: Finished difference Result 585 states and 799 transitions. [2025-02-05 10:39:52,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 10:39:52,337 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 24 states have internal predecessors, (62), 9 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 49 [2025-02-05 10:39:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:52,341 INFO L225 Difference]: With dead ends: 585 [2025-02-05 10:39:52,341 INFO L226 Difference]: Without dead ends: 440 [2025-02-05 10:39:52,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 58.6s TimeCoverageRelationStatistics Valid=206, Invalid=1945, Unknown=11, NotChecked=0, Total=2162 [2025-02-05 10:39:52,343 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 290 mSDsluCounter, 2196 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:52,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2299 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-05 10:39:52,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-02-05 10:39:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 393. [2025-02-05 10:39:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 317 states have (on average 1.274447949526814) internal successors, (404), 328 states have internal predecessors, (404), 48 states have call successors, (48), 16 states have call predecessors, (48), 27 states have return successors, (76), 48 states have call predecessors, (76), 47 states have call successors, (76) [2025-02-05 10:39:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 528 transitions. [2025-02-05 10:39:52,375 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 528 transitions. Word has length 49 [2025-02-05 10:39:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:52,375 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 528 transitions. [2025-02-05 10:39:52,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 24 states have internal predecessors, (62), 9 states have call successors, (13), 7 states have call predecessors, (13), 4 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 10:39:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 528 transitions. [2025-02-05 10:39:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-05 10:39:52,376 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:52,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:52,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:52,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:52,577 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:52,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:52,577 INFO L85 PathProgramCache]: Analyzing trace with hash 642986612, now seen corresponding path program 1 times [2025-02-05 10:39:52,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:52,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250345588] [2025-02-05 10:39:52,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:52,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:52,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:39:52,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:39:52,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:52,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:52,845 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 10:39:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250345588] [2025-02-05 10:39:52,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250345588] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:52,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246061604] [2025-02-05 10:39:52,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:52,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:52,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:52,847 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:39:52,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-05 10:39:52,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-05 10:39:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-05 10:39:52,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:52,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:52,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-05 10:39:52,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:52,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:39:52,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246061604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:52,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:39:52,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 21 [2025-02-05 10:39:52,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355752544] [2025-02-05 10:39:52,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:52,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:39:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:52,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:39:52,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2025-02-05 10:39:52,967 INFO L87 Difference]: Start difference. First operand 393 states and 528 transitions. Second operand has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:53,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:53,097 INFO L93 Difference]: Finished difference Result 568 states and 765 transitions. [2025-02-05 10:39:53,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:39:53,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-02-05 10:39:53,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:53,099 INFO L225 Difference]: With dead ends: 568 [2025-02-05 10:39:53,100 INFO L226 Difference]: Without dead ends: 402 [2025-02-05 10:39:53,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=456, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:39:53,101 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 59 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:53,102 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 818 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2025-02-05 10:39:53,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 393. [2025-02-05 10:39:53,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 317 states have (on average 1.2681388012618298) internal successors, (402), 328 states have internal predecessors, (402), 48 states have call successors, (48), 16 states have call predecessors, (48), 27 states have return successors, (76), 48 states have call predecessors, (76), 47 states have call successors, (76) [2025-02-05 10:39:53,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 526 transitions. [2025-02-05 10:39:53,125 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 526 transitions. Word has length 49 [2025-02-05 10:39:53,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:53,126 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 526 transitions. [2025-02-05 10:39:53,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:53,126 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 526 transitions. [2025-02-05 10:39:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 10:39:53,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:53,127 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:53,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-05 10:39:53,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-05 10:39:53,327 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:53,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:53,328 INFO L85 PathProgramCache]: Analyzing trace with hash -828932043, now seen corresponding path program 1 times [2025-02-05 10:39:53,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:53,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627418255] [2025-02-05 10:39:53,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:53,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:53,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:39:53,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:39:53,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:53,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:53,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:53,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:53,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627418255] [2025-02-05 10:39:53,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627418255] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:53,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [498330314] [2025-02-05 10:39:53,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:53,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:53,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:53,415 INFO L229 MonitoredProcess]: Starting monitored process 12 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:39:53,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-05 10:39:53,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 10:39:53,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 10:39:53,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:53,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:53,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-05 10:39:53,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:53,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:53,734 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:39:53,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [498330314] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:53,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:39:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 10] total 23 [2025-02-05 10:39:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518252550] [2025-02-05 10:39:53,734 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:53,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-05 10:39:53,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:53,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-05 10:39:53,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-02-05 10:39:53,735 INFO L87 Difference]: Start difference. First operand 393 states and 526 transitions. Second operand has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 10:39:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:54,200 INFO L93 Difference]: Finished difference Result 513 states and 705 transitions. [2025-02-05 10:39:54,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-05 10:39:54,200 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) Word has length 50 [2025-02-05 10:39:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:54,203 INFO L225 Difference]: With dead ends: 513 [2025-02-05 10:39:54,203 INFO L226 Difference]: Without dead ends: 474 [2025-02-05 10:39:54,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2025-02-05 10:39:54,204 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 154 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1569 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:54,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1569 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:39:54,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-02-05 10:39:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 395. [2025-02-05 10:39:54,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 317 states have (on average 1.2586750788643533) internal successors, (399), 330 states have internal predecessors, (399), 49 states have call successors, (49), 15 states have call predecessors, (49), 28 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-02-05 10:39:54,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 535 transitions. [2025-02-05 10:39:54,248 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 535 transitions. Word has length 50 [2025-02-05 10:39:54,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:54,249 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 535 transitions. [2025-02-05 10:39:54,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.857142857142857) internal successors, (60), 20 states have internal predecessors, (60), 5 states have call successors, (10), 2 states have call predecessors, (10), 6 states have return successors, (11), 7 states have call predecessors, (11), 4 states have call successors, (11) [2025-02-05 10:39:54,249 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 535 transitions. [2025-02-05 10:39:54,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 10:39:54,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:54,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:54,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-05 10:39:54,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 10:39:54,451 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:54,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:54,451 INFO L85 PathProgramCache]: Analyzing trace with hash -93787457, now seen corresponding path program 1 times [2025-02-05 10:39:54,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:54,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246042479] [2025-02-05 10:39:54,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:54,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 10:39:54,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:39:54,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:54,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:54,713 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:54,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:54,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246042479] [2025-02-05 10:39:54,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246042479] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:54,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:54,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-05 10:39:54,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359972881] [2025-02-05 10:39:54,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:54,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 10:39:54,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:54,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 10:39:54,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:39:54,715 INFO L87 Difference]: Start difference. First operand 395 states and 535 transitions. Second operand has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:54,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:54,898 INFO L93 Difference]: Finished difference Result 414 states and 558 transitions. [2025-02-05 10:39:54,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:39:54,898 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-02-05 10:39:54,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:54,900 INFO L225 Difference]: With dead ends: 414 [2025-02-05 10:39:54,901 INFO L226 Difference]: Without dead ends: 412 [2025-02-05 10:39:54,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-02-05 10:39:54,902 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 67 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:54,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1004 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:54,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-05 10:39:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 403. [2025-02-05 10:39:54,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 1.2538699690402477) internal successors, (405), 336 states have internal predecessors, (405), 49 states have call successors, (49), 17 states have call predecessors, (49), 30 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-02-05 10:39:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 541 transitions. [2025-02-05 10:39:54,927 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 541 transitions. Word has length 51 [2025-02-05 10:39:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:54,927 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 541 transitions. [2025-02-05 10:39:54,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 10 states have internal predecessors, (38), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 541 transitions. [2025-02-05 10:39:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 10:39:54,930 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:54,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 10:39:54,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:54,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1512711303, now seen corresponding path program 1 times [2025-02-05 10:39:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413407952] [2025-02-05 10:39:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:54,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 10:39:54,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 10:39:54,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:54,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:55,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:39:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413407952] [2025-02-05 10:39:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413407952] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 10:39:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096054673] [2025-02-05 10:39:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:55,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 10:39:55,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:55,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 10:39:55,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-05 10:39:55,070 INFO L87 Difference]: Start difference. First operand 403 states and 541 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:55,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:55,156 INFO L93 Difference]: Finished difference Result 409 states and 546 transitions. [2025-02-05 10:39:55,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 10:39:55,157 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2025-02-05 10:39:55,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:55,158 INFO L225 Difference]: With dead ends: 409 [2025-02-05 10:39:55,160 INFO L226 Difference]: Without dead ends: 407 [2025-02-05 10:39:55,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:39:55,161 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 12 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:55,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 476 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-02-05 10:39:55,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2025-02-05 10:39:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 326 states have (on average 1.2515337423312884) internal successors, (408), 339 states have internal predecessors, (408), 49 states have call successors, (49), 18 states have call predecessors, (49), 31 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-02-05 10:39:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 544 transitions. [2025-02-05 10:39:55,188 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 544 transitions. Word has length 51 [2025-02-05 10:39:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:55,188 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 544 transitions. [2025-02-05 10:39:55,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:39:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 544 transitions. [2025-02-05 10:39:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-02-05 10:39:55,190 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:55,190 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:39:55,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 10:39:55,190 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:55,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash 615268087, now seen corresponding path program 1 times [2025-02-05 10:39:55,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:55,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768729763] [2025-02-05 10:39:55,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:55,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-05 10:39:55,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-05 10:39:55,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:55,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:55,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768729763] [2025-02-05 10:39:55,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768729763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:39:55,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:39:55,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 10:39:55,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864231012] [2025-02-05 10:39:55,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:39:55,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 10:39:55,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:55,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 10:39:55,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-05 10:39:55,313 INFO L87 Difference]: Start difference. First operand 407 states and 544 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:39:55,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:55,488 INFO L93 Difference]: Finished difference Result 552 states and 742 transitions. [2025-02-05 10:39:55,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:39:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 55 [2025-02-05 10:39:55,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:55,491 INFO L225 Difference]: With dead ends: 552 [2025-02-05 10:39:55,491 INFO L226 Difference]: Without dead ends: 433 [2025-02-05 10:39:55,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-02-05 10:39:55,492 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 95 mSDsluCounter, 922 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:55,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1050 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:39:55,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-02-05 10:39:55,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 407. [2025-02-05 10:39:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 326 states have (on average 1.2484662576687116) internal successors, (407), 339 states have internal predecessors, (407), 49 states have call successors, (49), 18 states have call predecessors, (49), 31 states have return successors, (87), 49 states have call predecessors, (87), 48 states have call successors, (87) [2025-02-05 10:39:55,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 543 transitions. [2025-02-05 10:39:55,520 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 543 transitions. Word has length 55 [2025-02-05 10:39:55,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:55,520 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 543 transitions. [2025-02-05 10:39:55,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:39:55,520 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 543 transitions. [2025-02-05 10:39:55,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:39:55,521 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:55,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:55,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 10:39:55,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:55,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1691921944, now seen corresponding path program 1 times [2025-02-05 10:39:55,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:55,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629874980] [2025-02-05 10:39:55,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:55,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:55,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:39:55,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:39:55,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:55,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:55,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:39:55,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629874980] [2025-02-05 10:39:55,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629874980] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:55,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495461956] [2025-02-05 10:39:55,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:55,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:55,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:55,652 INFO L229 MonitoredProcess]: Starting monitored process 13 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:39:55,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-05 10:39:55,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-05 10:39:55,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:39:55,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:55,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:55,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-05 10:39:55,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:55,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:39:55,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:39:55,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495461956] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:55,941 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:39:55,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2025-02-05 10:39:55,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723604172] [2025-02-05 10:39:55,941 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:55,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-05 10:39:55,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:55,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-05 10:39:55,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2025-02-05 10:39:55,942 INFO L87 Difference]: Start difference. First operand 407 states and 543 transitions. Second operand has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:39:56,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:56,487 INFO L93 Difference]: Finished difference Result 496 states and 683 transitions. [2025-02-05 10:39:56,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-05 10:39:56,488 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 56 [2025-02-05 10:39:56,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:56,489 INFO L225 Difference]: With dead ends: 496 [2025-02-05 10:39:56,490 INFO L226 Difference]: Without dead ends: 464 [2025-02-05 10:39:56,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 10:39:56,490 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 214 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1801 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:56,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1801 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:39:56,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-02-05 10:39:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 393. [2025-02-05 10:39:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 316 states have (on average 1.2563291139240507) internal successors, (397), 328 states have internal predecessors, (397), 47 states have call successors, (47), 16 states have call predecessors, (47), 29 states have return successors, (83), 48 states have call predecessors, (83), 46 states have call successors, (83) [2025-02-05 10:39:56,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 527 transitions. [2025-02-05 10:39:56,514 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 527 transitions. Word has length 56 [2025-02-05 10:39:56,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 527 transitions. [2025-02-05 10:39:56,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.391304347826087) internal successors, (55), 21 states have internal predecessors, (55), 4 states have call successors, (7), 2 states have call predecessors, (7), 5 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-05 10:39:56,515 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 527 transitions. [2025-02-05 10:39:56,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-02-05 10:39:56,516 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:56,516 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:56,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-05 10:39:56,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:56,720 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:56,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:56,721 INFO L85 PathProgramCache]: Analyzing trace with hash -472499300, now seen corresponding path program 2 times [2025-02-05 10:39:56,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:56,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770714021] [2025-02-05 10:39:56,721 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:39:56,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:56,724 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-05 10:39:56,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:39:56,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:39:56,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 10:39:57,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:39:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770714021] [2025-02-05 10:39:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770714021] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:39:57,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337922281] [2025-02-05 10:39:57,175 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:39:57,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:57,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:39:57,177 INFO L229 MonitoredProcess]: Starting monitored process 14 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:39:57,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-05 10:39:57,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 56 statements into 2 equivalence classes. [2025-02-05 10:39:57,226 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 56 of 56 statements. [2025-02-05 10:39:57,226 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-05 10:39:57,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:39:57,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-05 10:39:57,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:39:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:39:57,390 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:39:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 10:39:58,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337922281] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:39:58,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 10:39:58,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 14] total 36 [2025-02-05 10:39:58,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147564182] [2025-02-05 10:39:58,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 10:39:58,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-05 10:39:58,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:39:58,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-05 10:39:58,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2025-02-05 10:39:58,154 INFO L87 Difference]: Start difference. First operand 393 states and 527 transitions. Second operand has 36 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:39:59,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:39:59,177 INFO L93 Difference]: Finished difference Result 485 states and 667 transitions. [2025-02-05 10:39:59,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-02-05 10:39:59,177 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) Word has length 56 [2025-02-05 10:39:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:39:59,179 INFO L225 Difference]: With dead ends: 485 [2025-02-05 10:39:59,179 INFO L226 Difference]: Without dead ends: 452 [2025-02-05 10:39:59,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=2546, Unknown=0, NotChecked=0, Total=2756 [2025-02-05 10:39:59,180 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 181 mSDsluCounter, 2649 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:39:59,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 2765 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1267 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:39:59,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-02-05 10:39:59,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 385. [2025-02-05 10:39:59,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 309 states have (on average 1.2621359223300972) internal successors, (390), 323 states have internal predecessors, (390), 46 states have call successors, (46), 14 states have call predecessors, (46), 29 states have return successors, (81), 47 states have call predecessors, (81), 45 states have call successors, (81) [2025-02-05 10:39:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 517 transitions. [2025-02-05 10:39:59,204 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 517 transitions. Word has length 56 [2025-02-05 10:39:59,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:39:59,204 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 517 transitions. [2025-02-05 10:39:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.064516129032258) internal successors, (64), 30 states have internal predecessors, (64), 6 states have call successors, (9), 2 states have call predecessors, (9), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2025-02-05 10:39:59,204 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 517 transitions. [2025-02-05 10:39:59,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-05 10:39:59,205 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:39:59,205 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 10:39:59,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-05 10:39:59,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:39:59,409 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:39:59,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:39:59,409 INFO L85 PathProgramCache]: Analyzing trace with hash 876401772, now seen corresponding path program 1 times [2025-02-05 10:39:59,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:39:59,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186629530] [2025-02-05 10:39:59,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:39:59,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:39:59,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:39:59,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:39:59,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:59,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:39:59,432 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 10:39:59,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-05 10:39:59,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-05 10:39:59,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:39:59,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 10:39:59,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 10:39:59,460 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 10:39:59,461 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:39:59,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 10:39:59,465 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:39:59,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:39:59,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:39:59 BoogieIcfgContainer [2025-02-05 10:39:59,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:39:59,496 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:39:59,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:39:59,496 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:39:59,497 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:38:41" (3/4) ... [2025-02-05 10:39:59,498 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-05 10:39:59,499 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:39:59,500 INFO L158 Benchmark]: Toolchain (without parser) took 79020.76ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 113.5MB in the beginning and 105.2MB in the end (delta: 8.3MB). Peak memory consumption was 130.5MB. Max. memory is 16.1GB. [2025-02-05 10:39:59,500 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:59,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.41ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 99.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:39:59,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.46ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 99.0MB in the end (delta: 823.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:59,501 INFO L158 Benchmark]: Boogie Preprocessor took 21.16ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:59,502 INFO L158 Benchmark]: IcfgBuilder took 375.34ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 76.3MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:39:59,503 INFO L158 Benchmark]: TraceAbstraction took 78408.31ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 75.8MB in the beginning and 105.3MB in the end (delta: -29.5MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. [2025-02-05 10:39:59,503 INFO L158 Benchmark]: Witness Printer took 3.11ms. Allocated memory is still 268.4MB. Free memory was 105.3MB in the beginning and 105.2MB in the end (delta: 54.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:39:59,504 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.48ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.41ms. Allocated memory is still 142.6MB. Free memory was 113.5MB in the beginning and 99.8MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.46ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 99.0MB in the end (delta: 823.5kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.16ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 97.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 375.34ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 76.3MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 78408.31ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 75.8MB in the beginning and 105.3MB in the end (delta: -29.5MB). Peak memory consumption was 96.9MB. Max. memory is 16.1GB. * Witness Printer took 3.11ms. Allocated memory is still 268.4MB. Free memory was 105.3MB in the beginning and 105.2MB in the end (delta: 54.1kB). There was no memory consumed. 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 - UnprovableResult [Line: 17]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 110, overapproximation of bitwiseAnd at line 76. Possible FailurePath: [L226] unsigned int a ; [L227] unsigned int ma = __VERIFIER_nondet_uint(); [L228] signed char ea = __VERIFIER_nondet_char(); [L229] unsigned int b ; [L230] unsigned int mb = __VERIFIER_nondet_uint(); [L231] signed char eb = __VERIFIER_nondet_char(); [L232] unsigned int r_add1 ; [L233] unsigned int r_add2 ; [L234] unsigned int zero ; [L235] int tmp ; [L236] int tmp___0 ; [L237] int __retres14 ; VAL [ea=96, eb=127] [L241] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L29] COND TRUE ! m [L30] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0] [L80] return (__retres4); VAL [\old(e)=0, \old(m)=0, \result=0, e=0] [L241] RET, EXPR base2flt(0, 0) VAL [ea=96, eb=127] [L241] zero = base2flt(0, 0) [L242] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=96, \old(m)=8388608] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=96, \old(m)=8388608, e=96, m=8388608] [L29] COND FALSE !(! m) VAL [\old(e)=96, \old(m)=8388608, e=96, m=8388608] [L35] COND TRUE m < 1U << 24U VAL [\old(e)=96, \old(m)=8388608, e=96, m=8388608] [L37] COND TRUE 1 VAL [\old(e)=96, \old(m)=8388608, e=96, m=8388608] [L39] COND FALSE !(e <= -128) [L45] e = e - 1 [L46] m = m << 1U VAL [\old(e)=96, \old(m)=8388608, e=95, m=16777216] [L47] COND FALSE !(m < 1U << 24U) VAL [\old(e)=96, \old(m)=8388608, e=95, m=16777216] [L76] EXPR m & ~ (1U << 24U) VAL [\old(e)=96, \old(m)=8388608, e=95] [L76] m = m & ~ (1U << 24U) [L77] EXPR m | ((unsigned int )(e + 128) << 24U) VAL [\old(e)=96, \old(m)=8388608] [L77] res = m | ((unsigned int )(e + 128) << 24U) [L78] __retres4 = res VAL [\old(e)=96, \old(m)=8388608, __retres4=3741319168] [L80] return (__retres4); VAL [\old(e)=96, \old(m)=8388608, \result=3741319168] [L242] RET, EXPR base2flt(ma, ea) VAL [ea=96, eb=127, ma=8388608] [L242] a = base2flt(ma, ea) [L243] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=127, \old(m)=33554432] [L25] unsigned int res ; [L26] unsigned int __retres4 ; VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L29] COND FALSE !(! m) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L35] COND FALSE !(m < 1U << 24U) VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L57] COND TRUE 1 VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L59] COND TRUE m >= 1U << 25U VAL [\old(e)=127, \old(m)=33554432, e=127, m=33554432] [L64] COND TRUE e >= 127 [L65] __retres4 = 4294967295U VAL [\old(e)=127, \old(m)=33554432, __retres4=4294967295, m=33554432] [L80] return (__retres4); VAL [\old(e)=127, \old(m)=33554432, \result=4294967295, m=33554432] [L243] RET, EXPR base2flt(mb, eb) VAL [a=3741319168, ea=96, eb=127, ma=8388608, mb=33554432] [L243] b = base2flt(mb, eb) [L244] CALL addflt(a, b) VAL [\old(a)=3741319168, \old(b)=4294967295] [L84] unsigned int res ; [L85] unsigned int ma ; [L86] unsigned int mb ; [L87] unsigned int delta ; [L88] int ea ; [L89] int eb ; [L90] unsigned int tmp ; [L91] unsigned int __retres10 ; VAL [\old(a)=3741319168, \old(b)=4294967295, a=3741319168, b=4294967295] [L94] COND TRUE a < b [L95] tmp = a [L96] a = b [L97] b = tmp VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, b=3741319168] [L101] COND FALSE !(! b) [L108] ma = a & ((1U << 24U) - 1U) [L109] ea = (int )(a >> 24U) - 128 VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, b=3741319168, ea=127, ma=16777215] [L110] EXPR ma | (1U << 24U) VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, b=3741319168, ea=127] [L110] ma = ma | (1U << 24U) [L111] mb = b & ((1U << 24U) - 1U) [L112] eb = (int )(b >> 24U) - 128 VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, ea=127, eb=95, ma=16777216, mb=0] [L113] EXPR mb | (1U << 24U) VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, ea=127, eb=95, ma=16777216] [L113] mb = mb | (1U << 24U) [L114] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1] [L114] RET __VERIFIER_assert(ea >= eb) VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, ea=127, eb=95, ma=16777216, mb=16777216] [L115] delta = ea - eb VAL [\old(a)=3741319168, \old(b)=4294967295, a=4294967295, delta=32, ea=127, ma=16777216, mb=16777216] [L116] CALL __VERIFIER_assert(delta < sizeof(mb) * 8) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0] [L17] reach_error() VAL [\old(cond)=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 78.3s, OverallIterations: 22, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2199 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2055 mSDsluCounter, 27461 SdHoareTripleChecker+Invalid, 4.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25144 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9166 IncrementalHoareTripleChecker+Invalid, 9445 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 2317 mSDtfsCounter, 9166 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1373 GetRequests, 920 SyntacticMatches, 2 SemanticMatches, 451 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2395 ImplicationChecksByTransitivity, 63.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=18, InterpolantAutomatonStates: 331, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 21 MinimizatonAttempts, 749 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 63.5s InterpolantComputationTime, 1659 NumberOfCodeBlocks, 1641 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1949 ConstructedInterpolants, 11 QuantifiedInterpolants, 5468 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1938 ConjunctsInSsa, 286 ConjunctsInUnsatCore, 42 InterpolantComputations, 13 PerfectInterpolantSequences, 666/788 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-02-05 10:39:59,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/bitvector/soft_float_4-3a.c.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:40:01,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:40:01,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-05 10:40:01,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:40:01,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:40:01,320 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:40:01,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:40:01,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:40:01,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:40:01,322 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:40:01,323 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:40:01,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:40:01,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:40:01,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:40:01,323 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:40:01,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:40:01,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:40:01,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:40:01,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:40:01,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:40:01,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:40:01,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:40:01,325 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:40:01,325 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:40:01,325 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:40:01,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:40:01,326 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 -> c7e459611ed6ff9d4c49aa04980ca7f1d5aaaf97e8fc0116c264955df4ed453a [2025-02-05 10:40:01,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:40:01,552 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:40:01,554 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:40:01,555 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:40:01,555 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:40:01,556 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-02-05 10:40:02,658 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ff9ab5d8/a1f559194c094cf08609345581f7c296/FLAGb4f859e0b [2025-02-05 10:40:02,849 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:40:02,849 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_4-3a.c.cil.c [2025-02-05 10:40:02,856 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ff9ab5d8/a1f559194c094cf08609345581f7c296/FLAGb4f859e0b [2025-02-05 10:40:03,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ff9ab5d8/a1f559194c094cf08609345581f7c296 [2025-02-05 10:40:03,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:40:03,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:40:03,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:40:03,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:40:03,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:40:03,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4459b4c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03, skipping insertion in model container [2025-02-05 10:40:03,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:40:03,319 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-02-05 10:40:03,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:40:03,362 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:40:03,369 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/bitvector/soft_float_4-3a.c.cil.c[730,743] [2025-02-05 10:40:03,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:40:03,394 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:40:03,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03 WrapperNode [2025-02-05 10:40:03,395 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:40:03,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:40:03,396 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:40:03,396 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:40:03,403 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:40:03" (1/1) ... [2025-02-05 10:40:03,410 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:40:03" (1/1) ... [2025-02-05 10:40:03,422 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-02-05 10:40:03,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:40:03,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:40:03,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:40:03,423 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:40:03,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,452 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:40:03,452 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,453 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,461 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,461 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,462 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,462 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:40:03,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:40:03,468 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:40:03,469 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:40:03,469 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (1/1) ... [2025-02-05 10:40:03,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:40:03,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:03,493 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:40:03,496 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:40:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:40:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-05 10:40:03,511 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2025-02-05 10:40:03,511 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2025-02-05 10:40:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:40:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:40:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure addflt [2025-02-05 10:40:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure addflt [2025-02-05 10:40:03,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 10:40:03,512 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 10:40:03,563 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:40:03,564 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:40:03,723 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-02-05 10:40:03,723 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:40:03,729 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:40:03,730 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:40:03,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:03 BoogieIcfgContainer [2025-02-05 10:40:03,731 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:40:03,732 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:40:03,732 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:40:03,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:40:03,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:40:03" (1/3) ... [2025-02-05 10:40:03,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d34bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:03, skipping insertion in model container [2025-02-05 10:40:03,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:40:03" (2/3) ... [2025-02-05 10:40:03,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d34bbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:40:03, skipping insertion in model container [2025-02-05 10:40:03,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:40:03" (3/3) ... [2025-02-05 10:40:03,738 INFO L128 eAbstractionObserver]: Analyzing ICFG soft_float_4-3a.c.cil.c [2025-02-05 10:40:03,748 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:40:03,749 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG soft_float_4-3a.c.cil.c that has 4 procedures, 55 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 10:40:03,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:40:03,790 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;@638cf3d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:40:03,790 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:40:03,792 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 40 states have (on average 1.425) internal successors, (57), 42 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 10:40:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-05 10:40:03,797 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:03,797 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:03,797 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:03,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:03,800 INFO L85 PathProgramCache]: Analyzing trace with hash -66817531, now seen corresponding path program 1 times [2025-02-05 10:40:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:40:03,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1186378744] [2025-02-05 10:40:03,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:03,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:03,810 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:40:03,810 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:40:03,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-05 10:40:03,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-05 10:40:03,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:03,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:03,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:40:03,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:04,005 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:40:04,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:40:04,066 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:40:04,067 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:40:04,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186378744] [2025-02-05 10:40:04,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186378744] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 10:40:04,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 10:40:04,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2025-02-05 10:40:04,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558652181] [2025-02-05 10:40:04,070 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 10:40:04,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:40:04,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:40:04,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:40:04,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:40:04,085 INFO L87 Difference]: Start difference. First operand has 55 states, 40 states have (on average 1.425) internal successors, (57), 42 states have internal predecessors, (57), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:40:04,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:04,204 INFO L93 Difference]: Finished difference Result 130 states and 193 transitions. [2025-02-05 10:40:04,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:40:04,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2025-02-05 10:40:04,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:04,210 INFO L225 Difference]: With dead ends: 130 [2025-02-05 10:40:04,210 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 10:40:04,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:40:04,214 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:04,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 510 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:40:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 10:40:04,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 63. [2025-02-05 10:40:04,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 48 states have internal predecessors, (60), 11 states have call successors, (11), 4 states have call predecessors, (11), 5 states have return successors, (14), 10 states have call predecessors, (14), 10 states have call successors, (14) [2025-02-05 10:40:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2025-02-05 10:40:04,248 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 31 [2025-02-05 10:40:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:04,249 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2025-02-05 10:40:04,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 10:40:04,249 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2025-02-05 10:40:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 10:40:04,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:04,250 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:04,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:40:04,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:04,451 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:04,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:04,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1493827477, now seen corresponding path program 1 times [2025-02-05 10:40:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:40:04,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1213980538] [2025-02-05 10:40:04,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:04,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:04,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:04,454 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:40:04,455 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:40:04,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:40:04,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:40:04,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:04,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:04,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 10:40:04,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:04,626 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:40:04,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 10:40:04,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:40:04,720 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:40:04,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213980538] [2025-02-05 10:40:04,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213980538] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 10:40:04,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:40:04,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 16 [2025-02-05 10:40:04,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373160390] [2025-02-05 10:40:04,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:04,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:40:04,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:40:04,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:40:04,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-02-05 10:40:04,722 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:40:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:04,818 INFO L93 Difference]: Finished difference Result 127 states and 171 transitions. [2025-02-05 10:40:04,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 10:40:04,821 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-05 10:40:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:04,822 INFO L225 Difference]: With dead ends: 127 [2025-02-05 10:40:04,822 INFO L226 Difference]: Without dead ends: 95 [2025-02-05 10:40:04,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:40:04,823 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 23 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:04,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 500 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:40:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-02-05 10:40:04,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 88. [2025-02-05 10:40:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.28125) internal successors, (82), 66 states have internal predecessors, (82), 16 states have call successors, (16), 6 states have call predecessors, (16), 7 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2025-02-05 10:40:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 117 transitions. [2025-02-05 10:40:04,837 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 117 transitions. Word has length 35 [2025-02-05 10:40:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:04,837 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 117 transitions. [2025-02-05 10:40:04,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:40:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 117 transitions. [2025-02-05 10:40:04,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-05 10:40:04,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:04,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:04,845 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:40:05,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:05,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:05,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1465198326, now seen corresponding path program 1 times [2025-02-05 10:40:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:40:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [302596160] [2025-02-05 10:40:05,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:05,047 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:40:05,048 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:40:05,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-05 10:40:05,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-05 10:40:05,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:05,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:05,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 10:40:05,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:05,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:40:05,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:05,131 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:40:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302596160] [2025-02-05 10:40:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302596160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 10:40:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121040638] [2025-02-05 10:40:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:05,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 10:40:05,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:40:05,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 10:40:05,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 10:40:05,132 INFO L87 Difference]: Start difference. First operand 88 states and 117 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:40:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:05,206 INFO L93 Difference]: Finished difference Result 126 states and 167 transitions. [2025-02-05 10:40:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 10:40:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-02-05 10:40:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:05,208 INFO L225 Difference]: With dead ends: 126 [2025-02-05 10:40:05,208 INFO L226 Difference]: Without dead ends: 86 [2025-02-05 10:40:05,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:40:05,209 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 12 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:05,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 419 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:05,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-05 10:40:05,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2025-02-05 10:40:05,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 54 states have internal predecessors, (66), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-02-05 10:40:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2025-02-05 10:40:05,216 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 35 [2025-02-05 10:40:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:05,216 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2025-02-05 10:40:05,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:40:05,217 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2025-02-05 10:40:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:40:05,217 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:05,217 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:05,223 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:40:05,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:05,418 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:05,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:05,419 INFO L85 PathProgramCache]: Analyzing trace with hash -648171360, now seen corresponding path program 1 times [2025-02-05 10:40:05,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:40:05,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [608458156] [2025-02-05 10:40:05,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:05,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:05,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:05,422 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:40:05,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 10:40:05,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-05 10:40:05,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-05 10:40:05,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:05,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:05,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-05 10:40:05,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:05,507 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-05 10:40:05,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:05,507 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:40:05,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608458156] [2025-02-05 10:40:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608458156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:05,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:05,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-05 10:40:05,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368542940] [2025-02-05 10:40:05,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:05,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-05 10:40:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:40:05,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-05 10:40:05,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-02-05 10:40:05,509 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:40:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:05,590 INFO L93 Difference]: Finished difference Result 108 states and 142 transitions. [2025-02-05 10:40:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 10:40:05,591 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2025-02-05 10:40:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:05,591 INFO L225 Difference]: With dead ends: 108 [2025-02-05 10:40:05,591 INFO L226 Difference]: Without dead ends: 85 [2025-02-05 10:40:05,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:40:05,592 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 13 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:05,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 501 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 10:40:05,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-05 10:40:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2025-02-05 10:40:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 60 states have internal predecessors, (73), 13 states have call successors, (13), 6 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2025-02-05 10:40:05,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2025-02-05 10:40:05,605 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 39 [2025-02-05 10:40:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:05,605 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2025-02-05 10:40:05,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 7 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-05 10:40:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2025-02-05 10:40:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-05 10:40:05,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:05,606 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:05,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 10:40:05,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:05,807 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:05,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:05,807 INFO L85 PathProgramCache]: Analyzing trace with hash 80104005, now seen corresponding path program 2 times [2025-02-05 10:40:05,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:40:05,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [493985454] [2025-02-05 10:40:05,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 10:40:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:05,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:05,810 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:40:05,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 10:40:05,836 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-05 10:40:05,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 39 statements. [2025-02-05 10:40:05,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 10:40:05,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:05,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 10:40:05,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:05,978 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-05 10:40:05,978 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:40:05,978 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-05 10:40:05,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493985454] [2025-02-05 10:40:05,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493985454] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:40:05,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:40:05,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-05 10:40:05,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267580915] [2025-02-05 10:40:05,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:40:05,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 10:40:05,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-05 10:40:05,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 10:40:05,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-02-05 10:40:05,979 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:40:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:40:06,169 INFO L93 Difference]: Finished difference Result 154 states and 203 transitions. [2025-02-05 10:40:06,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 10:40:06,170 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-02-05 10:40:06,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:40:06,171 INFO L225 Difference]: With dead ends: 154 [2025-02-05 10:40:06,173 INFO L226 Difference]: Without dead ends: 122 [2025-02-05 10:40:06,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2025-02-05 10:40:06,174 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 38 mSDsluCounter, 821 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:40:06,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 909 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:40:06,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-05 10:40:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 112. [2025-02-05 10:40:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 85 states have internal predecessors, (102), 18 states have call successors, (18), 9 states have call predecessors, (18), 11 states have return successors, (25), 17 states have call predecessors, (25), 17 states have call successors, (25) [2025-02-05 10:40:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 145 transitions. [2025-02-05 10:40:06,199 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 145 transitions. Word has length 39 [2025-02-05 10:40:06,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:40:06,200 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 145 transitions. [2025-02-05 10:40:06,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-05 10:40:06,200 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 145 transitions. [2025-02-05 10:40:06,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-05 10:40:06,201 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:40:06,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:40:06,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 10:40:06,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:06,402 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:40:06,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:40:06,402 INFO L85 PathProgramCache]: Analyzing trace with hash 479262074, now seen corresponding path program 1 times [2025-02-05 10:40:06,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-05 10:40:06,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1599596560] [2025-02-05 10:40:06,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:40:06,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:40:06,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:40:06,404 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:40:06,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 10:40:06,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-05 10:40:06,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-05 10:40:06,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:40:06,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:40:06,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 10:40:06,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:40:07,775 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_base2flt_~m_37 (_ BitVec 32))) (= (bvshl v_base2flt_~m_37 (_ bv1 32)) c_base2flt_~m)) is different from true [2025-02-05 10:40:13,128 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 10:40:13,128 INFO L312 TraceCheckSpWp]: Computing backward predicates...