./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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/nla-digbench-scaling/hard-ll_unwindbound5.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 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 20:43:35,970 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 20:43:36,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 20:43:36,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 20:43:36,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 20:43:36,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 20:43:36,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 20:43:36,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 20:43:36,045 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 20:43:36,045 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 20:43:36,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 20:43:36,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 20:43:36,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 20:43:36,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 20:43:36,046 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 20:43:36,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 20:43:36,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 20:43:36,046 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 20:43:36,046 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 20:43:36,046 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 20:43:36,046 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 20:43:36,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 20:43:36,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:43:36,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 20:43:36,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 20:43:36,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 20:43:36,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 20:43:36,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 20:43:36,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 20:43:36,049 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 -> 1eba5bc7e50ef659abfe155713ae512eb1ae4032ecb78db63a02f9acbcdf9dbe [2025-02-07 20:43:36,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 20:43:36,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 20:43:36,310 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 20:43:36,312 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 20:43:36,313 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 20:43:36,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-02-07 20:43:37,676 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46f0b7b2/35a490ac0d9c4f7794f1ca2cb4ee3323/FLAG529576e9b [2025-02-07 20:43:37,983 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 20:43:37,988 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-ll_unwindbound5.c [2025-02-07 20:43:38,000 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46f0b7b2/35a490ac0d9c4f7794f1ca2cb4ee3323/FLAG529576e9b [2025-02-07 20:43:38,281 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e46f0b7b2/35a490ac0d9c4f7794f1ca2cb4ee3323 [2025-02-07 20:43:38,282 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 20:43:38,283 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 20:43:38,285 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 20:43:38,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 20:43:38,290 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 20:43:38,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15aa2641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38, skipping insertion in model container [2025-02-07 20:43:38,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,305 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 20:43:38,424 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/nla-digbench-scaling/hard-ll_unwindbound5.c[538,551] [2025-02-07 20:43:38,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:43:38,455 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 20:43:38,466 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/nla-digbench-scaling/hard-ll_unwindbound5.c[538,551] [2025-02-07 20:43:38,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 20:43:38,484 INFO L204 MainTranslator]: Completed translation [2025-02-07 20:43:38,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38 WrapperNode [2025-02-07 20:43:38,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 20:43:38,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 20:43:38,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 20:43:38,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 20:43:38,489 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,493 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,504 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-02-07 20:43:38,504 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 20:43:38,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 20:43:38,505 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 20:43:38,505 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 20:43:38,511 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,512 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,519 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-07 20:43:38,519 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,519 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,521 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,521 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 20:43:38,524 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 20:43:38,524 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 20:43:38,524 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 20:43:38,525 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (1/1) ... [2025-02-07 20:43:38,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 20:43:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:38,556 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-07 20:43:38,558 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-07 20:43:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 20:43:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 20:43:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 20:43:38,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 20:43:38,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-07 20:43:38,573 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-07 20:43:38,611 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 20:43:38,613 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 20:43:38,732 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-07 20:43:38,732 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 20:43:38,738 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 20:43:38,738 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 20:43:38,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:43:38 BoogieIcfgContainer [2025-02-07 20:43:38,739 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 20:43:38,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 20:43:38,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 20:43:38,743 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 20:43:38,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 08:43:38" (1/3) ... [2025-02-07 20:43:38,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b56a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:43:38, skipping insertion in model container [2025-02-07 20:43:38,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 08:43:38" (2/3) ... [2025-02-07 20:43:38,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195b56a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 08:43:38, skipping insertion in model container [2025-02-07 20:43:38,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:43:38" (3/3) ... [2025-02-07 20:43:38,745 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound5.c [2025-02-07 20:43:38,754 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 20:43:38,756 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-ll_unwindbound5.c that has 2 procedures, 26 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-07 20:43:38,786 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 20:43:38,793 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;@1917ef7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 20:43:38,793 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 20:43:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-07 20:43:38,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:43:38,799 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:38,800 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:38,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:38,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1047324170, now seen corresponding path program 1 times [2025-02-07 20:43:38,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:38,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750838892] [2025-02-07 20:43:38,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:38,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:38,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:43:38,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:43:38,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:38,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:38,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:43:38,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:38,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750838892] [2025-02-07 20:43:38,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750838892] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:43:38,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:43:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 20:43:38,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41538433] [2025-02-07 20:43:38,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:38,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 20:43:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:38,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 20:43:38,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:43:38,918 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:43:38,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:38,929 INFO L93 Difference]: Finished difference Result 50 states and 84 transitions. [2025-02-07 20:43:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 20:43:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:43:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:38,934 INFO L225 Difference]: With dead ends: 50 [2025-02-07 20:43:38,934 INFO L226 Difference]: Without dead ends: 23 [2025-02-07 20:43:38,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 20:43:38,938 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:38,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:43:38,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-02-07 20:43:38,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-02-07 20:43:38,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:43:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2025-02-07 20:43:38,961 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 9 [2025-02-07 20:43:38,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:38,961 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2025-02-07 20:43:38,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:43:38,962 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2025-02-07 20:43:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-07 20:43:38,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:38,962 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:38,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 20:43:38,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:38,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1504832791, now seen corresponding path program 1 times [2025-02-07 20:43:38,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:38,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727094635] [2025-02-07 20:43:38,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:38,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:38,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-07 20:43:38,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-07 20:43:38,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:38,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:43:39,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:39,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727094635] [2025-02-07 20:43:39,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727094635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:43:39,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:43:39,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:43:39,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133336836] [2025-02-07 20:43:39,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:39,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:43:39,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:39,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:43:39,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:43:39,118 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:43:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:39,170 INFO L93 Difference]: Finished difference Result 37 states and 52 transitions. [2025-02-07 20:43:39,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:43:39,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-07 20:43:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:39,171 INFO L225 Difference]: With dead ends: 37 [2025-02-07 20:43:39,171 INFO L226 Difference]: Without dead ends: 35 [2025-02-07 20:43:39,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:43:39,172 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:39,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 100 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:43:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-02-07 20:43:39,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2025-02-07 20:43:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:43:39,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-02-07 20:43:39,178 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 9 [2025-02-07 20:43:39,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:39,179 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-02-07 20:43:39,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:43:39,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2025-02-07 20:43:39,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 20:43:39,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:39,179 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:39,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 20:43:39,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:39,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:39,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1094658190, now seen corresponding path program 1 times [2025-02-07 20:43:39,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:39,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384130281] [2025-02-07 20:43:39,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:39,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:39,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 20:43:39,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 20:43:39,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:39,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:43:39,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:39,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384130281] [2025-02-07 20:43:39,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384130281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:43:39,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:43:39,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-07 20:43:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624367252] [2025-02-07 20:43:39,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:39,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 20:43:39,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:39,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 20:43:39,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:43:39,223 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:43:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:39,236 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2025-02-07 20:43:39,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:43:39,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 20:43:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:39,237 INFO L225 Difference]: With dead ends: 43 [2025-02-07 20:43:39,237 INFO L226 Difference]: Without dead ends: 29 [2025-02-07 20:43:39,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-07 20:43:39,241 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:39,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:43:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-07 20:43:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-07 20:43:39,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:43:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-02-07 20:43:39,246 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 11 [2025-02-07 20:43:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:39,246 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-02-07 20:43:39,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 20:43:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-02-07 20:43:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-07 20:43:39,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:39,247 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:39,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-07 20:43:39,247 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:39,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:39,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1646890855, now seen corresponding path program 1 times [2025-02-07 20:43:39,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:39,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30126151] [2025-02-07 20:43:39,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:39,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:39,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-07 20:43:39,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-07 20:43:39,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:39,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:39,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 20:43:39,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:39,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30126151] [2025-02-07 20:43:39,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30126151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:43:39,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:43:39,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:43:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092486972] [2025-02-07 20:43:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:39,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:43:39,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:39,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:43:39,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:43:39,340 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:43:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:39,389 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2025-02-07 20:43:39,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:43:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-02-07 20:43:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:39,390 INFO L225 Difference]: With dead ends: 43 [2025-02-07 20:43:39,390 INFO L226 Difference]: Without dead ends: 41 [2025-02-07 20:43:39,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:43:39,391 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:39,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 97 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:43:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-07 20:43:39,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2025-02-07 20:43:39,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-07 20:43:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2025-02-07 20:43:39,396 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 14 [2025-02-07 20:43:39,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:39,397 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2025-02-07 20:43:39,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-07 20:43:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2025-02-07 20:43:39,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 20:43:39,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:39,397 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:39,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-07 20:43:39,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:39,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:39,398 INFO L85 PathProgramCache]: Analyzing trace with hash -96990935, now seen corresponding path program 1 times [2025-02-07 20:43:39,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:39,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067048408] [2025-02-07 20:43:39,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:39,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:39,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:43:39,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:43:39,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:39,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:43:39,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1526680053] [2025-02-07 20:43:39,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:39,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:39,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:39,416 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-07 20:43:39,417 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-07 20:43:39,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-07 20:43:39,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 20:43:39,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:39,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:39,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:43:39,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:39,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 20:43:39,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:43:39,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:39,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067048408] [2025-02-07 20:43:39,572 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:43:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526680053] [2025-02-07 20:43:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526680053] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:43:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:43:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:43:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067156976] [2025-02-07 20:43:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:39,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:43:39,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:39,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:43:39,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:43:39,573 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:43:39,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:39,645 INFO L93 Difference]: Finished difference Result 62 states and 84 transitions. [2025-02-07 20:43:39,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:43:39,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2025-02-07 20:43:39,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:39,646 INFO L225 Difference]: With dead ends: 62 [2025-02-07 20:43:39,646 INFO L226 Difference]: Without dead ends: 47 [2025-02-07 20:43:39,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:43:39,647 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 7 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:39,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 101 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:43:39,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-07 20:43:39,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-07 20:43:39,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-07 20:43:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2025-02-07 20:43:39,653 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 61 transitions. Word has length 19 [2025-02-07 20:43:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:39,654 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 61 transitions. [2025-02-07 20:43:39,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-07 20:43:39,654 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2025-02-07 20:43:39,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 20:43:39,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:39,654 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:39,660 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-07 20:43:39,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:39,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:39,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:39,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1104685181, now seen corresponding path program 1 times [2025-02-07 20:43:39,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:39,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724811054] [2025-02-07 20:43:39,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:39,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:39,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 20:43:39,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 20:43:39,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:39,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:43:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1884263129] [2025-02-07 20:43:39,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:39,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:39,883 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-07 20:43:39,891 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-07 20:43:39,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-07 20:43:39,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 20:43:39,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:39,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:39,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-02-07 20:43:39,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:40,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 20:43:40,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:40,163 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-07 20:43:40,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:40,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724811054] [2025-02-07 20:43:40,165 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:43:40,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884263129] [2025-02-07 20:43:40,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884263129] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:40,165 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:43:40,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2025-02-07 20:43:40,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752982623] [2025-02-07 20:43:40,165 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:40,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 20:43:40,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:40,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 20:43:40,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-07 20:43:40,166 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:43:40,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:40,249 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2025-02-07 20:43:40,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 20:43:40,249 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2025-02-07 20:43:40,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:40,252 INFO L225 Difference]: With dead ends: 65 [2025-02-07 20:43:40,252 INFO L226 Difference]: Without dead ends: 62 [2025-02-07 20:43:40,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:43:40,252 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:40,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 92 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:43:40,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-07 20:43:40,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 57. [2025-02-07 20:43:40,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 38 states have internal predecessors, (46), 15 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-02-07 20:43:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 75 transitions. [2025-02-07 20:43:40,262 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 75 transitions. Word has length 27 [2025-02-07 20:43:40,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:40,262 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 75 transitions. [2025-02-07 20:43:40,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-02-07 20:43:40,263 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 75 transitions. [2025-02-07 20:43:40,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-02-07 20:43:40,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:40,263 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:40,274 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-07 20:43:40,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:40,470 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:40,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:40,471 INFO L85 PathProgramCache]: Analyzing trace with hash -340479138, now seen corresponding path program 1 times [2025-02-07 20:43:40,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:40,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008527568] [2025-02-07 20:43:40,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:40,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:40,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 20:43:40,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:43:40,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:40,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:43:40,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008527568] [2025-02-07 20:43:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008527568] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:40,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195265073] [2025-02-07 20:43:40,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:40,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:40,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:40,614 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-07 20:43:40,615 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-07 20:43:40,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-07 20:43:40,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-07 20:43:40,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:40,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:40,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-07 20:43:40,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:40,689 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-07 20:43:40,690 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-07 20:43:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195265073] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:40,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:43:40,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-02-07 20:43:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304496890] [2025-02-07 20:43:40,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:40,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:43:40,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:40,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:43:40,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:43:40,727 INFO L87 Difference]: Start difference. First operand 57 states and 75 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-07 20:43:40,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:40,824 INFO L93 Difference]: Finished difference Result 156 states and 191 transitions. [2025-02-07 20:43:40,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:43:40,824 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 34 [2025-02-07 20:43:40,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:40,825 INFO L225 Difference]: With dead ends: 156 [2025-02-07 20:43:40,825 INFO L226 Difference]: Without dead ends: 131 [2025-02-07 20:43:40,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:43:40,826 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:40,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 151 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:43:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-02-07 20:43:40,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2025-02-07 20:43:40,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 80 states have (on average 1.2) internal successors, (96), 84 states have internal predecessors, (96), 27 states have call successors, (27), 16 states have call predecessors, (27), 16 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-07 20:43:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2025-02-07 20:43:40,846 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 34 [2025-02-07 20:43:40,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:40,846 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2025-02-07 20:43:40,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-07 20:43:40,846 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2025-02-07 20:43:40,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-07 20:43:40,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:40,847 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:40,852 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-07 20:43:41,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:41,047 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:41,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:41,048 INFO L85 PathProgramCache]: Analyzing trace with hash -75963297, now seen corresponding path program 1 times [2025-02-07 20:43:41,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:41,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908045887] [2025-02-07 20:43:41,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:41,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:41,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:43:41,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:43:41,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:41,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:43:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [756582308] [2025-02-07 20:43:41,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:41,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:41,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:41,082 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-07 20:43:41,084 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-07 20:43:41,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-07 20:43:41,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-07 20:43:41,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:41,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:41,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:43:41,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:41,190 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-07 20:43:41,191 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-07 20:43:41,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908045887] [2025-02-07 20:43:41,257 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:43:41,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [756582308] [2025-02-07 20:43:41,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [756582308] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:41,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:43:41,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-02-07 20:43:41,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957670247] [2025-02-07 20:43:41,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:41,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:43:41,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:41,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:43:41,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-07 20:43:41,258 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:43:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:41,337 INFO L93 Difference]: Finished difference Result 147 states and 175 transitions. [2025-02-07 20:43:41,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:43:41,337 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2025-02-07 20:43:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:41,338 INFO L225 Difference]: With dead ends: 147 [2025-02-07 20:43:41,338 INFO L226 Difference]: Without dead ends: 141 [2025-02-07 20:43:41,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:43:41,338 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 8 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:41,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 95 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:43:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-02-07 20:43:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2025-02-07 20:43:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.1724137931034482) internal successors, (102), 91 states have internal predecessors, (102), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2025-02-07 20:43:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2025-02-07 20:43:41,361 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 37 [2025-02-07 20:43:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:41,362 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2025-02-07 20:43:41,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-07 20:43:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2025-02-07 20:43:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-07 20:43:41,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:41,363 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 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-07 20:43:41,370 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-07 20:43:41,564 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,SelfDestructingSolverStorable7 [2025-02-07 20:43:41,565 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:41,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:41,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1939471863, now seen corresponding path program 1 times [2025-02-07 20:43:41,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:41,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508987506] [2025-02-07 20:43:41,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:41,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:41,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-07 20:43:41,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-07 20:43:41,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:41,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-02-07 20:43:41,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:41,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508987506] [2025-02-07 20:43:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508987506] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:43:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 20:43:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-07 20:43:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893190906] [2025-02-07 20:43:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:41,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:43:41,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:41,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:43:41,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:43:41,696 INFO L87 Difference]: Start difference. First operand 133 states and 156 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 20:43:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:41,730 INFO L93 Difference]: Finished difference Result 138 states and 160 transitions. [2025-02-07 20:43:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:43:41,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2025-02-07 20:43:41,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:41,731 INFO L225 Difference]: With dead ends: 138 [2025-02-07 20:43:41,731 INFO L226 Difference]: Without dead ends: 119 [2025-02-07 20:43:41,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:43:41,732 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:41,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:43:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-02-07 20:43:41,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-02-07 20:43:41,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 78 states have (on average 1.1794871794871795) internal successors, (92), 81 states have internal predecessors, (92), 25 states have call successors, (25), 16 states have call predecessors, (25), 15 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-07 20:43:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2025-02-07 20:43:41,744 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 43 [2025-02-07 20:43:41,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:41,744 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2025-02-07 20:43:41,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-02-07 20:43:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2025-02-07 20:43:41,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-07 20:43:41,745 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:41,745 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:41,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-07 20:43:41,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:41,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:41,746 INFO L85 PathProgramCache]: Analyzing trace with hash 199968548, now seen corresponding path program 1 times [2025-02-07 20:43:41,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:41,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142922926] [2025-02-07 20:43:41,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:41,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:41,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 20:43:41,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 20:43:41,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:41,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:41,804 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 20:43:41,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142922926] [2025-02-07 20:43:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142922926] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455251341] [2025-02-07 20:43:41,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:41,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:41,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:41,807 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-07 20:43:41,812 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-07 20:43:41,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-07 20:43:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-07 20:43:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:41,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:41,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:43:41,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-07 20:43:41,907 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-07 20:43:41,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455251341] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:41,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:43:41,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 9 [2025-02-07 20:43:41,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390688643] [2025-02-07 20:43:41,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:41,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-07 20:43:41,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:41,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-07 20:43:41,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-02-07 20:43:41,975 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-07 20:43:42,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:42,092 INFO L93 Difference]: Finished difference Result 195 states and 233 transitions. [2025-02-07 20:43:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 20:43:42,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) Word has length 50 [2025-02-07 20:43:42,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:42,094 INFO L225 Difference]: With dead ends: 195 [2025-02-07 20:43:42,094 INFO L226 Difference]: Without dead ends: 174 [2025-02-07 20:43:42,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-07 20:43:42,094 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:42,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 150 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:43:42,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-07 20:43:42,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 169. [2025-02-07 20:43:42,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.1801801801801801) internal successors, (131), 117 states have internal predecessors, (131), 37 states have call successors, (37), 21 states have call predecessors, (37), 20 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2025-02-07 20:43:42,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2025-02-07 20:43:42,120 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 50 [2025-02-07 20:43:42,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:42,121 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2025-02-07 20:43:42,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 5 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (20), 5 states have call predecessors, (20), 5 states have call successors, (20) [2025-02-07 20:43:42,121 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2025-02-07 20:43:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-07 20:43:42,121 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:42,122 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:42,127 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-07 20:43:42,326 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-07 20:43:42,326 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:42,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:42,327 INFO L85 PathProgramCache]: Analyzing trace with hash 422036686, now seen corresponding path program 1 times [2025-02-07 20:43:42,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:42,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084954952] [2025-02-07 20:43:42,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:42,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:42,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-07 20:43:42,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-07 20:43:42,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:42,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:43:42,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140907680] [2025-02-07 20:43:42,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:42,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:42,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:42,363 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-07 20:43:42,364 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-07 20:43:42,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-07 20:43:42,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-07 20:43:42,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:42,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:42,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-07 20:43:42,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-07 20:43:42,888 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:44,776 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-07 20:43:44,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084954952] [2025-02-07 20:43:44,777 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:43:44,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140907680] [2025-02-07 20:43:44,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140907680] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:44,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:43:44,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2025-02-07 20:43:44,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080116498] [2025-02-07 20:43:44,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:44,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 20:43:44,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:44,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 20:43:44,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2025-02-07 20:43:44,778 INFO L87 Difference]: Start difference. First operand 169 states and 202 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-07 20:43:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:45,674 INFO L93 Difference]: Finished difference Result 282 states and 360 transitions. [2025-02-07 20:43:45,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-07 20:43:45,675 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 59 [2025-02-07 20:43:45,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:45,677 INFO L225 Difference]: With dead ends: 282 [2025-02-07 20:43:45,677 INFO L226 Difference]: Without dead ends: 229 [2025-02-07 20:43:45,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=152, Invalid=550, Unknown=0, NotChecked=0, Total=702 [2025-02-07 20:43:45,678 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 111 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:45,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 349 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-07 20:43:45,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-02-07 20:43:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2025-02-07 20:43:45,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 133 states have (on average 1.1879699248120301) internal successors, (158), 139 states have internal predecessors, (158), 39 states have call successors, (39), 24 states have call predecessors, (39), 24 states have return successors, (37), 33 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-07 20:43:45,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 234 transitions. [2025-02-07 20:43:45,700 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 234 transitions. Word has length 59 [2025-02-07 20:43:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:45,700 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 234 transitions. [2025-02-07 20:43:45,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 16 states have internal predecessors, (38), 8 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2025-02-07 20:43:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 234 transitions. [2025-02-07 20:43:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-07 20:43:45,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:45,701 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:45,707 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-07 20:43:45,901 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-07 20:43:45,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:45,902 INFO L85 PathProgramCache]: Analyzing trace with hash 974787214, now seen corresponding path program 1 times [2025-02-07 20:43:45,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:45,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76549644] [2025-02-07 20:43:45,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:45,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 20:43:45,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 20:43:45,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:45,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:43:45,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230374259] [2025-02-07 20:43:45,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:45,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:45,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:45,935 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-07 20:43:45,936 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-07 20:43:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-07 20:43:45,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-07 20:43:45,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:45,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:45,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-07 20:43:45,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:46,478 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:43:46,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 20 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:43:47,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76549644] [2025-02-07 20:43:47,022 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:43:47,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230374259] [2025-02-07 20:43:47,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230374259] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:47,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:43:47,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2025-02-07 20:43:47,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218968270] [2025-02-07 20:43:47,023 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:47,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-07 20:43:47,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:47,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-07 20:43:47,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2025-02-07 20:43:47,024 INFO L87 Difference]: Start difference. First operand 197 states and 234 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2025-02-07 20:43:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:47,575 INFO L93 Difference]: Finished difference Result 287 states and 361 transitions. [2025-02-07 20:43:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-07 20:43:47,576 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) Word has length 70 [2025-02-07 20:43:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:47,577 INFO L225 Difference]: With dead ends: 287 [2025-02-07 20:43:47,577 INFO L226 Difference]: Without dead ends: 246 [2025-02-07 20:43:47,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=696, Unknown=0, NotChecked=0, Total=870 [2025-02-07 20:43:47,578 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 69 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:47,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 472 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 20:43:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-02-07 20:43:47,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 208. [2025-02-07 20:43:47,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 141 states have (on average 1.198581560283688) internal successors, (169), 144 states have internal predecessors, (169), 42 states have call successors, (42), 25 states have call predecessors, (42), 24 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-07 20:43:47,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 251 transitions. [2025-02-07 20:43:47,608 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 251 transitions. Word has length 70 [2025-02-07 20:43:47,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:47,609 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 251 transitions. [2025-02-07 20:43:47,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 10 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (20), 8 states have call predecessors, (20), 8 states have call successors, (20) [2025-02-07 20:43:47,609 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 251 transitions. [2025-02-07 20:43:47,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-07 20:43:47,610 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:47,610 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:47,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 20:43:47,812 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-07 20:43:47,812 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:47,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1732500445, now seen corresponding path program 2 times [2025-02-07 20:43:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785932953] [2025-02-07 20:43:47,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:43:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:47,818 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-07 20:43:47,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 20:43:47,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:43:47,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:48,002 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:43:48,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:48,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785932953] [2025-02-07 20:43:48,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785932953] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:48,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848396345] [2025-02-07 20:43:48,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:43:48,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:48,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:48,004 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-07 20:43:48,006 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-07 20:43:48,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 2 equivalence classes. [2025-02-07 20:43:48,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 73 of 73 statements. [2025-02-07 20:43:48,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:43:48,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:48,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-07 20:43:48,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:48,107 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:43:48,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-02-07 20:43:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848396345] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:48,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:43:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-07 20:43:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514715672] [2025-02-07 20:43:48,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:48,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:43:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:48,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:43:48,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:43:48,223 INFO L87 Difference]: Start difference. First operand 208 states and 251 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-07 20:43:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:48,295 INFO L93 Difference]: Finished difference Result 232 states and 284 transitions. [2025-02-07 20:43:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 20:43:48,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 73 [2025-02-07 20:43:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:48,297 INFO L225 Difference]: With dead ends: 232 [2025-02-07 20:43:48,297 INFO L226 Difference]: Without dead ends: 203 [2025-02-07 20:43:48,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-07 20:43:48,298 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:48,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:43:48,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2025-02-07 20:43:48,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2025-02-07 20:43:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 136 states have (on average 1.1911764705882353) internal successors, (162), 139 states have internal predecessors, (162), 42 states have call successors, (42), 25 states have call predecessors, (42), 24 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-02-07 20:43:48,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 244 transitions. [2025-02-07 20:43:48,334 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 244 transitions. Word has length 73 [2025-02-07 20:43:48,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:48,334 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 244 transitions. [2025-02-07 20:43:48,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-02-07 20:43:48,335 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 244 transitions. [2025-02-07 20:43:48,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-07 20:43:48,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:48,335 INFO L218 NwaCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:48,344 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-07 20:43:48,536 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-07 20:43:48,536 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:48,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash -307234476, now seen corresponding path program 1 times [2025-02-07 20:43:48,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:48,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691638814] [2025-02-07 20:43:48,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:48,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:48,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 20:43:48,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 20:43:48,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:48,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:48,712 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-07 20:43:48,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691638814] [2025-02-07 20:43:48,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691638814] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:48,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231805810] [2025-02-07 20:43:48,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:48,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:48,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:48,716 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-07 20:43:48,717 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-07 20:43:48,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-02-07 20:43:48,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-02-07 20:43:48,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:48,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:48,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-02-07 20:43:48,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:48,991 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-07 20:43:48,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-02-07 20:43:49,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231805810] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:49,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:43:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 8] total 17 [2025-02-07 20:43:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250876133] [2025-02-07 20:43:49,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:49,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 20:43:49,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:49,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 20:43:49,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2025-02-07 20:43:49,294 INFO L87 Difference]: Start difference. First operand 203 states and 244 transitions. Second operand has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-02-07 20:43:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:49,490 INFO L93 Difference]: Finished difference Result 217 states and 264 transitions. [2025-02-07 20:43:49,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-07 20:43:49,490 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) Word has length 75 [2025-02-07 20:43:49,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:49,492 INFO L225 Difference]: With dead ends: 217 [2025-02-07 20:43:49,492 INFO L226 Difference]: Without dead ends: 192 [2025-02-07 20:43:49,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 140 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-02-07 20:43:49,493 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 31 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:49,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 360 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:43:49,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-07 20:43:49,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2025-02-07 20:43:49,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 123 states have (on average 1.2032520325203253) internal successors, (148), 126 states have internal predecessors, (148), 38 states have call successors, (38), 23 states have call predecessors, (38), 22 states have return successors, (36), 34 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-07 20:43:49,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 222 transitions. [2025-02-07 20:43:49,517 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 222 transitions. Word has length 75 [2025-02-07 20:43:49,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:49,517 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 222 transitions. [2025-02-07 20:43:49,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.823529411764706) internal successors, (48), 15 states have internal predecessors, (48), 9 states have call successors, (30), 3 states have call predecessors, (30), 1 states have return successors, (28), 9 states have call predecessors, (28), 9 states have call successors, (28) [2025-02-07 20:43:49,517 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 222 transitions. [2025-02-07 20:43:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-07 20:43:49,519 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:49,519 INFO L218 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:49,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-07 20:43:49,719 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-07 20:43:49,720 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:49,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:49,720 INFO L85 PathProgramCache]: Analyzing trace with hash -930966795, now seen corresponding path program 1 times [2025-02-07 20:43:49,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:49,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835352967] [2025-02-07 20:43:49,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:49,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:49,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 20:43:49,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 20:43:49,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:49,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-02-07 20:43:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835352967] [2025-02-07 20:43:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835352967] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708157096] [2025-02-07 20:43:49,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:49,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:49,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:49,830 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-07 20:43:49,832 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-07 20:43:49,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-07 20:43:49,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-07 20:43:49,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:49,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:49,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-07 20:43:49,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-02-07 20:43:49,897 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-07 20:43:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708157096] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 20:43:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-07 20:43:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2025-02-07 20:43:49,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973622274] [2025-02-07 20:43:49,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 20:43:49,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-07 20:43:49,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:49,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-07 20:43:49,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:43:49,899 INFO L87 Difference]: Start difference. First operand 184 states and 222 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-07 20:43:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:49,960 INFO L93 Difference]: Finished difference Result 205 states and 248 transitions. [2025-02-07 20:43:49,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-07 20:43:49,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 79 [2025-02-07 20:43:49,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:49,962 INFO L225 Difference]: With dead ends: 205 [2025-02-07 20:43:49,962 INFO L226 Difference]: Without dead ends: 185 [2025-02-07 20:43:49,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-07 20:43:49,963 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 18 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:49,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 81 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 20:43:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-02-07 20:43:49,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2025-02-07 20:43:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 119 states have (on average 1.1764705882352942) internal successors, (140), 121 states have internal predecessors, (140), 36 states have call successors, (36), 21 states have call predecessors, (36), 21 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-07 20:43:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 211 transitions. [2025-02-07 20:43:49,990 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 211 transitions. Word has length 79 [2025-02-07 20:43:49,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:49,991 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 211 transitions. [2025-02-07 20:43:49,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 4 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-02-07 20:43:49,991 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 211 transitions. [2025-02-07 20:43:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-02-07 20:43:49,991 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:49,991 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:49,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-07 20:43:50,192 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-07 20:43:50,192 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:50,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1774093207, now seen corresponding path program 1 times [2025-02-07 20:43:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:50,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581866795] [2025-02-07 20:43:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:50,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-07 20:43:50,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-07 20:43:50,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:50,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-07 20:43:50,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:50,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581866795] [2025-02-07 20:43:50,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581866795] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:50,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431727665] [2025-02-07 20:43:50,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:43:50,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:50,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:50,300 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-07 20:43:50,301 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-07 20:43:50,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-02-07 20:43:50,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-02-07 20:43:50,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:43:50,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:50,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-07 20:43:50,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:50,410 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-07 20:43:50,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:43:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-07 20:43:50,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431727665] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:43:50,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:43:50,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-02-07 20:43:50,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282872303] [2025-02-07 20:43:50,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:43:50,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-07 20:43:50,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:43:50,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-07 20:43:50,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-07 20:43:50,488 INFO L87 Difference]: Start difference. First operand 177 states and 211 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-07 20:43:50,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:43:50,579 INFO L93 Difference]: Finished difference Result 247 states and 307 transitions. [2025-02-07 20:43:50,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 20:43:50,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) Word has length 88 [2025-02-07 20:43:50,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:43:50,581 INFO L225 Difference]: With dead ends: 247 [2025-02-07 20:43:50,581 INFO L226 Difference]: Without dead ends: 179 [2025-02-07 20:43:50,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 170 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2025-02-07 20:43:50,581 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 20:43:50,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 140 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 20:43:50,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-07 20:43:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2025-02-07 20:43:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 121 states have (on average 1.1735537190082646) internal successors, (142), 123 states have internal predecessors, (142), 36 states have call successors, (36), 21 states have call predecessors, (36), 21 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2025-02-07 20:43:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 213 transitions. [2025-02-07 20:43:50,606 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 213 transitions. Word has length 88 [2025-02-07 20:43:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:43:50,606 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 213 transitions. [2025-02-07 20:43:50,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 5 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 5 states have call predecessors, (26), 5 states have call successors, (26) [2025-02-07 20:43:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2025-02-07 20:43:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-07 20:43:50,607 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:43:50,607 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-07 20:43:50,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-07 20:43:50,808 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-07 20:43:50,808 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:43:50,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:43:50,809 INFO L85 PathProgramCache]: Analyzing trace with hash 112507609, now seen corresponding path program 3 times [2025-02-07 20:43:50,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:43:50,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636550306] [2025-02-07 20:43:50,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:43:50,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:43:50,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 8 equivalence classes. [2025-02-07 20:43:50,850 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 86 of 91 statements. [2025-02-07 20:43:50,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-07 20:43:50,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-02-07 20:43:51,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:43:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636550306] [2025-02-07 20:43:51,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636550306] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 20:43:51,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606325637] [2025-02-07 20:43:51,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 20:43:51,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:43:51,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:43:51,023 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-07 20:43:51,024 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-07 20:43:51,049 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 91 statements into 8 equivalence classes. [2025-02-07 20:43:51,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 63 of 91 statements. [2025-02-07 20:43:51,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-07 20:43:51,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:43:51,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-02-07 20:43:51,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:43:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-07 20:43:51,606 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:44:04,799 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 37 proven. 55 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-07 20:44:04,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606325637] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:44:04,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 20:44:04,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 12] total 32 [2025-02-07 20:44:04,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456001830] [2025-02-07 20:44:04,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 20:44:04,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-07 20:44:04,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:44:04,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-07 20:44:04,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2025-02-07 20:44:04,801 INFO L87 Difference]: Start difference. First operand 179 states and 213 transitions. Second operand has 32 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) [2025-02-07 20:44:25,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:44:25,041 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2025-02-07 20:44:25,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-02-07 20:44:25,041 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) Word has length 91 [2025-02-07 20:44:25,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:44:25,043 INFO L225 Difference]: With dead ends: 227 [2025-02-07 20:44:25,043 INFO L226 Difference]: Without dead ends: 149 [2025-02-07 20:44:25,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1165 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=731, Invalid=4239, Unknown=0, NotChecked=0, Total=4970 [2025-02-07 20:44:25,045 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 127 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 496 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2025-02-07 20:44:25,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 496 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2025-02-07 20:44:25,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-07 20:44:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 140. [2025-02-07 20:44:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 98 states have internal predecessors, (100), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-07 20:44:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2025-02-07 20:44:25,078 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 91 [2025-02-07 20:44:25,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:44:25,078 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2025-02-07 20:44:25,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.53125) internal successors, (81), 31 states have internal predecessors, (81), 17 states have call successors, (42), 4 states have call predecessors, (42), 2 states have return successors, (39), 14 states have call predecessors, (39), 14 states have call successors, (39) [2025-02-07 20:44:25,078 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2025-02-07 20:44:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-02-07 20:44:25,079 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:44:25,079 INFO L218 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:44:25,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-07 20:44:25,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-07 20:44:25,279 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:44:25,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:44:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 113311966, now seen corresponding path program 1 times [2025-02-07 20:44:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:44:25,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672154802] [2025-02-07 20:44:25,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:44:25,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:44:25,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-07 20:44:25,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-07 20:44:25,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:44:25,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:44:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [497155485] [2025-02-07 20:44:25,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 20:44:25,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:44:25,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:44:25,311 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-07 20:44:25,313 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-07 20:44:25,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-02-07 20:44:25,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-02-07 20:44:25,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:44:25,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 20:44:25,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-07 20:44:25,359 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 20:44:25,988 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-07 20:44:25,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 20:45:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 25 proven. 65 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2025-02-07 20:45:00,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 20:45:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672154802] [2025-02-07 20:45:00,648 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 20:45:00,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [497155485] [2025-02-07 20:45:00,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [497155485] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 20:45:00,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 20:45:00,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2025-02-07 20:45:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031026025] [2025-02-07 20:45:00,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 20:45:00,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-07 20:45:00,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 20:45:00,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-07 20:45:00,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=506, Unknown=0, NotChecked=0, Total=600 [2025-02-07 20:45:00,650 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 23 states have internal predecessors, (55), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-02-07 20:45:02,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 20:45:02,157 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2025-02-07 20:45:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-07 20:45:02,158 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 23 states have internal predecessors, (55), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) Word has length 91 [2025-02-07 20:45:02,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 20:45:02,159 INFO L225 Difference]: With dead ends: 156 [2025-02-07 20:45:02,159 INFO L226 Difference]: Without dead ends: 154 [2025-02-07 20:45:02,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-02-07 20:45:02,159 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-07 20:45:02,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 453 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-07 20:45:02,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-07 20:45:02,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2025-02-07 20:45:02,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 99 states have internal predecessors, (102), 24 states have call successors, (24), 20 states have call predecessors, (24), 20 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-07 20:45:02,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 149 transitions. [2025-02-07 20:45:02,184 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 149 transitions. Word has length 91 [2025-02-07 20:45:02,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 20:45:02,184 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 149 transitions. [2025-02-07 20:45:02,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 23 states have internal predecessors, (55), 13 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 10 states have call predecessors, (26), 11 states have call successors, (26) [2025-02-07 20:45:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 149 transitions. [2025-02-07 20:45:02,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-07 20:45:02,186 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 20:45:02,187 INFO L218 NwaCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:45:02,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-07 20:45:02,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-07 20:45:02,391 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 20:45:02,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 20:45:02,392 INFO L85 PathProgramCache]: Analyzing trace with hash -2033630273, now seen corresponding path program 2 times [2025-02-07 20:45:02,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 20:45:02,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413779528] [2025-02-07 20:45:02,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:45:02,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 20:45:02,396 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-07 20:45:02,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-07 20:45:02,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:45:02,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 20:45:02,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1083773072] [2025-02-07 20:45:02,411 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 20:45:02,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:45:02,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 20:45:02,413 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 20:45:02,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-07 20:45:02,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-02-07 20:45:02,459 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 95 of 95 statements. [2025-02-07 20:45:02,459 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 20:45:02,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:45:02,459 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-07 20:45:02,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-07 20:45:02,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-07 20:45:02,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 20:45:02,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-07 20:45:02,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-07 20:45:02,500 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-07 20:45:02,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-07 20:45:02,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-07 20:45:02,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 20:45:02,705 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 20:45:02,734 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-07 20:45:02,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.02 08:45:02 BoogieIcfgContainer [2025-02-07 20:45:02,738 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-07 20:45:02,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-07 20:45:02,739 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-07 20:45:02,739 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-07 20:45:02,739 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 08:43:38" (3/4) ... [2025-02-07 20:45:02,740 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-07 20:45:02,790 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 66. [2025-02-07 20:45:02,877 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-07 20:45:02,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-07 20:45:02,878 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-07 20:45:02,878 INFO L158 Benchmark]: Toolchain (without parser) took 84595.06ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 106.5MB in the beginning and 373.8MB in the end (delta: -267.3MB). Peak memory consumption was 76.2MB. Max. memory is 16.1GB. [2025-02-07 20:45:02,879 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:45:02,879 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.85ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 95.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:45:02,879 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.05ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-07 20:45:02,879 INFO L158 Benchmark]: Boogie Preprocessor took 18.50ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.7MB in the end (delta: 989.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:45:02,880 INFO L158 Benchmark]: IcfgBuilder took 215.09ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 79.1MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:45:02,880 INFO L158 Benchmark]: TraceAbstraction took 83998.05ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 79.1MB in the beginning and 381.1MB in the end (delta: -301.9MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2025-02-07 20:45:02,880 INFO L158 Benchmark]: Witness Printer took 139.23ms. Allocated memory is still 486.5MB. Free memory was 381.1MB in the beginning and 373.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-07 20:45:02,881 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.31ms. Allocated memory is still 201.3MB. Free memory is still 115.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.85ms. Allocated memory is still 142.6MB. Free memory was 106.5MB in the beginning and 95.2MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.05ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 93.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.50ms. Allocated memory is still 142.6MB. Free memory was 93.7MB in the beginning and 92.7MB in the end (delta: 989.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 215.09ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 79.1MB in the end (delta: 13.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 83998.05ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 79.1MB in the beginning and 381.1MB in the end (delta: -301.9MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * Witness Printer took 139.23ms. Allocated memory is still 486.5MB. Free memory was 381.1MB in the beginning and 373.8MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 17]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] unsigned int A, B; [L25] long long r, d, p, q; [L26] A = __VERIFIER_nondet_uint() [L27] B = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(B >= 1) [L12] COND FALSE !(!cond) VAL [counter=0] [L28] RET assume_abort_if_not(B >= 1) [L30] r = A [L31] d = B [L32] p = 1 [L33] q = 0 VAL [A=4, B=1, counter=0, d=1, p=1, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=1] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=1, d=1, p=1, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=1, d=2, p=2, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=2] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=2, d=2, p=2, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=2, d=4, p=4, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=3] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=3, d=4, p=4, q=0, r=4] [L39] COND FALSE !(!(r >= d)) [L41] d = 2 * d [L42] p = 2 * p VAL [A=4, B=1, counter=3, d=8, p=8, q=0, r=4] [L35] COND TRUE counter++<5 [L35] EXPR counter++ VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L35] COND TRUE counter++<5 [L36] CALL __VERIFIER_assert(q == 0) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L36] RET __VERIFIER_assert(q == 0) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L37] CALL __VERIFIER_assert(r == A) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L37] RET __VERIFIER_assert(r == A) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L38] CALL __VERIFIER_assert(d == B * p) VAL [\old(cond)=1, counter=4] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L38] RET __VERIFIER_assert(d == B * p) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L39] COND TRUE !(r >= d) VAL [A=4, B=1, counter=4, d=8, p=8, q=0, r=4] [L45] COND TRUE counter++<5 [L45] EXPR counter++ VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L45] COND TRUE counter++<5 [L46] CALL __VERIFIER_assert(A == q*B + r) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L46] RET __VERIFIER_assert(A == q*B + r) VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L47] CALL __VERIFIER_assert(d == B*p) VAL [\old(cond)=1, counter=5] [L15] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L47] RET __VERIFIER_assert(d == B*p) VAL [A=4, B=1, counter=5, d=8, p=8, q=0, r=4] [L49] COND FALSE !(!(p != 1)) [L51] d = d / 2 [L52] p = p / 2 VAL [A=4, B=1, counter=5, d=4, p=4, q=0, r=4] [L53] COND TRUE r >= d [L54] r = r - d [L55] q = q + p VAL [A=4, B=1, counter=5, d=4, p=4, q=4, r=0] [L45] COND TRUE counter++<5 [L45] EXPR counter++ VAL [A=4, B=1, counter=6, d=4, p=4, q=4, r=0] [L45] COND FALSE !(counter++<5) [L59] CALL __VERIFIER_assert(A == d*q + r) VAL [\old(cond)=0, counter=6] [L15] COND TRUE !(cond) VAL [\old(cond)=0, counter=6] [L17] reach_error() VAL [\old(cond)=0, counter=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 83.9s, OverallIterations: 19, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 587 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 540 mSDsluCounter, 3473 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2844 mSDsCounter, 391 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2854 IncrementalHoareTripleChecker+Invalid, 3245 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 391 mSolverCounterUnsat, 629 mSDtfsCounter, 2854 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1615 GetRequests, 1368 SyntacticMatches, 11 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1662 ImplicationChecksByTransitivity, 26.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=12, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 148 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 55.2s InterpolantComputationTime, 1862 NumberOfCodeBlocks, 1829 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 2028 ConstructedInterpolants, 0 QuantifiedInterpolants, 38341 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1973 ConjunctsInSsa, 243 ConjunctsInUnsatCore, 36 InterpolantComputations, 8 PerfectInterpolantSequences, 5558/6345 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 proved your program to be incorrect! [2025-02-07 20:45:03,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE