./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_loopvsstraightlinecode_25-while_file-22.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 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:27:10,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:27:10,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:27:10,734 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:27:10,734 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:27:10,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:27:10,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:27:10,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:27:10,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:27:10,755 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:27:10,756 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:27:10,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:27:10,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:27:10,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:27:10,756 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:27:10,757 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:27:10,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:27:10,758 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:27:10,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:27:10,758 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:27:10,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:27:10,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:27:10,760 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 -> 211bead296e124e614440acc5c0a2ec479c384857f4a7a38003b7b558015a0bc [2025-01-09 13:27:10,971 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:27:10,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:27:10,982 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:27:10,984 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:27:10,984 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:27:10,986 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2025-01-09 13:27:12,135 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6f41d227/1e0975094bea4a759501b7458a6dc57f/FLAG09b2d6f15 [2025-01-09 13:27:12,387 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:27:12,388 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-22.i [2025-01-09 13:27:12,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6f41d227/1e0975094bea4a759501b7458a6dc57f/FLAG09b2d6f15 [2025-01-09 13:27:12,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b6f41d227/1e0975094bea4a759501b7458a6dc57f [2025-01-09 13:27:12,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:27:12,711 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:27:12,711 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:27:12,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:27:12,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:27:12,716 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:12,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4922ca42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12, skipping insertion in model container [2025-01-09 13:27:12,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:12,728 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:27:12,840 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_loopvsstraightlinecode_25-while_file-22.i[915,928] [2025-01-09 13:27:12,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:27:12,891 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:27:12,902 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_loopvsstraightlinecode_25-while_file-22.i[915,928] [2025-01-09 13:27:12,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:27:12,938 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:27:12,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12 WrapperNode [2025-01-09 13:27:12,940 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:27:12,941 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:27:12,941 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:27:12,942 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:27:12,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:12,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:12,979 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 104 [2025-01-09 13:27:12,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:27:12,980 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:27:12,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:27:12,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:27:12,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:12,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:12,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,006 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-01-09 13:27:13,007 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,007 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,014 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,023 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,028 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:27:13,029 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:27:13,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:27:13,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:27:13,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (1/1) ... [2025-01-09 13:27:13,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:27:13,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:13,058 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-01-09 13:27:13,061 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-01-09 13:27:13,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:27:13,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:27:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:27:13,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:27:13,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:27:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:27:13,131 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:27:13,132 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:27:13,305 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 13:27:13,306 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:27:13,311 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:27:13,313 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:27:13,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:27:13 BoogieIcfgContainer [2025-01-09 13:27:13,314 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:27:13,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:27:13,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:27:13,319 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:27:13,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:27:12" (1/3) ... [2025-01-09 13:27:13,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184d8927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:27:13, skipping insertion in model container [2025-01-09 13:27:13,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:27:12" (2/3) ... [2025-01-09 13:27:13,321 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@184d8927 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:27:13, skipping insertion in model container [2025-01-09 13:27:13,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:27:13" (3/3) ... [2025-01-09 13:27:13,322 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-22.i [2025-01-09 13:27:13,333 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:27:13,334 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-while_file-22.i that has 2 procedures, 47 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:27:13,378 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:27:13,388 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;@a897c53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:27:13,389 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:27:13,392 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 13:27:13,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 13:27:13,399 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:13,399 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:13,400 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:13,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:13,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1589019065, now seen corresponding path program 1 times [2025-01-09 13:27:13,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:13,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302703817] [2025-01-09 13:27:13,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:13,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:13,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:27:13,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:27:13,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:13,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 13:27:13,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:13,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302703817] [2025-01-09 13:27:13,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302703817] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:13,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051941992] [2025-01-09 13:27:13,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:13,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:13,593 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-01-09 13:27:13,595 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-01-09 13:27:13,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:27:13,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:27:13,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:13,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:13,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:27:13,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:13,707 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-01-09 13:27:13,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:27:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051941992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:27:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:27:13,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24093527] [2025-01-09 13:27:13,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:13,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:27:13,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:13,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:27:13,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:27:13,726 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4054054054054055) internal successors, (52), 38 states have internal predecessors, (52), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 13:27:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:13,739 INFO L93 Difference]: Finished difference Result 86 states and 132 transitions. [2025-01-09 13:27:13,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:27:13,741 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2025-01-09 13:27:13,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:13,744 INFO L225 Difference]: With dead ends: 86 [2025-01-09 13:27:13,745 INFO L226 Difference]: Without dead ends: 42 [2025-01-09 13:27:13,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-01-09 13:27:13,748 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:13,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:27:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-01-09 13:27:13,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-01-09 13:27:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 13:27:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2025-01-09 13:27:13,772 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 58 [2025-01-09 13:27:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:13,772 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2025-01-09 13:27:13,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-09 13:27:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2025-01-09 13:27:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 13:27:13,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:13,774 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:13,781 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-01-09 13:27:13,975 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-01-09 13:27:13,975 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:13,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash 157246543, now seen corresponding path program 1 times [2025-01-09 13:27:13,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:13,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543144743] [2025-01-09 13:27:13,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:13,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:13,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:27:14,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:27:14,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:14,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:14,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:14,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543144743] [2025-01-09 13:27:14,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543144743] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:14,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:14,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:27:14,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406560860] [2025-01-09 13:27:14,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:14,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:27:14,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:14,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:27:14,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:14,193 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:14,215 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2025-01-09 13:27:14,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:27:14,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2025-01-09 13:27:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:14,216 INFO L225 Difference]: With dead ends: 82 [2025-01-09 13:27:14,216 INFO L226 Difference]: Without dead ends: 43 [2025-01-09 13:27:14,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:14,217 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:14,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:27:14,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-01-09 13:27:14,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-01-09 13:27:14,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-01-09 13:27:14,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2025-01-09 13:27:14,224 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 58 [2025-01-09 13:27:14,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:14,225 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2025-01-09 13:27:14,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:14,225 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2025-01-09 13:27:14,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-01-09 13:27:14,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:14,226 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:14,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:27:14,227 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:14,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:14,227 INFO L85 PathProgramCache]: Analyzing trace with hash 966593169, now seen corresponding path program 1 times [2025-01-09 13:27:14,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:14,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-01-09 13:27:14,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:14,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:14,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 13:27:14,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 13:27:14,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:14,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:14,617 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:14,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:14,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426235210] [2025-01-09 13:27:14,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426235210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:14,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:14,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:27:14,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520830732] [2025-01-09 13:27:14,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:14,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:27:14,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:14,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:27:14,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:27:14,619 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:14,787 INFO L93 Difference]: Finished difference Result 144 states and 192 transitions. [2025-01-09 13:27:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:27:14,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2025-01-09 13:27:14,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:14,788 INFO L225 Difference]: With dead ends: 144 [2025-01-09 13:27:14,788 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 13:27:14,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:27:14,789 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 84 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:14,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 161 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 13:27:14,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73. [2025-01-09 13:27:14,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:27:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2025-01-09 13:27:14,802 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 58 [2025-01-09 13:27:14,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:14,803 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2025-01-09 13:27:14,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:14,803 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2025-01-09 13:27:14,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:27:14,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:14,805 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:14,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:27:14,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:14,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash -590332162, now seen corresponding path program 1 times [2025-01-09 13:27:14,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:14,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596458626] [2025-01-09 13:27:14,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:14,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:14,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:27:14,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:27:14,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:14,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:15,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596458626] [2025-01-09 13:27:15,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596458626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:15,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:15,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:27:15,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116462803] [2025-01-09 13:27:15,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:15,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:27:15,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:15,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:27:15,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:27:15,007 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:15,170 INFO L93 Difference]: Finished difference Result 148 states and 195 transitions. [2025-01-09 13:27:15,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:27:15,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-01-09 13:27:15,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:15,171 INFO L225 Difference]: With dead ends: 148 [2025-01-09 13:27:15,171 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 13:27:15,172 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:27:15,172 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:15,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 187 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:15,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 13:27:15,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 73. [2025-01-09 13:27:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:27:15,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2025-01-09 13:27:15,190 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 59 [2025-01-09 13:27:15,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:15,193 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2025-01-09 13:27:15,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,193 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2025-01-09 13:27:15,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:27:15,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:15,194 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:15,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:27:15,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:15,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:15,194 INFO L85 PathProgramCache]: Analyzing trace with hash 219014464, now seen corresponding path program 1 times [2025-01-09 13:27:15,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:15,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381427620] [2025-01-09 13:27:15,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:15,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:15,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:27:15,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:27:15,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:15,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:15,376 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:15,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:15,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381427620] [2025-01-09 13:27:15,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381427620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:15,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:15,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:27:15,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588211842] [2025-01-09 13:27:15,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:15,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:27:15,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:15,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:27:15,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:27:15,379 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:15,456 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2025-01-09 13:27:15,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:27:15,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-01-09 13:27:15,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:15,458 INFO L225 Difference]: With dead ends: 140 [2025-01-09 13:27:15,459 INFO L226 Difference]: Without dead ends: 89 [2025-01-09 13:27:15,460 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-01-09 13:27:15,460 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 53 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:15,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 147 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:15,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-01-09 13:27:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 62. [2025-01-09 13:27:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:27:15,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2025-01-09 13:27:15,477 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 59 [2025-01-09 13:27:15,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:15,478 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2025-01-09 13:27:15,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,479 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2025-01-09 13:27:15,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:27:15,480 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:15,480 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:15,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:27:15,480 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:15,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:15,481 INFO L85 PathProgramCache]: Analyzing trace with hash -169946634, now seen corresponding path program 1 times [2025-01-09 13:27:15,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:15,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142526083] [2025-01-09 13:27:15,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:15,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:15,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:27:15,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:27:15,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:15,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:15,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:15,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142526083] [2025-01-09 13:27:15,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142526083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:15,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:15,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:27:15,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107999919] [2025-01-09 13:27:15,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:15,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:27:15,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:15,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:27:15,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:15,527 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:15,548 INFO L93 Difference]: Finished difference Result 123 states and 162 transitions. [2025-01-09 13:27:15,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:27:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-01-09 13:27:15,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:15,551 INFO L225 Difference]: With dead ends: 123 [2025-01-09 13:27:15,551 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 13:27:15,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:15,552 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 26 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:15,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 118 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:27:15,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 13:27:15,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-01-09 13:27:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.1914893617021276) internal successors, (56), 47 states have internal predecessors, (56), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 13:27:15,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2025-01-09 13:27:15,562 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 59 [2025-01-09 13:27:15,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:15,562 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2025-01-09 13:27:15,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,562 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2025-01-09 13:27:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-01-09 13:27:15,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:15,563 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:15,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:27:15,563 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:15,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:15,563 INFO L85 PathProgramCache]: Analyzing trace with hash 416859380, now seen corresponding path program 1 times [2025-01-09 13:27:15,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:15,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145353459] [2025-01-09 13:27:15,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:15,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:15,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 13:27:15,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 13:27:15,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:15,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:15,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:15,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145353459] [2025-01-09 13:27:15,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145353459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:15,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:15,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:27:15,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9584156] [2025-01-09 13:27:15,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:15,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:27:15,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:15,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:27:15,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:27:15,796 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:15,965 INFO L93 Difference]: Finished difference Result 203 states and 265 transitions. [2025-01-09 13:27:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:27:15,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2025-01-09 13:27:15,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:15,966 INFO L225 Difference]: With dead ends: 203 [2025-01-09 13:27:15,966 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 13:27:15,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:27:15,967 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 92 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:15,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 214 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:15,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 13:27:15,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 123. [2025-01-09 13:27:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:27:15,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2025-01-09 13:27:15,988 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 59 [2025-01-09 13:27:15,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:15,989 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2025-01-09 13:27:15,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:15,989 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2025-01-09 13:27:15,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 13:27:15,991 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:15,991 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:15,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:27:15,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:15,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:15,992 INFO L85 PathProgramCache]: Analyzing trace with hash -368039531, now seen corresponding path program 1 times [2025-01-09 13:27:15,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:15,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-01-09 13:27:15,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:15,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:15,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 13:27:16,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 13:27:16,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:16,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:16,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:16,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400029858] [2025-01-09 13:27:16,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400029858] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:16,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:16,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:27:16,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308098379] [2025-01-09 13:27:16,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:16,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:27:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:27:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:16,033 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:16,073 INFO L93 Difference]: Finished difference Result 300 states and 403 transitions. [2025-01-09 13:27:16,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:27:16,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2025-01-09 13:27:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:16,075 INFO L225 Difference]: With dead ends: 300 [2025-01-09 13:27:16,075 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 13:27:16,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:16,076 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 28 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:16,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 101 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:27:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 13:27:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2025-01-09 13:27:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.2307692307692308) internal successors, (192), 156 states have internal predecessors, (192), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-01-09 13:27:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 262 transitions. [2025-01-09 13:27:16,098 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 262 transitions. Word has length 60 [2025-01-09 13:27:16,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:16,098 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 262 transitions. [2025-01-09 13:27:16,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:16,099 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 262 transitions. [2025-01-09 13:27:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 13:27:16,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:16,099 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:16,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:27:16,099 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:16,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:16,100 INFO L85 PathProgramCache]: Analyzing trace with hash -452210437, now seen corresponding path program 1 times [2025-01-09 13:27:16,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:16,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912618994] [2025-01-09 13:27:16,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:16,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:16,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 13:27:16,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 13:27:16,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:16,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:16,354 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:16,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:16,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912618994] [2025-01-09 13:27:16,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912618994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:16,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:16,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:27:16,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994231956] [2025-01-09 13:27:16,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:16,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:27:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:16,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:27:16,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:27:16,356 INFO L87 Difference]: Start difference. First operand 197 states and 262 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:16,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:16,633 INFO L93 Difference]: Finished difference Result 321 states and 424 transitions. [2025-01-09 13:27:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:27:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2025-01-09 13:27:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:16,636 INFO L225 Difference]: With dead ends: 321 [2025-01-09 13:27:16,636 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 13:27:16,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:27:16,636 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 72 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:16,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 250 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:27:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 13:27:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 246. [2025-01-09 13:27:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 197 states have (on average 1.233502538071066) internal successors, (243), 197 states have internal predecessors, (243), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:27:16,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 327 transitions. [2025-01-09 13:27:16,666 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 327 transitions. Word has length 60 [2025-01-09 13:27:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:16,667 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 327 transitions. [2025-01-09 13:27:16,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 327 transitions. [2025-01-09 13:27:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-01-09 13:27:16,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:16,669 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:16,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 13:27:16,670 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:16,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:16,670 INFO L85 PathProgramCache]: Analyzing trace with hash 357136189, now seen corresponding path program 1 times [2025-01-09 13:27:16,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:16,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-01-09 13:27:16,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:16,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:16,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 13:27:16,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 13:27:16,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:16,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:17,533 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:17,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:17,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-01-09 13:27:17,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501857509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:17,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:17,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:27:17,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981080209] [2025-01-09 13:27:17,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:17,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:27:17,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:17,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:27:17,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:27:17,535 INFO L87 Difference]: Start difference. First operand 246 states and 327 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:17,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:17,762 INFO L93 Difference]: Finished difference Result 566 states and 747 transitions. [2025-01-09 13:27:17,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:27:17,763 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2025-01-09 13:27:17,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:17,767 INFO L225 Difference]: With dead ends: 566 [2025-01-09 13:27:17,767 INFO L226 Difference]: Without dead ends: 416 [2025-01-09 13:27:17,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:27:17,779 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 201 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:17,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 314 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:27:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-01-09 13:27:17,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 266. [2025-01-09 13:27:17,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 209 states have (on average 1.2200956937799043) internal successors, (255), 209 states have internal predecessors, (255), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:27:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 353 transitions. [2025-01-09 13:27:17,812 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 353 transitions. Word has length 60 [2025-01-09 13:27:17,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:17,813 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 353 transitions. [2025-01-09 13:27:17,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 353 transitions. [2025-01-09 13:27:17,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 13:27:17,813 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:17,814 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:17,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:27:17,814 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:17,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash 985727098, now seen corresponding path program 1 times [2025-01-09 13:27:17,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:17,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 13:27:17,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:17,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:17,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 13:27:17,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 13:27:17,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:17,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:17,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:17,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423764901] [2025-01-09 13:27:17,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423764901] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:17,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:17,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:27:17,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994935133] [2025-01-09 13:27:17,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:17,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:27:17,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:17,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:27:17,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:27:17,866 INFO L87 Difference]: Start difference. First operand 266 states and 353 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:17,924 INFO L93 Difference]: Finished difference Result 512 states and 679 transitions. [2025-01-09 13:27:17,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:27:17,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2025-01-09 13:27:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:17,928 INFO L225 Difference]: With dead ends: 512 [2025-01-09 13:27:17,928 INFO L226 Difference]: Without dead ends: 268 [2025-01-09 13:27:17,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-01-09 13:27:17,929 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 26 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:17,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 143 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:27:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-01-09 13:27:17,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2025-01-09 13:27:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 209 states have (on average 1.2105263157894737) internal successors, (253), 209 states have internal predecessors, (253), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:27:17,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 351 transitions. [2025-01-09 13:27:17,953 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 351 transitions. Word has length 61 [2025-01-09 13:27:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:17,953 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 351 transitions. [2025-01-09 13:27:17,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:17,953 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 351 transitions. [2025-01-09 13:27:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 13:27:17,954 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:17,954 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:17,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 13:27:17,955 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:17,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:17,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1795073724, now seen corresponding path program 1 times [2025-01-09 13:27:17,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:17,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-01-09 13:27:17,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:17,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:17,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 13:27:17,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 13:27:17,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:17,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:18,462 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:18,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:18,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445968057] [2025-01-09 13:27:18,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445968057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:18,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:18,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:27:18,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329211153] [2025-01-09 13:27:18,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:18,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:27:18,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:18,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:27:18,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:27:18,464 INFO L87 Difference]: Start difference. First operand 266 states and 351 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:18,635 INFO L93 Difference]: Finished difference Result 479 states and 625 transitions. [2025-01-09 13:27:18,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:27:18,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2025-01-09 13:27:18,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:18,638 INFO L225 Difference]: With dead ends: 479 [2025-01-09 13:27:18,638 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 13:27:18,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:27:18,638 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 93 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:18,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 157 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:18,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 13:27:18,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 283. [2025-01-09 13:27:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 226 states have (on average 1.2123893805309736) internal successors, (274), 226 states have internal predecessors, (274), 49 states have call successors, (49), 7 states have call predecessors, (49), 7 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 13:27:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 372 transitions. [2025-01-09 13:27:18,661 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 372 transitions. Word has length 61 [2025-01-09 13:27:18,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:18,661 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 372 transitions. [2025-01-09 13:27:18,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:18,661 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 372 transitions. [2025-01-09 13:27:18,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-01-09 13:27:18,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:18,662 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:18,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 13:27:18,662 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:18,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2053239162, now seen corresponding path program 1 times [2025-01-09 13:27:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-01-09 13:27:18,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:18,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 13:27:18,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 13:27:18,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:18,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:18,697 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:18,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:18,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373904381] [2025-01-09 13:27:18,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373904381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:18,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:18,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:27:18,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902850277] [2025-01-09 13:27:18,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:18,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:27:18,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:18,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:27:18,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:18,699 INFO L87 Difference]: Start difference. First operand 283 states and 372 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:18,732 INFO L93 Difference]: Finished difference Result 466 states and 614 transitions. [2025-01-09 13:27:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:27:18,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2025-01-09 13:27:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:18,733 INFO L225 Difference]: With dead ends: 466 [2025-01-09 13:27:18,734 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 13:27:18,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:27:18,734 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:18,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:27:18,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 13:27:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 152. [2025-01-09 13:27:18,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.1596638655462186) internal successors, (138), 119 states have internal predecessors, (138), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:27:18,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 194 transitions. [2025-01-09 13:27:18,746 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 194 transitions. Word has length 61 [2025-01-09 13:27:18,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:18,746 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 194 transitions. [2025-01-09 13:27:18,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:18,746 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 194 transitions. [2025-01-09 13:27:18,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-09 13:27:18,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:18,747 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:18,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 13:27:18,747 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:18,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:18,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1945593969, now seen corresponding path program 1 times [2025-01-09 13:27:18,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:18,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135572453] [2025-01-09 13:27:18,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:18,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:18,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 13:27:18,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 13:27:18,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:18,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:19,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:19,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135572453] [2025-01-09 13:27:19,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135572453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:19,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:19,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 13:27:19,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219149586] [2025-01-09 13:27:19,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:19,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:27:19,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:19,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:27:19,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-01-09 13:27:19,278 INFO L87 Difference]: Start difference. First operand 152 states and 194 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:19,884 INFO L93 Difference]: Finished difference Result 248 states and 309 transitions. [2025-01-09 13:27:19,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 13:27:19,884 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2025-01-09 13:27:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:19,885 INFO L225 Difference]: With dead ends: 248 [2025-01-09 13:27:19,886 INFO L226 Difference]: Without dead ends: 246 [2025-01-09 13:27:19,886 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2025-01-09 13:27:19,886 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 227 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:19,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 463 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:27:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2025-01-09 13:27:19,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 169. [2025-01-09 13:27:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.1544117647058822) internal successors, (157), 136 states have internal predecessors, (157), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:27:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 213 transitions. [2025-01-09 13:27:19,897 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 213 transitions. Word has length 63 [2025-01-09 13:27:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:19,897 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 213 transitions. [2025-01-09 13:27:19,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 213 transitions. [2025-01-09 13:27:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-01-09 13:27:19,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:19,898 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 13:27:19,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 13:27:19,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:19,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1942668208, now seen corresponding path program 1 times [2025-01-09 13:27:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-01-09 13:27:19,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:19,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:19,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 13:27:19,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 13:27:19,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:19,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-09 13:27:20,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562401806] [2025-01-09 13:27:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562401806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:20,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:20,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 13:27:20,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000870968] [2025-01-09 13:27:20,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:20,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 13:27:20,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:20,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 13:27:20,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:27:20,231 INFO L87 Difference]: Start difference. First operand 169 states and 213 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:20,400 INFO L93 Difference]: Finished difference Result 178 states and 221 transitions. [2025-01-09 13:27:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 13:27:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2025-01-09 13:27:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:20,402 INFO L225 Difference]: With dead ends: 178 [2025-01-09 13:27:20,402 INFO L226 Difference]: Without dead ends: 176 [2025-01-09 13:27:20,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-01-09 13:27:20,403 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 44 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:20,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 404 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-01-09 13:27:20,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 169. [2025-01-09 13:27:20,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.1470588235294117) internal successors, (156), 136 states have internal predecessors, (156), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 13:27:20,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 212 transitions. [2025-01-09 13:27:20,417 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 212 transitions. Word has length 64 [2025-01-09 13:27:20,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:20,417 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 212 transitions. [2025-01-09 13:27:20,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 212 transitions. [2025-01-09 13:27:20,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 13:27:20,419 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:20,419 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:20,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 13:27:20,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:20,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash -549334494, now seen corresponding path program 1 times [2025-01-09 13:27:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:20,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-01-09 13:27:20,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:20,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:27:20,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:27:20,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:20,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:21,101 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:27:21,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775391210] [2025-01-09 13:27:21,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775391210] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:21,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195402599] [2025-01-09 13:27:21,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:21,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:21,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:21,104 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-01-09 13:27:21,106 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-01-09 13:27:21,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 13:27:21,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 13:27:21,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:21,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:21,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-01-09 13:27:21,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:21,518 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 215 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2025-01-09 13:27:21,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:27:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:27:24,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195402599] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:27:24,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:27:24,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 13] total 29 [2025-01-09 13:27:24,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490602829] [2025-01-09 13:27:24,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:27:24,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-01-09 13:27:24,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:24,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-01-09 13:27:24,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2025-01-09 13:27:24,622 INFO L87 Difference]: Start difference. First operand 169 states and 212 transitions. Second operand has 29 states, 29 states have (on average 4.137931034482759) internal successors, (120), 29 states have internal predecessors, (120), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-01-09 13:27:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:33,885 INFO L93 Difference]: Finished difference Result 766 states and 941 transitions. [2025-01-09 13:27:33,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-01-09 13:27:33,885 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.137931034482759) internal successors, (120), 29 states have internal predecessors, (120), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) Word has length 118 [2025-01-09 13:27:33,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:33,888 INFO L225 Difference]: With dead ends: 766 [2025-01-09 13:27:33,888 INFO L226 Difference]: Without dead ends: 657 [2025-01-09 13:27:33,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4682 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2572, Invalid=9860, Unknown=0, NotChecked=0, Total=12432 [2025-01-09 13:27:33,894 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1161 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 1531 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 1374 SdHoareTripleChecker+Invalid, 1920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 1531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:33,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 1374 Invalid, 1920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 1531 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 13:27:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2025-01-09 13:27:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 369. [2025-01-09 13:27:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 288 states have (on average 1.1388888888888888) internal successors, (328), 288 states have internal predecessors, (328), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 13:27:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 468 transitions. [2025-01-09 13:27:33,927 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 468 transitions. Word has length 118 [2025-01-09 13:27:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:33,927 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 468 transitions. [2025-01-09 13:27:33,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.137931034482759) internal successors, (120), 29 states have internal predecessors, (120), 4 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 4 states have call predecessors, (35), 4 states have call successors, (35) [2025-01-09 13:27:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 468 transitions. [2025-01-09 13:27:33,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:27:33,929 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:33,929 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:33,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 13:27:34,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 13:27:34,130 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:34,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash -339449459, now seen corresponding path program 1 times [2025-01-09 13:27:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:34,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240861739] [2025-01-09 13:27:34,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:34,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:27:34,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:27:34,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:34,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:34,658 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:27:34,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:34,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240861739] [2025-01-09 13:27:34,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240861739] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:34,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316106913] [2025-01-09 13:27:34,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:34,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:34,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:34,660 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-01-09 13:27:34,662 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-01-09 13:27:34,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:27:34,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:27:34,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:34,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:34,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:27:34,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 13:27:34,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:27:34,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316106913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:34,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:27:34,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 16 [2025-01-09 13:27:34,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480964539] [2025-01-09 13:27:34,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:34,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:27:34,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:34,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:27:34,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:27:34,809 INFO L87 Difference]: Start difference. First operand 369 states and 468 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:34,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:34,932 INFO L93 Difference]: Finished difference Result 742 states and 955 transitions. [2025-01-09 13:27:34,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:27:34,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 119 [2025-01-09 13:27:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:34,938 INFO L225 Difference]: With dead ends: 742 [2025-01-09 13:27:34,938 INFO L226 Difference]: Without dead ends: 519 [2025-01-09 13:27:34,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-01-09 13:27:34,940 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 116 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:34,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 191 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:34,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2025-01-09 13:27:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 369. [2025-01-09 13:27:34,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 288 states have (on average 1.1354166666666667) internal successors, (327), 288 states have internal predecessors, (327), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 13:27:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 467 transitions. [2025-01-09 13:27:34,971 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 467 transitions. Word has length 119 [2025-01-09 13:27:34,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:34,971 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 467 transitions. [2025-01-09 13:27:34,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 467 transitions. [2025-01-09 13:27:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 13:27:34,972 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:34,972 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:34,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 13:27:35,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:35,173 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:35,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:35,174 INFO L85 PathProgramCache]: Analyzing trace with hash 469897167, now seen corresponding path program 1 times [2025-01-09 13:27:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:35,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244652778] [2025-01-09 13:27:35,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:35,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:35,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:27:35,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:27:35,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:35,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:27:36,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244652778] [2025-01-09 13:27:36,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244652778] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840890728] [2025-01-09 13:27:36,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:36,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:36,043 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-01-09 13:27:36,044 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-01-09 13:27:36,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 13:27:36,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 13:27:36,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:36,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:36,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 13:27:36,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 13:27:36,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:27:36,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840890728] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:36,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:27:36,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 15 [2025-01-09 13:27:36,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038265413] [2025-01-09 13:27:36,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:36,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:27:36,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:36,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:27:36,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:27:36,547 INFO L87 Difference]: Start difference. First operand 369 states and 467 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:36,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:36,663 INFO L93 Difference]: Finished difference Result 668 states and 844 transitions. [2025-01-09 13:27:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:27:36,663 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 119 [2025-01-09 13:27:36,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:36,666 INFO L225 Difference]: With dead ends: 668 [2025-01-09 13:27:36,666 INFO L226 Difference]: Without dead ends: 451 [2025-01-09 13:27:36,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-01-09 13:27:36,668 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 34 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:36,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 187 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:36,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2025-01-09 13:27:36,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 370. [2025-01-09 13:27:36,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 289 states have (on average 1.1349480968858132) internal successors, (328), 289 states have internal predecessors, (328), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 70 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 13:27:36,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 468 transitions. [2025-01-09 13:27:36,696 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 468 transitions. Word has length 119 [2025-01-09 13:27:36,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:36,697 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 468 transitions. [2025-01-09 13:27:36,697 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:36,697 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 468 transitions. [2025-01-09 13:27:36,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 13:27:36,700 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:36,700 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:36,707 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-01-09 13:27:36,907 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,SelfDestructingSolverStorable17 [2025-01-09 13:27:36,908 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:36,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:36,908 INFO L85 PathProgramCache]: Analyzing trace with hash 724583588, now seen corresponding path program 1 times [2025-01-09 13:27:36,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:36,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213189678] [2025-01-09 13:27:36,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:36,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:36,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 13:27:36,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 13:27:36,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:36,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 13:27:37,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:37,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213189678] [2025-01-09 13:27:37,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213189678] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:37,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:37,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 13:27:37,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449622044] [2025-01-09 13:27:37,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:37,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:27:37,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:37,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:27:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:27:37,253 INFO L87 Difference]: Start difference. First operand 370 states and 468 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:37,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:37,433 INFO L93 Difference]: Finished difference Result 557 states and 697 transitions. [2025-01-09 13:27:37,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:27:37,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 120 [2025-01-09 13:27:37,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:37,437 INFO L225 Difference]: With dead ends: 557 [2025-01-09 13:27:37,437 INFO L226 Difference]: Without dead ends: 407 [2025-01-09 13:27:37,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-01-09 13:27:37,438 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 84 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:37,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 164 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2025-01-09 13:27:37,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 343. [2025-01-09 13:27:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 270 states have (on average 1.1185185185185185) internal successors, (302), 270 states have internal predecessors, (302), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 13:27:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 428 transitions. [2025-01-09 13:27:37,483 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 428 transitions. Word has length 120 [2025-01-09 13:27:37,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:37,485 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 428 transitions. [2025-01-09 13:27:37,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 428 transitions. [2025-01-09 13:27:37,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 13:27:37,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:37,487 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:37,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 13:27:37,488 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1306652045, now seen corresponding path program 1 times [2025-01-09 13:27:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:37,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144987611] [2025-01-09 13:27:37,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:37,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 13:27:37,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 13:27:37,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:37,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:27:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:38,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144987611] [2025-01-09 13:27:38,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144987611] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:38,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613165486] [2025-01-09 13:27:38,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:38,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:38,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:38,682 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-01-09 13:27:38,683 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-01-09 13:27:38,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 13:27:38,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 13:27:38,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:38,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:38,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:27:38,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:39,247 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 13:27:39,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:27:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613165486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:39,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:27:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [12] total 14 [2025-01-09 13:27:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793590464] [2025-01-09 13:27:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:39,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:27:39,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:27:39,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:27:39,249 INFO L87 Difference]: Start difference. First operand 343 states and 428 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:39,354 INFO L93 Difference]: Finished difference Result 528 states and 653 transitions. [2025-01-09 13:27:39,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 13:27:39,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 121 [2025-01-09 13:27:39,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:39,356 INFO L225 Difference]: With dead ends: 528 [2025-01-09 13:27:39,356 INFO L226 Difference]: Without dead ends: 405 [2025-01-09 13:27:39,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-01-09 13:27:39,357 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 38 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:39,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 172 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:39,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-01-09 13:27:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 338. [2025-01-09 13:27:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 265 states have (on average 1.1132075471698113) internal successors, (295), 265 states have internal predecessors, (295), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 13:27:39,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 421 transitions. [2025-01-09 13:27:39,379 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 421 transitions. Word has length 121 [2025-01-09 13:27:39,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:39,379 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 421 transitions. [2025-01-09 13:27:39,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 421 transitions. [2025-01-09 13:27:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 13:27:39,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:39,381 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:39,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 13:27:39,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:39,585 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:39,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:39,585 INFO L85 PathProgramCache]: Analyzing trace with hash -294027105, now seen corresponding path program 1 times [2025-01-09 13:27:39,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:39,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014772318] [2025-01-09 13:27:39,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:39,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:39,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:27:39,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:27:39,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:39,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:40,036 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:27:40,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:40,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014772318] [2025-01-09 13:27:40,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014772318] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:40,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013257900] [2025-01-09 13:27:40,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:40,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:40,039 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-01-09 13:27:40,041 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-01-09 13:27:40,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:27:40,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:27:40,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:40,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:40,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 13:27:40,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:40,231 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 11 proven. 39 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2025-01-09 13:27:40,232 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:27:40,440 INFO L134 CoverageAnalysis]: Checked inductivity of 393 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-01-09 13:27:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013257900] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:27:40,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 11] total 22 [2025-01-09 13:27:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159466095] [2025-01-09 13:27:40,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 13:27:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:40,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 13:27:40,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-01-09 13:27:40,441 INFO L87 Difference]: Start difference. First operand 338 states and 421 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:40,640 INFO L93 Difference]: Finished difference Result 439 states and 547 transitions. [2025-01-09 13:27:40,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 13:27:40,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2025-01-09 13:27:40,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:40,643 INFO L225 Difference]: With dead ends: 439 [2025-01-09 13:27:40,643 INFO L226 Difference]: Without dead ends: 437 [2025-01-09 13:27:40,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 233 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:27:40,644 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 38 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:40,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 377 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-01-09 13:27:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 338. [2025-01-09 13:27:40,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 265 states have (on average 1.109433962264151) internal successors, (294), 265 states have internal predecessors, (294), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 13:27:40,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 420 transitions. [2025-01-09 13:27:40,669 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 420 transitions. Word has length 122 [2025-01-09 13:27:40,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:40,670 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 420 transitions. [2025-01-09 13:27:40,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:40,670 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 420 transitions. [2025-01-09 13:27:40,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 13:27:40,671 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:40,671 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:40,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 13:27:40,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-01-09 13:27:40,872 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:40,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:40,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1347723843, now seen corresponding path program 1 times [2025-01-09 13:27:40,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:40,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398924177] [2025-01-09 13:27:40,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:40,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:40,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 13:27:40,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 13:27:40,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:40,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:41,249 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 13:27:41,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:41,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398924177] [2025-01-09 13:27:41,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398924177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:41,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:41,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:27:41,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073787620] [2025-01-09 13:27:41,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:41,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:27:41,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:41,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:27:41,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:27:41,251 INFO L87 Difference]: Start difference. First operand 338 states and 420 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:41,580 INFO L93 Difference]: Finished difference Result 505 states and 625 transitions. [2025-01-09 13:27:41,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:27:41,580 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 122 [2025-01-09 13:27:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:41,583 INFO L225 Difference]: With dead ends: 505 [2025-01-09 13:27:41,583 INFO L226 Difference]: Without dead ends: 503 [2025-01-09 13:27:41,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:27:41,585 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 70 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:41,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 519 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:27:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-01-09 13:27:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 368. [2025-01-09 13:27:41,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 295 states have (on average 1.1016949152542372) internal successors, (325), 295 states have internal predecessors, (325), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 13:27:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 451 transitions. [2025-01-09 13:27:41,614 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 451 transitions. Word has length 122 [2025-01-09 13:27:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 451 transitions. [2025-01-09 13:27:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 451 transitions. [2025-01-09 13:27:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 13:27:41,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:41,615 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:41,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 13:27:41,615 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:41,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1697014918, now seen corresponding path program 1 times [2025-01-09 13:27:41,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698969760] [2025-01-09 13:27:41,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:41,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:41,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 13:27:41,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 13:27:41,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:41,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 9 proven. 21 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 13:27:42,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:42,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698969760] [2025-01-09 13:27:42,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698969760] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:42,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629940672] [2025-01-09 13:27:42,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:42,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:42,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:42,791 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:27:42,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 13:27:42,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 13:27:42,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 13:27:42,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:42,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:42,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 13:27:42,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:44,274 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2025-01-09 13:27:44,274 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:27:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629940672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:44,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:27:44,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 23 [2025-01-09 13:27:44,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601921998] [2025-01-09 13:27:44,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:44,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 13:27:44,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:44,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 13:27:44,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2025-01-09 13:27:44,275 INFO L87 Difference]: Start difference. First operand 368 states and 451 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:44,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:44,582 INFO L93 Difference]: Finished difference Result 498 states and 608 transitions. [2025-01-09 13:27:44,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 13:27:44,583 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2025-01-09 13:27:44,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:44,585 INFO L225 Difference]: With dead ends: 498 [2025-01-09 13:27:44,585 INFO L226 Difference]: Without dead ends: 496 [2025-01-09 13:27:44,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2025-01-09 13:27:44,585 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 61 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:44,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 546 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:27:44,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-01-09 13:27:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 377. [2025-01-09 13:27:44,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 304 states have (on average 1.0986842105263157) internal successors, (334), 304 states have internal predecessors, (334), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 13:27:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 460 transitions. [2025-01-09 13:27:44,616 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 460 transitions. Word has length 123 [2025-01-09 13:27:44,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:44,616 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 460 transitions. [2025-01-09 13:27:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 460 transitions. [2025-01-09 13:27:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 13:27:44,617 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:44,617 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:44,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 13:27:44,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:44,819 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:44,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash 995950340, now seen corresponding path program 1 times [2025-01-09 13:27:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155373200] [2025-01-09 13:27:44,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:44,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:44,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 13:27:44,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 13:27:44,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:44,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2025-01-09 13:27:45,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:45,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155373200] [2025-01-09 13:27:45,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155373200] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:45,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:45,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 13:27:45,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392790475] [2025-01-09 13:27:45,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:45,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 13:27:45,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:45,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 13:27:45,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 13:27:45,424 INFO L87 Difference]: Start difference. First operand 377 states and 460 transitions. Second operand has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:46,090 INFO L93 Difference]: Finished difference Result 543 states and 661 transitions. [2025-01-09 13:27:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 13:27:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 123 [2025-01-09 13:27:46,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:46,093 INFO L225 Difference]: With dead ends: 543 [2025-01-09 13:27:46,093 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 13:27:46,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2025-01-09 13:27:46,094 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 82 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:46,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 651 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:27:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 13:27:46,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 376. [2025-01-09 13:27:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 303 states have (on average 1.1023102310231023) internal successors, (334), 303 states have internal predecessors, (334), 63 states have call successors, (63), 9 states have call predecessors, (63), 9 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 13:27:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 460 transitions. [2025-01-09 13:27:46,129 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 460 transitions. Word has length 123 [2025-01-09 13:27:46,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:46,129 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 460 transitions. [2025-01-09 13:27:46,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5) internal successors, (49), 14 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:46,129 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 460 transitions. [2025-01-09 13:27:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 13:27:46,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:46,132 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 13:27:46,132 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:46,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1573339329, now seen corresponding path program 1 times [2025-01-09 13:27:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389645194] [2025-01-09 13:27:46,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:46,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:46,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 13:27:46,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 13:27:46,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:46,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2025-01-09 13:27:46,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:46,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389645194] [2025-01-09 13:27:46,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389645194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:27:46,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:27:46,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:27:46,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816252366] [2025-01-09 13:27:46,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:46,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:27:46,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:46,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:27:46,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:27:46,529 INFO L87 Difference]: Start difference. First operand 376 states and 460 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:46,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:46,939 INFO L93 Difference]: Finished difference Result 577 states and 714 transitions. [2025-01-09 13:27:46,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 13:27:46,940 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 124 [2025-01-09 13:27:46,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:46,942 INFO L225 Difference]: With dead ends: 577 [2025-01-09 13:27:46,942 INFO L226 Difference]: Without dead ends: 575 [2025-01-09 13:27:46,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:27:46,943 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 102 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:46,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 432 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:27:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2025-01-09 13:27:46,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 460. [2025-01-09 13:27:46,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 363 states have (on average 1.0991735537190082) internal successors, (399), 363 states have internal predecessors, (399), 84 states have call successors, (84), 12 states have call predecessors, (84), 12 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 13:27:46,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 567 transitions. [2025-01-09 13:27:46,986 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 567 transitions. Word has length 124 [2025-01-09 13:27:46,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:46,986 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 567 transitions. [2025-01-09 13:27:46,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:46,986 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 567 transitions. [2025-01-09 13:27:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 13:27:46,988 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:27:46,988 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:27:46,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 13:27:46,988 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:27:46,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:27:46,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1978604781, now seen corresponding path program 1 times [2025-01-09 13:27:46,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:27:46,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894889024] [2025-01-09 13:27:46,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:46,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:27:46,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 13:27:47,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 13:27:47,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:47,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 31 proven. 61 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:27:48,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:27:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894889024] [2025-01-09 13:27:48,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894889024] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:48,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1173388057] [2025-01-09 13:27:48,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:27:48,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:27:48,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:27:48,161 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 13:27:48,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 13:27:48,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 13:27:48,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 13:27:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:27:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:27:48,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 13:27:48,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:27:50,692 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 454 proven. 13 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-01-09 13:27:50,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:27:52,540 INFO L134 CoverageAnalysis]: Checked inductivity of 932 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 908 trivial. 0 not checked. [2025-01-09 13:27:52,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1173388057] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 13:27:52,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:27:52,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15, 16] total 35 [2025-01-09 13:27:52,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620346539] [2025-01-09 13:27:52,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:27:52,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 13:27:52,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:27:52,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 13:27:52,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 13:27:52,543 INFO L87 Difference]: Start difference. First operand 460 states and 567 transitions. Second operand has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:27:52,963 INFO L93 Difference]: Finished difference Result 549 states and 680 transitions. [2025-01-09 13:27:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:27:52,964 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 183 [2025-01-09 13:27:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:27:52,964 INFO L225 Difference]: With dead ends: 549 [2025-01-09 13:27:52,964 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 13:27:52,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 347 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=230, Invalid=1330, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 13:27:52,966 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:27:52,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 356 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:27:52,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 13:27:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 13:27:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 13:27:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 13:27:52,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 183 [2025-01-09 13:27:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:27:52,967 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 13:27:52,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.454545454545454) internal successors, (49), 11 states have internal predecessors, (49), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-01-09 13:27:52,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 13:27:52,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 13:27:52,970 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:27:52,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-09 13:27:53,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-01-09 13:27:53,176 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 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-01-09 13:27:53,177 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.