./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i --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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i -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 b879c59582ac4a49c0e2ecf86f8757548b6309c2a4170b8da4007bca733fddea --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 22:52:52,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 22:52:52,657 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 22:52:52,662 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 22:52:52,663 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 22:52:52,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 22:52:52,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 22:52:52,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 22:52:52,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 22:52:52,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 22:52:52,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 22:52:52,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 22:52:52,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 22:52:52,692 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 22:52:52,692 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 22:52:52,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 22:52:52,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 22:52:52,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 22:52:52,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 22:52:52,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 22:52:52,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 22:52:52,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 22:52:52,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 22:52:52,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 22:52:52,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 22:52:52,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:52:52,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 22:52:52,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 22:52:52,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 22:52:52,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 22:52:52,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 22:52:52,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 22:52:52,696 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 22:52:52,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 22:52:52,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 22:52:52,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 22:52:52,696 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 -> b879c59582ac4a49c0e2ecf86f8757548b6309c2a4170b8da4007bca733fddea [2025-02-05 22:52:52,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 22:52:52,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 22:52:52,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 22:52:52,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 22:52:52,947 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 22:52:52,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2025-02-05 22:52:54,179 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8d5d0209/62454ee13f2443d5b0a7ee497bd276ca/FLAG8db84e6f8 [2025-02-05 22:52:54,473 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 22:52:54,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2025-02-05 22:52:54,481 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8d5d0209/62454ee13f2443d5b0a7ee497bd276ca/FLAG8db84e6f8 [2025-02-05 22:52:54,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e8d5d0209/62454ee13f2443d5b0a7ee497bd276ca [2025-02-05 22:52:54,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 22:52:54,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 22:52:54,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 22:52:54,497 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 22:52:54,500 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 22:52:54,500 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,501 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@524ff34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54, skipping insertion in model container [2025-02-05 22:52:54,501 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 22:52:54,643 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2025-02-05 22:52:54,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:52:54,721 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 22:52:54,731 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/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2025-02-05 22:52:54,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 22:52:54,797 INFO L204 MainTranslator]: Completed translation [2025-02-05 22:52:54,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54 WrapperNode [2025-02-05 22:52:54,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 22:52:54,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 22:52:54,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 22:52:54,799 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 22:52:54,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,818 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,850 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2025-02-05 22:52:54,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 22:52:54,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 22:52:54,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 22:52:54,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 22:52:54,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,866 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,881 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 22:52:54,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,889 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,895 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,908 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 22:52:54,908 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 22:52:54,909 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 22:52:54,909 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 22:52:54,909 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (1/1) ... [2025-02-05 22:52:54,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 22:52:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:52:54,945 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 22:52:54,948 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 22:52:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 22:52:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 22:52:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 22:52:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 22:52:54,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 22:52:54,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 22:52:55,059 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 22:52:55,061 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 22:52:55,510 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-02-05 22:52:55,510 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 22:52:55,528 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 22:52:55,529 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 22:52:55,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:52:55 BoogieIcfgContainer [2025-02-05 22:52:55,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 22:52:55,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 22:52:55,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 22:52:55,538 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 22:52:55,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:52:54" (1/3) ... [2025-02-05 22:52:55,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b11f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:52:55, skipping insertion in model container [2025-02-05 22:52:55,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:52:54" (2/3) ... [2025-02-05 22:52:55,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b11f49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:52:55, skipping insertion in model container [2025-02-05 22:52:55,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:52:55" (3/3) ... [2025-02-05 22:52:55,542 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2025-02-05 22:52:55,556 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 22:52:55,557 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i that has 2 procedures, 87 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 22:52:55,603 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 22:52:55,613 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;@39f87178, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 22:52:55,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 22:52:55,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:52:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 22:52:55,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:55,635 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:52:55,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:55,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash 272269240, now seen corresponding path program 1 times [2025-02-05 22:52:55,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:55,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597322313] [2025-02-05 22:52:55,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:55,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:55,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:52:55,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:52:55,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:55,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:56,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 22:52:56,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:52:56,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597322313] [2025-02-05 22:52:56,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597322313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:52:56,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246107267] [2025-02-05 22:52:56,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:56,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:52:56,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:52:56,012 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 22:52:56,034 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 22:52:56,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-05 22:52:56,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-05 22:52:56,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:56,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:56,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 22:52:56,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:52:56,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-02-05 22:52:56,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 22:52:56,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246107267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:52:56,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 22:52:56,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 22:52:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892964257] [2025-02-05 22:52:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:52:56,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 22:52:56,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:52:56,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 22:52:56,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 22:52:56,296 INFO L87 Difference]: Start difference. First operand has 87 states, 60 states have (on average 1.5) internal successors, (90), 61 states have internal predecessors, (90), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:52:56,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:56,335 INFO L93 Difference]: Finished difference Result 168 states and 295 transitions. [2025-02-05 22:52:56,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 22:52:56,337 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2025-02-05 22:52:56,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:56,342 INFO L225 Difference]: With dead ends: 168 [2025-02-05 22:52:56,342 INFO L226 Difference]: Without dead ends: 84 [2025-02-05 22:52:56,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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 22:52:56,349 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:56,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:52:56,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-05 22:52:56,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-02-05 22:52:56,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:52:56,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2025-02-05 22:52:56,388 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 156 [2025-02-05 22:52:56,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:56,389 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2025-02-05 22:52:56,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-02-05 22:52:56,389 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2025-02-05 22:52:56,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 22:52:56,391 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:56,391 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:52:56,399 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 22:52:56,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 22:52:56,592 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:56,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:56,593 INFO L85 PathProgramCache]: Analyzing trace with hash 768542134, now seen corresponding path program 1 times [2025-02-05 22:52:56,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:56,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785288394] [2025-02-05 22:52:56,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:56,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:56,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:52:56,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:52:56,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:56,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:57,801 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:52:57,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:52:57,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785288394] [2025-02-05 22:52:57,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785288394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:52:57,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:52:57,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:52:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418181529] [2025-02-05 22:52:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:52:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:52:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:52:57,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:52:57,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:52:57,806 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:52:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:57,917 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2025-02-05 22:52:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:52:57,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2025-02-05 22:52:57,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:57,919 INFO L225 Difference]: With dead ends: 193 [2025-02-05 22:52:57,919 INFO L226 Difference]: Without dead ends: 112 [2025-02-05 22:52:57,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:52:57,923 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 83 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:57,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 339 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:52:57,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-02-05 22:52:57,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 98. [2025-02-05 22:52:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 22:52:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2025-02-05 22:52:57,939 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 158 [2025-02-05 22:52:57,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:57,940 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2025-02-05 22:52:57,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:52:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2025-02-05 22:52:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 22:52:57,943 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:57,943 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:52:57,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 22:52:57,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:57,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:57,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1028409225, now seen corresponding path program 1 times [2025-02-05 22:52:57,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:57,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787881966] [2025-02-05 22:52:57,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:57,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:57,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 22:52:58,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 22:52:58,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:58,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:58,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:52:58,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:52:58,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787881966] [2025-02-05 22:52:58,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787881966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:52:58,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:52:58,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:52:58,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668437202] [2025-02-05 22:52:58,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:52:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:52:58,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:52:58,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:52:58,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:52:58,354 INFO L87 Difference]: Start difference. First operand 98 states and 153 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:52:58,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:58,647 INFO L93 Difference]: Finished difference Result 289 states and 454 transitions. [2025-02-05 22:52:58,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:52:58,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2025-02-05 22:52:58,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:58,650 INFO L225 Difference]: With dead ends: 289 [2025-02-05 22:52:58,650 INFO L226 Difference]: Without dead ends: 194 [2025-02-05 22:52:58,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:52:58,652 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 99 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:58,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 433 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:52:58,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-02-05 22:52:58,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 142. [2025-02-05 22:52:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 22:52:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 220 transitions. [2025-02-05 22:52:58,681 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 220 transitions. Word has length 158 [2025-02-05 22:52:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:58,682 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 220 transitions. [2025-02-05 22:52:58,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:52:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 220 transitions. [2025-02-05 22:52:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 22:52:58,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:58,685 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:52:58,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 22:52:58,685 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:58,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:58,686 INFO L85 PathProgramCache]: Analyzing trace with hash 116675892, now seen corresponding path program 1 times [2025-02-05 22:52:58,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:58,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276890482] [2025-02-05 22:52:58,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:58,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 22:52:58,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 22:52:58,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:58,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:59,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:52:59,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:52:59,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276890482] [2025-02-05 22:52:59,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276890482] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:52:59,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:52:59,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:52:59,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009123535] [2025-02-05 22:52:59,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:52:59,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:52:59,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:52:59,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:52:59,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:52:59,048 INFO L87 Difference]: Start difference. First operand 142 states and 220 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:52:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:52:59,158 INFO L93 Difference]: Finished difference Result 297 states and 461 transitions. [2025-02-05 22:52:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:52:59,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2025-02-05 22:52:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:52:59,163 INFO L225 Difference]: With dead ends: 297 [2025-02-05 22:52:59,165 INFO L226 Difference]: Without dead ends: 202 [2025-02-05 22:52:59,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:52:59,167 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 57 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:52:59,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 364 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:52:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-05 22:52:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2025-02-05 22:52:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 144 states have internal predecessors, (203), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-05 22:52:59,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 307 transitions. [2025-02-05 22:52:59,201 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 307 transitions. Word has length 159 [2025-02-05 22:52:59,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:52:59,202 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 307 transitions. [2025-02-05 22:52:59,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:52:59,203 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 307 transitions. [2025-02-05 22:52:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:52:59,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:52:59,208 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:52:59,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 22:52:59,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:52:59,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:52:59,209 INFO L85 PathProgramCache]: Analyzing trace with hash 226001297, now seen corresponding path program 1 times [2025-02-05 22:52:59,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:52:59,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834135712] [2025-02-05 22:52:59,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:59,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:52:59,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:52:59,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:52:59,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:59,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:59,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:52:59,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:52:59,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834135712] [2025-02-05 22:52:59,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834135712] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:52:59,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054339442] [2025-02-05 22:52:59,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:52:59,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:52:59,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:52:59,583 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 22:52:59,586 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 22:52:59,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:52:59,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:52:59,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:52:59,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:52:59,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-05 22:52:59,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 699 proven. 69 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-02-05 22:53:00,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:53:00,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2025-02-05 22:53:00,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054339442] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:53:00,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:53:00,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2025-02-05 22:53:00,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459685152] [2025-02-05 22:53:00,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:53:00,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:53:00,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:00,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:53:00,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:53:00,474 INFO L87 Difference]: Start difference. First operand 199 states and 307 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 5 states have call successors, (62), 3 states have call predecessors, (62), 7 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2025-02-05 22:53:01,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:01,054 INFO L93 Difference]: Finished difference Result 330 states and 487 transitions. [2025-02-05 22:53:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-05 22:53:01,055 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 5 states have call successors, (62), 3 states have call predecessors, (62), 7 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) Word has length 160 [2025-02-05 22:53:01,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:01,057 INFO L225 Difference]: With dead ends: 330 [2025-02-05 22:53:01,057 INFO L226 Difference]: Without dead ends: 178 [2025-02-05 22:53:01,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2025-02-05 22:53:01,059 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 335 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:01,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 261 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 22:53:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-02-05 22:53:01,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2025-02-05 22:53:01,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.275229357798165) internal successors, (139), 109 states have internal predecessors, (139), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 22:53:01,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 235 transitions. [2025-02-05 22:53:01,092 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 235 transitions. Word has length 160 [2025-02-05 22:53:01,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:01,093 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 235 transitions. [2025-02-05 22:53:01,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 5 states have call successors, (62), 3 states have call predecessors, (62), 7 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2025-02-05 22:53:01,094 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 235 transitions. [2025-02-05 22:53:01,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-05 22:53:01,095 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:01,096 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:01,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 22:53:01,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:01,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:01,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:01,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1180215273, now seen corresponding path program 1 times [2025-02-05 22:53:01,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:01,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179485890] [2025-02-05 22:53:01,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:01,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:01,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-05 22:53:01,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-05 22:53:01,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:01,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:01,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:53:01,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:01,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179485890] [2025-02-05 22:53:01,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179485890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:01,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:01,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:53:01,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102179481] [2025-02-05 22:53:01,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:01,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:53:01,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:01,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:53:01,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:53:01,578 INFO L87 Difference]: Start difference. First operand 166 states and 235 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:53:01,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:01,635 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2025-02-05 22:53:01,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:53:01,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2025-02-05 22:53:01,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:01,638 INFO L225 Difference]: With dead ends: 267 [2025-02-05 22:53:01,638 INFO L226 Difference]: Without dead ends: 160 [2025-02-05 22:53:01,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:53:01,639 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:01,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 257 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 22:53:01,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-05 22:53:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-05 22:53:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.198019801980198) internal successors, (121), 101 states have internal predecessors, (121), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 22:53:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 217 transitions. [2025-02-05 22:53:01,668 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 217 transitions. Word has length 160 [2025-02-05 22:53:01,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:01,669 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 217 transitions. [2025-02-05 22:53:01,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:53:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2025-02-05 22:53:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 22:53:01,670 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:01,670 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:01,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 22:53:01,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:01,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash -2051460527, now seen corresponding path program 1 times [2025-02-05 22:53:01,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:01,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794132139] [2025-02-05 22:53:01,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:01,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:01,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 22:53:01,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 22:53:01,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:01,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:53:01,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:01,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794132139] [2025-02-05 22:53:01,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794132139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:01,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:01,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 22:53:01,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793218677] [2025-02-05 22:53:01,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:01,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 22:53:01,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:01,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 22:53:01,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 22:53:01,979 INFO L87 Difference]: Start difference. First operand 160 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:53:02,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:02,058 INFO L93 Difference]: Finished difference Result 259 states and 356 transitions. [2025-02-05 22:53:02,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 22:53:02,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-02-05 22:53:02,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:02,060 INFO L225 Difference]: With dead ends: 259 [2025-02-05 22:53:02,060 INFO L226 Difference]: Without dead ends: 162 [2025-02-05 22:53:02,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 22:53:02,061 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:02,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 22:53:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-05 22:53:02,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-05 22:53:02,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 22:53:02,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2025-02-05 22:53:02,091 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 161 [2025-02-05 22:53:02,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:02,091 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2025-02-05 22:53:02,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:53:02,091 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2025-02-05 22:53:02,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 22:53:02,093 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:02,093 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:02,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 22:53:02,093 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:02,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash -75420035, now seen corresponding path program 1 times [2025-02-05 22:53:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:02,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797264940] [2025-02-05 22:53:02,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:02,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:02,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 22:53:02,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 22:53:02,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:02,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:02,611 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:53:02,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:02,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797264940] [2025-02-05 22:53:02,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797264940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:02,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:02,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 22:53:02,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499439096] [2025-02-05 22:53:02,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:02,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 22:53:02,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:02,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 22:53:02,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 22:53:02,614 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:53:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:02,927 INFO L93 Difference]: Finished difference Result 338 states and 458 transitions. [2025-02-05 22:53:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 22:53:02,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-02-05 22:53:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:02,930 INFO L225 Difference]: With dead ends: 338 [2025-02-05 22:53:02,930 INFO L226 Difference]: Without dead ends: 239 [2025-02-05 22:53:02,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 22:53:02,931 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 110 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:02,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 390 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:53:02,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-02-05 22:53:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 166. [2025-02-05 22:53:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 107 states have internal predecessors, (130), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 22:53:02,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 226 transitions. [2025-02-05 22:53:02,957 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 226 transitions. Word has length 162 [2025-02-05 22:53:02,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:02,958 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 226 transitions. [2025-02-05 22:53:02,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-02-05 22:53:02,958 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 226 transitions. [2025-02-05 22:53:02,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-02-05 22:53:02,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:02,960 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:02,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 22:53:02,960 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:02,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:02,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1733249044, now seen corresponding path program 1 times [2025-02-05 22:53:02,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:02,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539253903] [2025-02-05 22:53:02,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:02,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:02,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 22:53:03,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 22:53:03,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:03,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:53:03,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:03,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539253903] [2025-02-05 22:53:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539253903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:03,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760472669] [2025-02-05 22:53:03,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:03,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:03,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:03,391 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 22:53:03,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 22:53:03,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-02-05 22:53:03,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-02-05 22:53:03,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:03,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:03,520 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 22:53:03,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:04,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-02-05 22:53:04,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:53:04,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:53:04,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760472669] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:53:04,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:53:04,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2025-02-05 22:53:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828772552] [2025-02-05 22:53:04,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:53:04,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 22:53:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:04,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 22:53:04,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-02-05 22:53:04,364 INFO L87 Difference]: Start difference. First operand 166 states and 226 transitions. Second operand has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2025-02-05 22:53:05,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:05,085 INFO L93 Difference]: Finished difference Result 518 states and 706 transitions. [2025-02-05 22:53:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-05 22:53:05,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 162 [2025-02-05 22:53:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:05,091 INFO L225 Difference]: With dead ends: 518 [2025-02-05 22:53:05,091 INFO L226 Difference]: Without dead ends: 415 [2025-02-05 22:53:05,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2025-02-05 22:53:05,093 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 380 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:05,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 687 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 22:53:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-02-05 22:53:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 335. [2025-02-05 22:53:05,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 231 states have (on average 1.2597402597402598) internal successors, (291), 232 states have internal predecessors, (291), 82 states have call successors, (82), 21 states have call predecessors, (82), 21 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 22:53:05,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 455 transitions. [2025-02-05 22:53:05,159 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 455 transitions. Word has length 162 [2025-02-05 22:53:05,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:05,159 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 455 transitions. [2025-02-05 22:53:05,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2025-02-05 22:53:05,160 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 455 transitions. [2025-02-05 22:53:05,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 22:53:05,161 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:05,161 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:05,170 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 22:53:05,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:05,362 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:05,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1437684944, now seen corresponding path program 1 times [2025-02-05 22:53:05,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860754399] [2025-02-05 22:53:05,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:05,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:53:05,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:53:05,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:05,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-02-05 22:53:17,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:17,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860754399] [2025-02-05 22:53:17,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860754399] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 22:53:17,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 22:53:17,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-02-05 22:53:17,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155885179] [2025-02-05 22:53:17,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 22:53:17,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 22:53:17,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:17,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 22:53:17,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:53:17,418 INFO L87 Difference]: Start difference. First operand 335 states and 455 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 22:53:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:43,484 INFO L93 Difference]: Finished difference Result 884 states and 1188 transitions. [2025-02-05 22:53:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-05 22:53:43,487 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 163 [2025-02-05 22:53:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:43,494 INFO L225 Difference]: With dead ends: 884 [2025-02-05 22:53:43,495 INFO L226 Difference]: Without dead ends: 721 [2025-02-05 22:53:43,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=358, Invalid=1124, Unknown=0, NotChecked=0, Total=1482 [2025-02-05 22:53:43,496 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 1153 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:43,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 1181 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2025-02-05 22:53:43,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-02-05 22:53:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 352. [2025-02-05 22:53:43,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 248 states have (on average 1.278225806451613) internal successors, (317), 249 states have internal predecessors, (317), 82 states have call successors, (82), 21 states have call predecessors, (82), 21 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 22:53:43,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 481 transitions. [2025-02-05 22:53:43,603 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 481 transitions. Word has length 163 [2025-02-05 22:53:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:43,603 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 481 transitions. [2025-02-05 22:53:43,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-02-05 22:53:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 481 transitions. [2025-02-05 22:53:43,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 22:53:43,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:43,606 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:43,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 22:53:43,606 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:43,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:43,607 INFO L85 PathProgramCache]: Analyzing trace with hash -241901416, now seen corresponding path program 1 times [2025-02-05 22:53:43,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:43,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235348501] [2025-02-05 22:53:43,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:43,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:43,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:53:43,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:53:43,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:43,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:44,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:53:44,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:44,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235348501] [2025-02-05 22:53:44,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235348501] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:44,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429002775] [2025-02-05 22:53:44,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:44,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:44,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:44,056 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 22:53:44,059 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 22:53:44,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:53:44,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:53:44,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:44,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:44,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 22:53:44,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2025-02-05 22:53:44,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:53:45,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:53:45,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429002775] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:53:45,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:53:45,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 24 [2025-02-05 22:53:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768729763] [2025-02-05 22:53:45,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:53:45,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-05 22:53:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:45,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-05 22:53:45,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2025-02-05 22:53:45,030 INFO L87 Difference]: Start difference. First operand 352 states and 481 transitions. Second operand has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 24 states have internal predecessors, (109), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2025-02-05 22:53:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:46,946 INFO L93 Difference]: Finished difference Result 740 states and 998 transitions. [2025-02-05 22:53:46,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-02-05 22:53:46,946 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 24 states have internal predecessors, (109), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) Word has length 163 [2025-02-05 22:53:46,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:46,950 INFO L225 Difference]: With dead ends: 740 [2025-02-05 22:53:46,951 INFO L226 Difference]: Without dead ends: 572 [2025-02-05 22:53:46,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=687, Invalid=2973, Unknown=0, NotChecked=0, Total=3660 [2025-02-05 22:53:46,955 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 999 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 1751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:46,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1481 Invalid, 1751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 22:53:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2025-02-05 22:53:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 355. [2025-02-05 22:53:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 249 states have (on average 1.2610441767068272) internal successors, (314), 250 states have internal predecessors, (314), 82 states have call successors, (82), 23 states have call predecessors, (82), 23 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 22:53:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 478 transitions. [2025-02-05 22:53:47,058 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 478 transitions. Word has length 163 [2025-02-05 22:53:47,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:47,059 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 478 transitions. [2025-02-05 22:53:47,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 24 states have internal predecessors, (109), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2025-02-05 22:53:47,059 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 478 transitions. [2025-02-05 22:53:47,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 22:53:47,063 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:47,063 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:47,072 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 22:53:47,268 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,SelfDestructingSolverStorable10 [2025-02-05 22:53:47,268 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:47,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2142048753, now seen corresponding path program 1 times [2025-02-05 22:53:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272897931] [2025-02-05 22:53:47,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:47,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:47,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:53:47,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:53:47,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:47,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:47,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:53:47,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:47,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272897931] [2025-02-05 22:53:47,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272897931] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:47,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299263679] [2025-02-05 22:53:47,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:47,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:47,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:47,621 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 22:53:47,624 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 22:53:47,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:53:47,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:53:47,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:47,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:47,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 22:53:47,749 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 539 proven. 135 refuted. 0 times theorem prover too weak. 430 trivial. 0 not checked. [2025-02-05 22:53:48,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:53:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-02-05 22:53:48,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299263679] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:53:48,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:53:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 5] total 12 [2025-02-05 22:53:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659690127] [2025-02-05 22:53:48,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:53:48,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 22:53:48,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:53:48,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 22:53:48,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-02-05 22:53:48,384 INFO L87 Difference]: Start difference. First operand 355 states and 478 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2025-02-05 22:53:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 22:53:48,698 INFO L93 Difference]: Finished difference Result 659 states and 879 transitions. [2025-02-05 22:53:48,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 22:53:48,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) Word has length 163 [2025-02-05 22:53:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 22:53:48,702 INFO L225 Difference]: With dead ends: 659 [2025-02-05 22:53:48,702 INFO L226 Difference]: Without dead ends: 387 [2025-02-05 22:53:48,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-05 22:53:48,703 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 67 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 22:53:48,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 225 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 22:53:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-02-05 22:53:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 371. [2025-02-05 22:53:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 261 states have (on average 1.2413793103448276) internal successors, (324), 262 states have internal predecessors, (324), 82 states have call successors, (82), 27 states have call predecessors, (82), 27 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2025-02-05 22:53:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 488 transitions. [2025-02-05 22:53:48,808 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 488 transitions. Word has length 163 [2025-02-05 22:53:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 22:53:48,809 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 488 transitions. [2025-02-05 22:53:48,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (52), 5 states have call predecessors, (52), 5 states have call successors, (52) [2025-02-05 22:53:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 488 transitions. [2025-02-05 22:53:48,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-05 22:53:48,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 22:53:48,814 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 22:53:48,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 22:53:49,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 22:53:49,015 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 22:53:49,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 22:53:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash -634496944, now seen corresponding path program 1 times [2025-02-05 22:53:49,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 22:53:49,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353930259] [2025-02-05 22:53:49,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:49,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 22:53:49,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:53:49,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:53:49,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:49,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 51 proven. 81 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2025-02-05 22:53:55,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 22:53:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353930259] [2025-02-05 22:53:55,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353930259] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 22:53:55,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404818151] [2025-02-05 22:53:55,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 22:53:55,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 22:53:55,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 22:53:55,838 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 22:53:55,839 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 22:53:55,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-05 22:53:55,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-05 22:53:55,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 22:53:55,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 22:53:55,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-05 22:53:56,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 22:53:57,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 491 proven. 273 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-02-05 22:53:57,625 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 22:54:05,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 84 proven. 285 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2025-02-05 22:54:05,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404818151] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 22:54:05,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 22:54:05,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 25, 22] total 51 [2025-02-05 22:54:05,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173958358] [2025-02-05 22:54:05,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 22:54:05,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-05 22:54:05,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 22:54:05,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-05 22:54:05,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=594, Invalid=1955, Unknown=1, NotChecked=0, Total=2550 [2025-02-05 22:54:05,009 INFO L87 Difference]: Start difference. First operand 371 states and 488 transitions. Second operand has 51 states, 47 states have (on average 2.978723404255319) internal successors, (140), 45 states have internal predecessors, (140), 17 states have call successors, (62), 8 states have call predecessors, (62), 15 states have return successors, (64), 16 states have call predecessors, (64), 17 states have call successors, (64) [2025-02-05 22:54:14,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []