./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.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_unwindbound10.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 91dfff3356c8586e4ab54260d22ce3d78ead2ec4d531619c6564036666f10187 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:18:57,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:18:57,952 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:18:57,958 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:18:57,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:18:57,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:18:57,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:18:57,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:18:57,978 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:18:57,978 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:18:57,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:18:57,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:18:57,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:18:57,979 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:18:57,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:18:57,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:18:57,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:18:57,980 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:18:57,981 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:18:57,981 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 -> 91dfff3356c8586e4ab54260d22ce3d78ead2ec4d531619c6564036666f10187 [2025-02-05 15:18:58,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:18:58,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:18:58,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:18:58,202 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:18:58,202 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:18:58,203 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_unwindbound10.c [2025-02-05 15:18:59,321 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bb6b9667/382285a5b84b43f3ba3313105595129f/FLAG25a93bc43 [2025-02-05 15:18:59,581 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:18:59,583 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c [2025-02-05 15:18:59,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bb6b9667/382285a5b84b43f3ba3313105595129f/FLAG25a93bc43 [2025-02-05 15:18:59,625 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7bb6b9667/382285a5b84b43f3ba3313105595129f [2025-02-05 15:18:59,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:18:59,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:18:59,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:18:59,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:18:59,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:18:59,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ae4c6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59, skipping insertion in model container [2025-02-05 15:18:59,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,648 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:18:59,755 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard-u_unwindbound10.c[537,550] [2025-02-05 15:18:59,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:18:59,775 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:18:59,783 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_unwindbound10.c[537,550] [2025-02-05 15:18:59,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:18:59,802 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:18:59,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59 WrapperNode [2025-02-05 15:18:59,803 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:18:59,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:18:59,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:18:59,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:18:59,809 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:18:59" (1/1) ... [2025-02-05 15:18:59,815 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:18:59" (1/1) ... [2025-02-05 15:18:59,823 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2025-02-05 15:18:59,824 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:18:59,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:18:59,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:18:59,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:18:59,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,829 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,830 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,835 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:18:59,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,835 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,837 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,837 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,837 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,839 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:18:59,839 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:18:59,839 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:18:59,839 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:18:59,840 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (1/1) ... [2025-02-05 15:18:59,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:18:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:18:59,866 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:18:59,869 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:18:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:18:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:18:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:18:59,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:18:59,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-05 15:18:59,884 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-05 15:18:59,926 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:18:59,929 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:19:00,053 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-02-05 15:19:00,053 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:19:00,063 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:19:00,064 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:19:00,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:19:00 BoogieIcfgContainer [2025-02-05 15:19:00,064 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:19:00,066 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:19:00,066 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:19:00,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:19:00,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:18:59" (1/3) ... [2025-02-05 15:19:00,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620664c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:19:00, skipping insertion in model container [2025-02-05 15:19:00,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:18:59" (2/3) ... [2025-02-05 15:19:00,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@620664c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:19:00, skipping insertion in model container [2025-02-05 15:19:00,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:19:00" (3/3) ... [2025-02-05 15:19:00,074 INFO L128 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound10.c [2025-02-05 15:19:00,086 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:19:00,087 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard-u_unwindbound10.c that has 2 procedures, 28 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-02-05 15:19:00,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:19:00,132 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;@42af9aea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:19:00,133 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:19:00,136 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:00,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:19:00,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:00,142 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:00,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:00,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:00,148 INFO L85 PathProgramCache]: Analyzing trace with hash -841661746, now seen corresponding path program 1 times [2025-02-05 15:19:00,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:00,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679416922] [2025-02-05 15:19:00,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:00,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:00,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:19:00,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:19:00,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:00,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:00,265 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:00,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:00,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679416922] [2025-02-05 15:19:00,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679416922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:00,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:00,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 15:19:00,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333551045] [2025-02-05 15:19:00,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:00,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:19:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:00,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:19:00,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 15:19:00,285 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:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:00,299 INFO L93 Difference]: Finished difference Result 53 states and 87 transitions. [2025-02-05 15:19:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:19:00,300 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:00,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:00,303 INFO L225 Difference]: With dead ends: 53 [2025-02-05 15:19:00,303 INFO L226 Difference]: Without dead ends: 24 [2025-02-05 15:19:00,306 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:00,308 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:00,310 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:00,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-02-05 15:19:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-02-05 15:19:00,332 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:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2025-02-05 15:19:00,334 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 10 [2025-02-05 15:19:00,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:00,337 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2025-02-05 15:19:00,337 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:00,337 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2025-02-05 15:19:00,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-05 15:19:00,338 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:00,338 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:00,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 15:19:00,338 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:00,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:00,338 INFO L85 PathProgramCache]: Analyzing trace with hash 901148589, now seen corresponding path program 1 times [2025-02-05 15:19:00,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:00,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943205841] [2025-02-05 15:19:00,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:00,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:00,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-05 15:19:00,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-05 15:19:00,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:00,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:00,526 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:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943205841] [2025-02-05 15:19:00,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943205841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:00,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:00,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:19:00,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401116339] [2025-02-05 15:19:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:00,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:19:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:00,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:19:00,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:19:00,529 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:00,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:00,588 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2025-02-05 15:19:00,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:19:00,588 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:00,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:00,589 INFO L225 Difference]: With dead ends: 38 [2025-02-05 15:19:00,589 INFO L226 Difference]: Without dead ends: 36 [2025-02-05 15:19:00,589 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:00,589 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:00,590 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:00,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-02-05 15:19:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2025-02-05 15:19:00,596 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:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-02-05 15:19:00,596 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 10 [2025-02-05 15:19:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:00,597 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-02-05 15:19:00,597 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:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-02-05 15:19:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-05 15:19:00,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:00,597 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:00,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 15:19:00,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:00,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1774160750, now seen corresponding path program 1 times [2025-02-05 15:19:00,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:00,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141683328] [2025-02-05 15:19:00,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:00,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:00,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-05 15:19:00,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:00,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:00,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:00,664 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:00,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:00,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141683328] [2025-02-05 15:19:00,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141683328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:00,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:00,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:19:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244277875] [2025-02-05 15:19:00,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:00,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 15:19:00,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:00,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 15:19:00,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 15:19:00,668 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:00,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:00,687 INFO L93 Difference]: Finished difference Result 44 states and 59 transitions. [2025-02-05 15:19:00,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 15:19:00,689 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:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:00,689 INFO L225 Difference]: With dead ends: 44 [2025-02-05 15:19:00,689 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 15:19:00,690 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:00,690 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:00,690 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:00,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 15:19:00,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-05 15:19:00,697 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:00,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-02-05 15:19:00,699 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2025-02-05 15:19:00,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:00,699 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-02-05 15:19:00,699 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:00,699 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-02-05 15:19:00,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-05 15:19:00,700 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:00,700 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:19:00,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 15:19:00,700 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:00,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1142350440, now seen corresponding path program 1 times [2025-02-05 15:19:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:00,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402375936] [2025-02-05 15:19:00,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:00,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:00,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-05 15:19:00,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-05 15:19:00,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:00,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:00,867 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:00,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:00,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402375936] [2025-02-05 15:19:00,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402375936] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:00,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:00,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:19:00,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568611460] [2025-02-05 15:19:00,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:00,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:19:00,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:00,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:19:00,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:19:00,868 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:00,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:00,930 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2025-02-05 15:19:00,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:19:00,931 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:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:00,931 INFO L225 Difference]: With dead ends: 44 [2025-02-05 15:19:00,931 INFO L226 Difference]: Without dead ends: 42 [2025-02-05 15:19:00,931 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:00,932 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:00,932 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.0s Time] [2025-02-05 15:19:00,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-02-05 15:19:00,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2025-02-05 15:19:00,935 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:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2025-02-05 15:19:00,936 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 15 [2025-02-05 15:19:00,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:00,936 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2025-02-05 15:19:00,936 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:00,936 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2025-02-05 15:19:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-05 15:19:00,937 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:00,937 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:00,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:19:00,937 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:00,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:00,937 INFO L85 PathProgramCache]: Analyzing trace with hash 205542093, now seen corresponding path program 1 times [2025-02-05 15:19:00,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:00,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412732452] [2025-02-05 15:19:00,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:00,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 15:19:00,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 15:19:00,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:00,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:00,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1803600898] [2025-02-05 15:19:00,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:00,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:00,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:00,963 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:00,966 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:00,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-05 15:19:00,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-05 15:19:00,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:00,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:01,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-05 15:19:01,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:01,155 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:01,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:19:01,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412732452] [2025-02-05 15:19:01,155 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:19:01,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803600898] [2025-02-05 15:19:01,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803600898] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:19:01,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:19:01,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 15:19:01,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120588334] [2025-02-05 15:19:01,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:01,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:19:01,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:01,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:19:01,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:19:01,156 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:01,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:01,254 INFO L93 Difference]: Finished difference Result 63 states and 85 transitions. [2025-02-05 15:19:01,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:19:01,255 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:01,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:01,255 INFO L225 Difference]: With dead ends: 63 [2025-02-05 15:19:01,255 INFO L226 Difference]: Without dead ends: 48 [2025-02-05 15:19:01,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:19:01,256 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:01,256 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:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-02-05 15:19:01,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-02-05 15:19:01,261 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:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2025-02-05 15:19:01,262 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 20 [2025-02-05 15:19:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:01,262 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2025-02-05 15:19:01,262 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:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2025-02-05 15:19:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-05 15:19:01,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:01,263 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:01,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:19:01,467 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:01,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:01,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1822786374, now seen corresponding path program 1 times [2025-02-05 15:19:01,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:01,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310840269] [2025-02-05 15:19:01,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:01,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 15:19:01,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 15:19:01,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:01,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:01,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1430387213] [2025-02-05 15:19:01,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:01,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:01,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:01,483 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:01,484 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:01,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-05 15:19:01,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-05 15:19:01,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:01,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:01,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-05 15:19:01,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:01,744 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:01,745 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:02,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310840269] [2025-02-05 15:19:02,090 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:19:02,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430387213] [2025-02-05 15:19:02,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430387213] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:02,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:19:02,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2025-02-05 15:19:02,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154064801] [2025-02-05 15:19:02,090 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 15:19:02,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:19:02,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:02,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:19:02,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:19:02,091 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:02,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:02,302 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2025-02-05 15:19:02,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:19:02,302 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:02,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:02,303 INFO L225 Difference]: With dead ends: 64 [2025-02-05 15:19:02,303 INFO L226 Difference]: Without dead ends: 50 [2025-02-05 15:19:02,303 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:02,304 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:02,304 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.1s Time] [2025-02-05 15:19:02,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-05 15:19:02,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-05 15:19:02,309 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:02,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-05 15:19:02,309 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 28 [2025-02-05 15:19:02,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:02,310 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-05 15:19:02,310 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:02,310 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-05 15:19:02,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 15:19:02,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:02,310 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:02,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:19:02,511 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:02,511 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:02,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:02,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1122995961, now seen corresponding path program 1 times [2025-02-05 15:19:02,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:02,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893318284] [2025-02-05 15:19:02,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:02,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:02,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 15:19:02,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 15:19:02,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:02,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:02,594 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:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893318284] [2025-02-05 15:19:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893318284] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544062614] [2025-02-05 15:19:02,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:02,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:02,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:02,598 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:02,600 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:02,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 15:19:02,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 15:19:02,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:02,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:02,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-05 15:19:02,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:02,658 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:02,658 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:02,691 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:02,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544062614] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:19:02,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:19:02,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 8 [2025-02-05 15:19:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345727407] [2025-02-05 15:19:02,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:19:02,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:19:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:02,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:19:02,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:19:02,692 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:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:02,770 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-02-05 15:19:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 15:19:02,771 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:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:02,772 INFO L225 Difference]: With dead ends: 115 [2025-02-05 15:19:02,772 INFO L226 Difference]: Without dead ends: 101 [2025-02-05 15:19:02,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:19:02,772 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:02,772 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:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-05 15:19:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-02-05 15:19:02,782 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:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 112 transitions. [2025-02-05 15:19:02,783 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 112 transitions. Word has length 30 [2025-02-05 15:19:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:02,783 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 112 transitions. [2025-02-05 15:19:02,783 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:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 112 transitions. [2025-02-05 15:19:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-05 15:19:02,784 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:02,784 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:02,789 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:02,984 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:02,985 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:02,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:02,985 INFO L85 PathProgramCache]: Analyzing trace with hash 345705026, now seen corresponding path program 1 times [2025-02-05 15:19:02,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580982065] [2025-02-05 15:19:02,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:02,991 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:19:03,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:19:03,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:03,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:03,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146782335] [2025-02-05 15:19:03,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:03,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:03,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:03,037 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:03,039 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:03,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-05 15:19:03,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-05 15:19:03,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:03,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:03,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 15:19:03,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:03,156 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:03,157 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:03,253 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:03,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580982065] [2025-02-05 15:19:03,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:19:03,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146782335] [2025-02-05 15:19:03,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146782335] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:03,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:19:03,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-05 15:19:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963430997] [2025-02-05 15:19:03,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:19:03,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 15:19:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:03,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 15:19:03,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:19:03,254 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:07,438 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:09,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-02-05 15:19:09,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:09,580 INFO L93 Difference]: Finished difference Result 114 states and 136 transitions. [2025-02-05 15:19:09,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:19:09,581 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:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:09,582 INFO L225 Difference]: With dead ends: 114 [2025-02-05 15:19:09,582 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 15:19:09,582 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:09,582 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:09,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 96 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 1 Unknown, 0 Unchecked, 6.3s Time] [2025-02-05 15:19:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 15:19:09,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2025-02-05 15:19:09,605 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:09,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 124 transitions. [2025-02-05 15:19:09,608 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 124 transitions. Word has length 38 [2025-02-05 15:19:09,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:09,608 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 124 transitions. [2025-02-05 15:19:09,608 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:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 124 transitions. [2025-02-05 15:19:09,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-05 15:19:09,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:09,610 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:09,622 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:09,810 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:09,810 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:09,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:09,811 INFO L85 PathProgramCache]: Analyzing trace with hash 698348987, now seen corresponding path program 1 times [2025-02-05 15:19:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:09,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535615404] [2025-02-05 15:19:09,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:09,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 15:19:09,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:19:09,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:09,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:09,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189094032] [2025-02-05 15:19:09,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:09,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:09,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:09,838 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:09,840 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:09,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-05 15:19:09,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-05 15:19:09,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:09,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:09,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-05 15:19:09,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:14,580 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:19:14,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:14,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:14,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535615404] [2025-02-05 15:19:14,934 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-05 15:19:14,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189094032] [2025-02-05 15:19:14,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189094032] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:14,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:19:14,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-02-05 15:19:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788925685] [2025-02-05 15:19:14,934 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-02-05 15:19:14,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 15:19:14,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:14,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 15:19:14,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-02-05 15:19:14,935 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:19:24,030 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:19:27,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-05 15:19:32,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-05 15:19:36,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [0] [2025-02-05 15:19:36,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:36,787 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2025-02-05 15:19:36,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 15:19:36,791 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:19:36,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:36,795 INFO L225 Difference]: With dead ends: 141 [2025-02-05 15:19:36,795 INFO L226 Difference]: Without dead ends: 137 [2025-02-05 15:19:36,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2025-02-05 15:19:36,796 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 39 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:36,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 165 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 212 Invalid, 4 Unknown, 0 Unchecked, 17.6s Time] [2025-02-05 15:19:36,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-05 15:19:36,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 120. [2025-02-05 15:19:36,854 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:19:36,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2025-02-05 15:19:36,856 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 46 [2025-02-05 15:19:36,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:36,856 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2025-02-05 15:19:36,856 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:19:36,856 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2025-02-05 15:19:36,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-05 15:19:36,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:36,857 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:19:36,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:19:37,057 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:19:37,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:37,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:37,058 INFO L85 PathProgramCache]: Analyzing trace with hash 898461349, now seen corresponding path program 1 times [2025-02-05 15:19:37,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:37,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249240634] [2025-02-05 15:19:37,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:37,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:19:37,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:19:37,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:37,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:37,200 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:19:37,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:19:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249240634] [2025-02-05 15:19:37,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249240634] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:19:37,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852066747] [2025-02-05 15:19:37,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:37,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:37,207 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:19:37,207 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:19:37,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-05 15:19:37,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-05 15:19:37,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:37,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:37,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 15:19:37,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:37,286 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:19:37,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:19:37,346 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:19:37,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852066747] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:19:37,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:19:37,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-02-05 15:19:37,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506236007] [2025-02-05 15:19:37,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:19:37,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 15:19:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:19:37,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 15:19:37,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:19:37,348 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:19:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:19:37,502 INFO L93 Difference]: Finished difference Result 243 states and 296 transitions. [2025-02-05 15:19:37,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:19:37,503 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:19:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:19:37,504 INFO L225 Difference]: With dead ends: 243 [2025-02-05 15:19:37,504 INFO L226 Difference]: Without dead ends: 222 [2025-02-05 15:19:37,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-02-05 15:19:37,505 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.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:19:37,505 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.1s Time] [2025-02-05 15:19:37,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-05 15:19:37,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2025-02-05 15:19:37,525 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:19:37,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 261 transitions. [2025-02-05 15:19:37,526 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 261 transitions. Word has length 51 [2025-02-05 15:19:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:19:37,526 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 261 transitions. [2025-02-05 15:19:37,526 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:19:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 261 transitions. [2025-02-05 15:19:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-05 15:19:37,527 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:19:37,528 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:19:37,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:19:37,728 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:19:37,728 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:19:37,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:19:37,728 INFO L85 PathProgramCache]: Analyzing trace with hash -387521360, now seen corresponding path program 1 times [2025-02-05 15:19:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:19:37,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366199550] [2025-02-05 15:19:37,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:19:37,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 15:19:37,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 15:19:37,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:37,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-05 15:19:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [397969321] [2025-02-05 15:19:37,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:19:37,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:19:37,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:19:37,767 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:19:37,769 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:19:37,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-05 15:19:39,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-05 15:19:39,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:19:39,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:19:39,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-02-05 15:19:39,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:19:40,642 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:19:40,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:20:45,056 WARN L286 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)