./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound50.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 9692f5b55a240b01d2d0c222255869fb052ffe02a605ab1c8e72ef46a070f8cd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:19:33,615 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:19:33,684 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:19:33,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:19:33,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:19:33,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:19:33,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:19:33,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:19:33,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:19:33,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:19:33,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:19:33,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:19:33,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:19:33,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:19:33,721 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:19:33,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:19:33,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:19:33,722 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:19:33,723 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:19:33,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:19:33,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:19:33,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:19:33,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:19:33,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:19:33,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:19:33,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:19:33,724 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 -> 9692f5b55a240b01d2d0c222255869fb052ffe02a605ab1c8e72ef46a070f8cd [2025-02-05 15:19:33,982 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:19:33,988 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:19:33,990 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:19:33,991 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:19:33,991 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:19:33,993 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound50.c [2025-02-05 15:19:35,230 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79af015f8/bfc8cd03b7184507976aff12388d95c9/FLAG95a2316b4 [2025-02-05 15:19:35,460 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:19:35,460 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound50.c [2025-02-05 15:19:35,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79af015f8/bfc8cd03b7184507976aff12388d95c9/FLAG95a2316b4 [2025-02-05 15:19:35,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/79af015f8/bfc8cd03b7184507976aff12388d95c9 [2025-02-05 15:19:35,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:19:35,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:19:35,486 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:19:35,486 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:19:35,490 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:19:35,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ee6540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35, skipping insertion in model container [2025-02-05 15:19:35,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:19:35,638 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-u_unwindbound50.c[537,550] [2025-02-05 15:19:35,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:19:35,667 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:19:35,677 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-u_unwindbound50.c[537,550] [2025-02-05 15:19:35,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:19:35,700 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:19:35,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35 WrapperNode [2025-02-05 15:19:35,702 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:19:35,703 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:19:35,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:19:35,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:19:35,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,729 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-02-05 15:19:35,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:19:35,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:19:35,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:19:35,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:19:35,737 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,737 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,743 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,753 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 15:19:35,754 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,754 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,760 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,763 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:19:35,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:19:35,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:19:35,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:19:35,769 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (1/1) ... [2025-02-05 15:19:35,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:19:35,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:35,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:19:35,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:19:35,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:19:35,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:19:35,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:19:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:19:35,819 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:19:35,819 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:19:35,861 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:19:35,863 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:19:35,995 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-05 15:19:35,996 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:19:36,002 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:19:36,003 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:19:36,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:19:36 BoogieIcfgContainer [2025-02-05 15:19:36,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:19:36,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:19:36,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:19:36,009 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:19:36,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:19:35" (1/3) ... [2025-02-05 15:19:36,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450e898d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:19:36, skipping insertion in model container [2025-02-05 15:19:36,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:19:35" (2/3) ... [2025-02-05 15:19:36,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@450e898d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:19:36, skipping insertion in model container [2025-02-05 15:19:36,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:19:36" (3/3) ... [2025-02-05 15:19:36,012 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound50.c [2025-02-05 15:19:36,023 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:19:36,024 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-u_unwindbound50.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:19:36,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:19:36,079 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;@243b2790, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:19:36,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:19:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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-05 15:19:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:19:36,089 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:36,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:36,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:36,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash -841661746, now seen corresponding path program 1 times [2025-02-05 15:19:36,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:36,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179822772] [2025-02-05 15:19:36,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:36,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:19:36,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:19:36,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:36,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:36,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-05 15:19:36,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:36,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179822772] [2025-02-05 15:19:36,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179822772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:36,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:36,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:19:36,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798144137] [2025-02-05 15:19:36,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:36,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:19:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:36,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:19:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:19:36,243 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 19 states have internal predecessors, (28), 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.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 15:19:36,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:36,257 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2025-02-05 15:19:36,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:19:36,260 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 10 [2025-02-05 15:19:36,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:36,265 INFO L225 Difference]: With dead ends: 53 [2025-02-05 15:19:36,265 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 15:19:36,268 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-05 15:19:36,272 INFO L435 NwaCegarLoop]: 38 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, 38 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-05 15:19:36,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:19:36,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 15:19:36,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-05 15:19:36,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 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-05 15:19:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-02-05 15:19:36,301 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2025-02-05 15:19:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:36,301 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-02-05 15:19:36,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-05 15:19:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2025-02-05 15:19:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:19:36,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:36,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:36,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:19:36,302 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:36,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:36,303 INFO L85 PathProgramCache]: Analyzing trace with hash 901148589, now seen corresponding path program 1 times [2025-02-05 15:19:36,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:36,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389908889] [2025-02-05 15:19:36,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:36,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:36,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:19:36,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:19:36,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:36,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:19:36,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:36,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389908889] [2025-02-05 15:19:36,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389908889] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:36,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:36,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:19:36,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127732028] [2025-02-05 15:19:36,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:36,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:19:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:36,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:19:36,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:19:36,503 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-05 15:19:36,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:36,581 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-02-05 15:19:36,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:19:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 10 [2025-02-05 15:19:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:36,583 INFO L225 Difference]: With dead ends: 38 [2025-02-05 15:19:36,583 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 15:19:36,583 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-05 15:19:36,585 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 104 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-05 15:19:36,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 104 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:19:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 15:19:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2025-02-05 15:19:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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-05 15:19:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-05 15:19:36,595 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-02-05 15:19:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:36,598 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-05 15:19:36,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-05 15:19:36,598 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-02-05 15:19:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 15:19:36,599 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:36,599 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:36,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:19:36,599 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:36,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:36,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1774160750, now seen corresponding path program 1 times [2025-02-05 15:19:36,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:36,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364170021] [2025-02-05 15:19:36,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:36,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:36,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 15:19:36,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-05 15:19:36,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:36,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 15:19:36,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:36,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364170021] [2025-02-05 15:19:36,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364170021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:36,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:36,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:19:36,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090764903] [2025-02-05 15:19:36,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:36,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:19:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:36,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:19:36,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:19:36,686 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-05 15:19:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:36,708 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2025-02-05 15:19:36,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:19:36,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2025-02-05 15:19:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:36,710 INFO L225 Difference]: With dead ends: 44 [2025-02-05 15:19:36,710 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 15:19:36,711 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-05 15:19:36,712 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 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-05 15:19:36,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:19:36,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 15:19:36,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-05 15:19:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 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-05 15:19:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-02-05 15:19:36,722 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2025-02-05 15:19:36,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:36,723 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-02-05 15:19:36,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-05 15:19:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-02-05 15:19:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 15:19:36,725 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:36,725 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:36,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:19:36,725 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:36,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1142350440, now seen corresponding path program 1 times [2025-02-05 15:19:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:36,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803529553] [2025-02-05 15:19:36,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:36,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:36,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 15:19:36,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 15:19:36,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:36,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:36,953 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-05 15:19:36,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:36,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803529553] [2025-02-05 15:19:36,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803529553] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:36,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:36,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:19:36,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173702109] [2025-02-05 15:19:36,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:36,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:19:36,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:36,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:19:36,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:19:36,955 INFO L87 Difference]: Start difference. First operand 30 states and 39 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, (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-05 15:19:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:37,041 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-02-05 15:19:37,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:19:37,042 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, (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 15 [2025-02-05 15:19:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:37,042 INFO L225 Difference]: With dead ends: 44 [2025-02-05 15:19:37,043 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 15:19:37,043 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-05 15:19:37,043 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:37,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:19:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 15:19:37,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-02-05 15:19:37,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 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-05 15:19:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-02-05 15:19:37,054 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2025-02-05 15:19:37,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:37,055 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-02-05 15:19:37,055 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, (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-05 15:19:37,055 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-02-05 15:19:37,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 15:19:37,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:37,055 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:37,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:19:37,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:37,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash 205542093, now seen corresponding path program 1 times [2025-02-05 15:19:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:37,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370488405] [2025-02-05 15:19:37,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:37,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 15:19:37,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 15:19:37,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:37,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:37,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403553286] [2025-02-05 15:19:37,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:37,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:37,083 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:19:37,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:19:37,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 15:19:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 15:19:37,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:37,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:37,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:19:37,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:37,340 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-05 15:19:37,341 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:19:37,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:37,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370488405] [2025-02-05 15:19:37,342 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:19:37,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403553286] [2025-02-05 15:19:37,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403553286] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:37,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:37,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:19:37,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234637171] [2025-02-05 15:19:37,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:37,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:19:37,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:37,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:19:37,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:19:37,344 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-05 15:19:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:37,486 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2025-02-05 15:19:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:19:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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 20 [2025-02-05 15:19:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:37,488 INFO L225 Difference]: With dead ends: 63 [2025-02-05 15:19:37,488 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 15:19:37,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:19:37,489 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 21 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:37,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 129 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:19:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 15:19:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-05 15:19:37,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 32 states have internal predecessors, (38), 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-05 15:19:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-02-05 15:19:37,499 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2025-02-05 15:19:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:37,499 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-02-05 15:19:37,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 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-05 15:19:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-02-05 15:19:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 15:19:37,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:37,500 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, 1] [2025-02-05 15:19:37,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:19:37,704 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-05 15:19:37,704 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:37,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:37,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1822786374, now seen corresponding path program 1 times [2025-02-05 15:19:37,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:37,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572170314] [2025-02-05 15:19:37,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:37,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 15:19:37,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 15:19:37,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:37,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:37,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [305393067] [2025-02-05 15:19:37,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:37,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:37,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:19:37,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:19:37,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 15:19:37,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 15:19:37,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:37,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:37,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:19:37,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 15:19:37,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:38,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:38,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572170314] [2025-02-05 15:19:38,364 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:19:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305393067] [2025-02-05 15:19:38,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305393067] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:38,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:19:38,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-05 15:19:38,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340932695] [2025-02-05 15:19:38,364 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 15:19:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:19:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:38,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:19:38,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:19:38,366 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:19:38,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:38,658 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-02-05 15:19:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:19:38,658 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-02-05 15:19:38,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:38,659 INFO L225 Difference]: With dead ends: 64 [2025-02-05 15:19:38,659 INFO L226 Difference]: Without dead ends: 50 [2025-02-05 15:19:38,660 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-05 15:19:38,660 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:38,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 157 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:19:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-05 15:19:38,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-05 15:19:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 34 states have internal predecessors, (39), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-02-05 15:19:38,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-05 15:19:38,675 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 28 [2025-02-05 15:19:38,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:38,676 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-05 15:19:38,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-05 15:19:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-05 15:19:38,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 15:19:38,676 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:38,676 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:38,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:19:38,877 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-05 15:19:38,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:38,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1122995961, now seen corresponding path program 1 times [2025-02-05 15:19:38,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:38,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155048683] [2025-02-05 15:19:38,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:38,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:38,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 15:19:38,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 15:19:38,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:38,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:19:38,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155048683] [2025-02-05 15:19:38,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155048683] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:38,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640903418] [2025-02-05 15:19:38,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:38,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:38,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:38,967 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:19:38,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:19:38,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 15:19:39,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 15:19:39,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:39,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:39,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:19:39,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:19:39,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:19:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640903418] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:19:39,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:19:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-02-05 15:19:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792426292] [2025-02-05 15:19:39,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:19:39,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:19:39,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:39,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:19:39,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:19:39,116 INFO L87 Difference]: Start difference. First operand 50 states and 58 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, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:19:39,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:39,248 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-02-05 15:19:39,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:19:39,248 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, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 30 [2025-02-05 15:19:39,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:39,249 INFO L225 Difference]: With dead ends: 115 [2025-02-05 15:19:39,250 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 15:19:39,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 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-05 15:19:39,250 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:39,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 141 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:19:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 15:19:39,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-02-05 15:19:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 20 states have call successors, (20), 12 states have call predecessors, (20), 12 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-05 15:19:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2025-02-05 15:19:39,294 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 30 [2025-02-05 15:19:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:39,294 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2025-02-05 15:19:39,295 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, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:19:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2025-02-05 15:19:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 15:19:39,295 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:39,295 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:39,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:19:39,496 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-05 15:19:39,496 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:39,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:39,497 INFO L85 PathProgramCache]: Analyzing trace with hash 345705026, now seen corresponding path program 1 times [2025-02-05 15:19:39,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:39,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476867609] [2025-02-05 15:19:39,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:39,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:39,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:19:39,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:19:39,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:39,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81133897] [2025-02-05 15:19:39,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:39,539 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:19:39,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:19:39,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:19:39,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:19:39,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:39,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:39,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:19:39,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:39,713 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-05 15:19:39,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:19:39,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476867609] [2025-02-05 15:19:39,848 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:19:39,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81133897] [2025-02-05 15:19:39,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81133897] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:39,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:19:39,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-05 15:19:39,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872581828] [2025-02-05 15:19:39,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:39,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:19:39,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:39,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:19:39,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:19:39,849 INFO L87 Difference]: Start difference. First operand 95 states and 112 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:19:43,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 15:19:47,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 15:19:52,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 15:19:56,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 15:19:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:56,128 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2025-02-05 15:19:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:19:56,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-02-05 15:19:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:56,132 INFO L225 Difference]: With dead ends: 114 [2025-02-05 15:19:56,133 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 15:19:56,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-05 15:19:56,135 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:56,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 16.2s Time] [2025-02-05 15:19:56,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 15:19:56,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2025-02-05 15:19:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 70 states have (on average 1.1714285714285715) internal successors, (82), 73 states have internal predecessors, (82), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-02-05 15:19:56,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2025-02-05 15:19:56,161 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 38 [2025-02-05 15:19:56,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:56,164 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2025-02-05 15:19:56,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 15:19:56,164 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2025-02-05 15:19:56,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 15:19:56,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:56,165 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:56,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:19:56,366 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-05 15:19:56,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:56,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:56,366 INFO L85 PathProgramCache]: Analyzing trace with hash 698348987, now seen corresponding path program 1 times [2025-02-05 15:19:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:56,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173100229] [2025-02-05 15:19:56,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:56,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:56,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 15:19:56,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:19:56,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:56,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479934309] [2025-02-05 15:19:56,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:56,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:56,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:56,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:19:56,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:19:56,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 15:19:56,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:19:56,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:56,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:56,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 15:19:56,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:20:01,496 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:20:01,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:20:06,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:20:06,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173100229] [2025-02-05 15:20:06,344 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:20:06,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479934309] [2025-02-05 15:20:06,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479934309] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:20:06,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:20:06,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-02-05 15:20:06,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743967428] [2025-02-05 15:20:06,345 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 15:20:06,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:20:06,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:20:06,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:20:06,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=1, NotChecked=0, Total=240 [2025-02-05 15:20:06,346 INFO L87 Difference]: Start difference. First operand 107 states and 124 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:20:11,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-05 15:20:19,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-05 15:20:24,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-05 15:20:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:20:25,789 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2025-02-05 15:20:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:20:25,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 46 [2025-02-05 15:20:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:20:25,791 INFO L225 Difference]: With dead ends: 141 [2025-02-05 15:20:25,791 INFO L226 Difference]: Without dead ends: 137 [2025-02-05 15:20:25,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=77, Invalid=264, Unknown=1, NotChecked=0, Total=342 [2025-02-05 15:20:25,792 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 27 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:20:25,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 165 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 215 Invalid, 5 Unknown, 0 Unchecked, 15.2s Time] [2025-02-05 15:20:25,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-05 15:20:25,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2025-02-05 15:20:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 82 states have internal predecessors, (93), 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-05 15:20:25,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2025-02-05 15:20:25,821 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 46 [2025-02-05 15:20:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:20:25,821 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2025-02-05 15:20:25,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 10 states have internal predecessors, (21), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2025-02-05 15:20:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2025-02-05 15:20:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 15:20:25,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:20:25,824 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, 1] [2025-02-05 15:20:25,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 15:20:26,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:20:26,025 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:20:26,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:20:26,026 INFO L85 PathProgramCache]: Analyzing trace with hash 898461349, now seen corresponding path program 1 times [2025-02-05 15:20:26,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:20:26,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446721470] [2025-02-05 15:20:26,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:20:26,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:20:26,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:20:26,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:20:26,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:20:26,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:20:26,114 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-05 15:20:26,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:20:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446721470] [2025-02-05 15:20:26,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446721470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:20:26,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964901351] [2025-02-05 15:20:26,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:20:26,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:20:26,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:20:26,118 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:20:26,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:20:26,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:20:26,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:20:26,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:20:26,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:20:26,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:20:26,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:20:26,226 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-05 15:20:26,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:20:26,298 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-05 15:20:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964901351] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:20:26,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:20:26,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-02-05 15:20:26,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629240394] [2025-02-05 15:20:26,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:20:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:20:26,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:20:26,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:20:26,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:20:26,300 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-05 15:20:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:20:26,539 INFO L93 Difference]: Finished difference Result 243 states and 296 transitions. [2025-02-05 15:20:26,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:20:26,540 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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 51 [2025-02-05 15:20:26,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:20:26,545 INFO L225 Difference]: With dead ends: 243 [2025-02-05 15:20:26,545 INFO L226 Difference]: Without dead ends: 222 [2025-02-05 15:20:26,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:20:26,546 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 15:20:26,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 189 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 15:20:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-05 15:20:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2025-02-05 15:20:26,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 140 states have (on average 1.1928571428571428) internal successors, (167), 149 states have internal predecessors, (167), 49 states have call successors, (49), 26 states have call predecessors, (49), 25 states have return successors, (45), 39 states have call predecessors, (45), 45 states have call successors, (45) [2025-02-05 15:20:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2025-02-05 15:20:26,589 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 51 [2025-02-05 15:20:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:20:26,590 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2025-02-05 15:20:26,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 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-05 15:20:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2025-02-05 15:20:26,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 15:20:26,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:20:26,593 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, 1] [2025-02-05 15:20:26,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-05 15:20:26,798 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,SelfDestructingSolverStorable9 [2025-02-05 15:20:26,798 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:20:26,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:20:26,798 INFO L85 PathProgramCache]: Analyzing trace with hash -387521360, now seen corresponding path program 1 times [2025-02-05 15:20:26,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:20:26,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113833413] [2025-02-05 15:20:26,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:20:26,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:20:26,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 15:20:26,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 15:20:26,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:20:26,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:20:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1286670684] [2025-02-05 15:20:26,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:20:26,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:20:26,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:20:26,855 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:20:26,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:20:26,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 15:20:28,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 15:20:28,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:20:28,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:20:28,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-05 15:20:28,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:20:29,924 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 42 proven. 31 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 15:20:29,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:21:10,910 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)