./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.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_fillercode_fillercodesize_ps-cn-500_file-0.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 2cc8613549263fa9e280e7172125d1234167e6a3b8c0b538287580172fa36964 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:01:44,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:01:44,744 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:01:44,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:01:44,753 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:01:44,788 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:01:44,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:01:44,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:01:44,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:01:44,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:01:44,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:01:44,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:01:44,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:01:44,791 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:01:44,792 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:01:44,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:01:44,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:01:44,792 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:01:44,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:01:44,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:01:44,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:01:44,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:01:44,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:01:44,794 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:01:44,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:44,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:01:44,794 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:01:44,794 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:01:44,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:01:44,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:44,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:01:44,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:01:44,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:01:44,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:01:44,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:01:44,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:01:44,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:01:44,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:01:44,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:01:44,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:01:44,796 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 -> 2cc8613549263fa9e280e7172125d1234167e6a3b8c0b538287580172fa36964 [2025-01-09 10:01:45,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:01:45,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:01:45,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:01:45,137 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:01:45,137 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:01:45,139 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-01-09 10:01:46,381 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/593b8083c/69812fb71e1e4e14a5795d967f3ae9a5/FLAG784443f43 [2025-01-09 10:01:46,724 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:01:46,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-01-09 10:01:46,741 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/593b8083c/69812fb71e1e4e14a5795d967f3ae9a5/FLAG784443f43 [2025-01-09 10:01:46,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/593b8083c/69812fb71e1e4e14a5795d967f3ae9a5 [2025-01-09 10:01:46,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:01:46,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:01:46,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:01:46,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:01:46,976 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:01:46,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:01:46" (1/1) ... [2025-01-09 10:01:46,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c90bcc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:46, skipping insertion in model container [2025-01-09 10:01:46,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:01:46" (1/1) ... [2025-01-09 10:01:47,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:01:47,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i[915,928] [2025-01-09 10:01:47,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:01:47,381 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:01:47,393 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-0.i[915,928] [2025-01-09 10:01:47,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:01:47,505 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:01:47,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47 WrapperNode [2025-01-09 10:01:47,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:01:47,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:01:47,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:01:47,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:01:47,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,630 INFO L138 Inliner]: procedures = 26, calls = 92, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 655 [2025-01-09 10:01:47,630 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:01:47,631 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:01:47,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:01:47,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:01:47,640 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,654 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,687 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 10:01:47,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,717 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,724 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:01:47,762 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:01:47,762 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:01:47,762 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:01:47,763 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (1/1) ... [2025-01-09 10:01:47,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:01:47,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:01:47,799 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:01:47,805 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 10:01:47,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:01:47,825 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:01:47,825 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:01:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:01:47,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:01:47,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:01:47,971 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:01:47,972 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:01:49,189 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-01-09 10:01:49,190 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:01:49,216 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:01:49,216 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:01:49,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:01:49 BoogieIcfgContainer [2025-01-09 10:01:49,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:01:49,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:01:49,219 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:01:49,225 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:01:49,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:01:46" (1/3) ... [2025-01-09 10:01:49,226 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186517eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:01:49, skipping insertion in model container [2025-01-09 10:01:49,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:01:47" (2/3) ... [2025-01-09 10:01:49,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186517eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:01:49, skipping insertion in model container [2025-01-09 10:01:49,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:01:49" (3/3) ... [2025-01-09 10:01:49,228 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-0.i [2025-01-09 10:01:49,243 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:01:49,248 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-0.i that has 2 procedures, 269 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:01:49,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:01:49,326 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;@4fd0b51b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:01:49,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:01:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 269 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 188 states have internal predecessors, (305), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 10:01:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 10:01:49,363 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:49,364 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:49,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:49,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:49,370 INFO L85 PathProgramCache]: Analyzing trace with hash 756519448, now seen corresponding path program 1 times [2025-01-09 10:01:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:49,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410796238] [2025-01-09 10:01:49,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:49,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 10:01:49,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 10:01:49,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:49,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:50,075 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-01-09 10:01:50,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:50,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410796238] [2025-01-09 10:01:50,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410796238] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:01:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674459972] [2025-01-09 10:01:50,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:50,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:01:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:01:50,082 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 10:01:50,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:01:50,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 10:01:50,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 10:01:50,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:50,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:50,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 1291 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:01:50,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:01:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 12168 trivial. 0 not checked. [2025-01-09 10:01:50,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:01:50,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674459972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:50,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:01:50,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:01:50,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656970803] [2025-01-09 10:01:50,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:50,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:01:50,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:50,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:01:50,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:01:50,622 INFO L87 Difference]: Start difference. First operand has 269 states, 187 states have (on average 1.6310160427807487) internal successors, (305), 188 states have internal predecessors, (305), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) Second operand has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 10:01:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:50,697 INFO L93 Difference]: Finished difference Result 530 states and 996 transitions. [2025-01-09 10:01:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:01:50,698 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) Word has length 533 [2025-01-09 10:01:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:50,706 INFO L225 Difference]: With dead ends: 530 [2025-01-09 10:01:50,706 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 10:01:50,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 534 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 10:01:50,716 INFO L435 NwaCegarLoop]: 452 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, 452 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 10:01:50,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 10:01:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-01-09 10:01:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 183 states have (on average 1.6065573770491803) internal successors, (294), 183 states have internal predecessors, (294), 79 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 79 states have call predecessors, (79), 79 states have call successors, (79) [2025-01-09 10:01:50,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 452 transitions. [2025-01-09 10:01:50,809 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 452 transitions. Word has length 533 [2025-01-09 10:01:50,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:50,811 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 452 transitions. [2025-01-09 10:01:50,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.5) internal successors, (143), 2 states have internal predecessors, (143), 2 states have call successors, (79), 2 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 10:01:50,813 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 452 transitions. [2025-01-09 10:01:50,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 10:01:50,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:50,825 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:50,836 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 10:01:51,026 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 10:01:51,026 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:51,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:51,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1197726826, now seen corresponding path program 1 times [2025-01-09 10:01:51,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:51,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814701372] [2025-01-09 10:01:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:51,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:51,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 10:01:51,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 10:01:51,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:51,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:01:51,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:51,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814701372] [2025-01-09 10:01:51,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814701372] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:51,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:51,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:01:51,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294295444] [2025-01-09 10:01:51,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:51,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:01:51,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:51,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:01:51,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:51,645 INFO L87 Difference]: Start difference. First operand 264 states and 452 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:51,758 INFO L93 Difference]: Finished difference Result 784 states and 1346 transitions. [2025-01-09 10:01:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:01:51,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-01-09 10:01:51,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:51,768 INFO L225 Difference]: With dead ends: 784 [2025-01-09 10:01:51,771 INFO L226 Difference]: Without dead ends: 523 [2025-01-09 10:01:51,773 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 10:01:51,774 INFO L435 NwaCegarLoop]: 724 mSDtfsCounter, 426 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:51,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1166 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-01-09 10:01:51,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2025-01-09 10:01:51,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 360 states have (on average 1.6055555555555556) internal successors, (578), 360 states have internal predecessors, (578), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:01:51,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 894 transitions. [2025-01-09 10:01:51,905 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 894 transitions. Word has length 533 [2025-01-09 10:01:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:51,907 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 894 transitions. [2025-01-09 10:01:51,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 894 transitions. [2025-01-09 10:01:51,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 10:01:51,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:51,921 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:51,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:01:51,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:51,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:51,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1068654360, now seen corresponding path program 1 times [2025-01-09 10:01:51,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:51,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086438593] [2025-01-09 10:01:51,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:51,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 10:01:52,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 10:01:52,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:52,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:52,472 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:01:52,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:52,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086438593] [2025-01-09 10:01:52,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086438593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:52,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:52,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:01:52,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946422087] [2025-01-09 10:01:52,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:52,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:01:52,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:52,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:01:52,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:01:52,477 INFO L87 Difference]: Start difference. First operand 521 states and 894 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:52,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:52,604 INFO L93 Difference]: Finished difference Result 1486 states and 2538 transitions. [2025-01-09 10:01:52,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:01:52,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-01-09 10:01:52,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:52,618 INFO L225 Difference]: With dead ends: 1486 [2025-01-09 10:01:52,619 INFO L226 Difference]: Without dead ends: 968 [2025-01-09 10:01:52,622 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 10:01:52,623 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 349 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:52,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 881 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:01:52,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2025-01-09 10:01:52,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 660. [2025-01-09 10:01:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 499 states have (on average 1.655310621242485) internal successors, (826), 499 states have internal predecessors, (826), 158 states have call successors, (158), 2 states have call predecessors, (158), 2 states have return successors, (158), 158 states have call predecessors, (158), 158 states have call successors, (158) [2025-01-09 10:01:52,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1142 transitions. [2025-01-09 10:01:52,734 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1142 transitions. Word has length 533 [2025-01-09 10:01:52,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:52,737 INFO L471 AbstractCegarLoop]: Abstraction has 660 states and 1142 transitions. [2025-01-09 10:01:52,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1142 transitions. [2025-01-09 10:01:52,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-09 10:01:52,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:52,745 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:52,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 10:01:52,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:52,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:52,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1966047638, now seen corresponding path program 1 times [2025-01-09 10:01:52,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:52,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032294485] [2025-01-09 10:01:52,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:52,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:52,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-09 10:01:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-09 10:01:52,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:52,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:53,314 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:01:53,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:53,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032294485] [2025-01-09 10:01:53,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032294485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:53,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:53,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:01:53,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155183952] [2025-01-09 10:01:53,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:53,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:01:53,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:53,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:01:53,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:01:53,318 INFO L87 Difference]: Start difference. First operand 660 states and 1142 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:53,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:53,558 INFO L93 Difference]: Finished difference Result 1974 states and 3420 transitions. [2025-01-09 10:01:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:01:53,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 533 [2025-01-09 10:01:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:53,572 INFO L225 Difference]: With dead ends: 1974 [2025-01-09 10:01:53,573 INFO L226 Difference]: Without dead ends: 1317 [2025-01-09 10:01:53,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:01:53,576 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 483 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:53,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 878 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 10:01:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2025-01-09 10:01:53,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1315. [2025-01-09 10:01:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 994 states have (on average 1.6539235412474849) internal successors, (1644), 994 states have internal predecessors, (1644), 316 states have call successors, (316), 4 states have call predecessors, (316), 4 states have return successors, (316), 316 states have call predecessors, (316), 316 states have call successors, (316) [2025-01-09 10:01:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 2276 transitions. [2025-01-09 10:01:53,717 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 2276 transitions. Word has length 533 [2025-01-09 10:01:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:53,718 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 2276 transitions. [2025-01-09 10:01:53,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 2276 transitions. [2025-01-09 10:01:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:01:53,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:53,724 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:53,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 10:01:53,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:53,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1335600886, now seen corresponding path program 1 times [2025-01-09 10:01:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620960835] [2025-01-09 10:01:53,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:53,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:53,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:01:53,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:01:53,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:53,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:01:54,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:54,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620960835] [2025-01-09 10:01:54,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620960835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:54,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:54,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:01:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176343253] [2025-01-09 10:01:54,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:54,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:01:54,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:54,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:01:54,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:01:54,511 INFO L87 Difference]: Start difference. First operand 1315 states and 2276 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:55,076 INFO L93 Difference]: Finished difference Result 3460 states and 6018 transitions. [2025-01-09 10:01:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:01:55,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 10:01:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:55,090 INFO L225 Difference]: With dead ends: 3460 [2025-01-09 10:01:55,090 INFO L226 Difference]: Without dead ends: 2148 [2025-01-09 10:01:55,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 10:01:55,096 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 432 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:55,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 1611 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:01:55,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2025-01-09 10:01:55,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 2086. [2025-01-09 10:01:55,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 1685 states have (on average 1.6985163204747775) internal successors, (2862), 1685 states have internal predecessors, (2862), 395 states have call successors, (395), 5 states have call predecessors, (395), 5 states have return successors, (395), 395 states have call predecessors, (395), 395 states have call successors, (395) [2025-01-09 10:01:55,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 3652 transitions. [2025-01-09 10:01:55,275 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 3652 transitions. Word has length 534 [2025-01-09 10:01:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:55,276 INFO L471 AbstractCegarLoop]: Abstraction has 2086 states and 3652 transitions. [2025-01-09 10:01:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:01:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 3652 transitions. [2025-01-09 10:01:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:01:55,282 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:55,282 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 10:01:55,283 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:55,283 INFO L85 PathProgramCache]: Analyzing trace with hash 748794872, now seen corresponding path program 1 times [2025-01-09 10:01:55,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:55,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314011732] [2025-01-09 10:01:55,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:55,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:55,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:01:55,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:01:55,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:55,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:56,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:01:56,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:56,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314011732] [2025-01-09 10:01:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314011732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:56,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:56,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 10:01:56,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351983337] [2025-01-09 10:01:56,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:56,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 10:01:56,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:56,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 10:01:56,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:01:56,043 INFO L87 Difference]: Start difference. First operand 2086 states and 3652 transitions. Second operand has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 10:01:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:01:57,617 INFO L93 Difference]: Finished difference Result 6653 states and 11606 transitions. [2025-01-09 10:01:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:01:57,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 534 [2025-01-09 10:01:57,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:01:57,658 INFO L225 Difference]: With dead ends: 6653 [2025-01-09 10:01:57,658 INFO L226 Difference]: Without dead ends: 5197 [2025-01-09 10:01:57,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:01:57,668 INFO L435 NwaCegarLoop]: 636 mSDtfsCounter, 1243 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 10:01:57,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 1197 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 10:01:57,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5197 states. [2025-01-09 10:01:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5197 to 5189. [2025-01-09 10:01:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 4312 states have (on average 1.698747680890538) internal successors, (7325), 4316 states have internal predecessors, (7325), 863 states have call successors, (863), 13 states have call predecessors, (863), 13 states have return successors, (863), 859 states have call predecessors, (863), 863 states have call successors, (863) [2025-01-09 10:01:58,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 9051 transitions. [2025-01-09 10:01:58,100 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 9051 transitions. Word has length 534 [2025-01-09 10:01:58,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:01:58,101 INFO L471 AbstractCegarLoop]: Abstraction has 5189 states and 9051 transitions. [2025-01-09 10:01:58,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.666666666666668) internal successors, (142), 6 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 10:01:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 9051 transitions. [2025-01-09 10:01:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:01:58,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:01:58,111 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:58,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:01:58,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:01:58,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:01:58,112 INFO L85 PathProgramCache]: Analyzing trace with hash 2134998266, now seen corresponding path program 1 times [2025-01-09 10:01:58,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:01:58,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051702560] [2025-01-09 10:01:58,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:01:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:01:58,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:01:58,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:01:58,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:01:58,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:01:59,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:01:59,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:01:59,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051702560] [2025-01-09 10:01:59,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051702560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:01:59,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:01:59,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 10:01:59,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724596430] [2025-01-09 10:01:59,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:01:59,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:01:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:01:59,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:01:59,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:01:59,893 INFO L87 Difference]: Start difference. First operand 5189 states and 9051 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-01-09 10:02:01,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:01,988 INFO L93 Difference]: Finished difference Result 21974 states and 38227 transitions. [2025-01-09 10:02:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 10:02:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) Word has length 534 [2025-01-09 10:02:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:02,110 INFO L225 Difference]: With dead ends: 21974 [2025-01-09 10:02:02,111 INFO L226 Difference]: Without dead ends: 18016 [2025-01-09 10:02:02,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:02:02,135 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 1470 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 2322 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:02,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 2322 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 10:02:02,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18016 states. [2025-01-09 10:02:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18016 to 15642. [2025-01-09 10:02:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15642 states, 13485 states have (on average 1.7166481275491288) internal successors, (23149), 13505 states have internal predecessors, (23149), 2119 states have call successors, (2119), 37 states have call predecessors, (2119), 37 states have return successors, (2119), 2099 states have call predecessors, (2119), 2119 states have call successors, (2119) [2025-01-09 10:02:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15642 states to 15642 states and 27387 transitions. [2025-01-09 10:02:03,215 INFO L78 Accepts]: Start accepts. Automaton has 15642 states and 27387 transitions. Word has length 534 [2025-01-09 10:02:03,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:03,217 INFO L471 AbstractCegarLoop]: Abstraction has 15642 states and 27387 transitions. [2025-01-09 10:02:03,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 3 states have call predecessors, (79), 3 states have call successors, (79) [2025-01-09 10:02:03,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15642 states and 27387 transitions. [2025-01-09 10:02:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:02:03,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:03,236 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:03,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 10:02:03,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:03,237 INFO L85 PathProgramCache]: Analyzing trace with hash -198394372, now seen corresponding path program 1 times [2025-01-09 10:02:03,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:03,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129826095] [2025-01-09 10:02:03,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:03,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:03,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:02:03,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:02:03,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:03,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:02:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129826095] [2025-01-09 10:02:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129826095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:04,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 10:02:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810685230] [2025-01-09 10:02:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 10:02:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:04,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 10:02:04,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:02:04,263 INFO L87 Difference]: Start difference. First operand 15642 states and 27387 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:05,851 INFO L93 Difference]: Finished difference Result 44143 states and 75898 transitions. [2025-01-09 10:02:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:02:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 10:02:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:06,017 INFO L225 Difference]: With dead ends: 44143 [2025-01-09 10:02:06,017 INFO L226 Difference]: Without dead ends: 30925 [2025-01-09 10:02:06,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 10:02:06,078 INFO L435 NwaCegarLoop]: 774 mSDtfsCounter, 851 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 1468 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:06,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 1468 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:02:06,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30925 states. [2025-01-09 10:02:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30925 to 19177. [2025-01-09 10:02:07,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19177 states, 17020 states have (on average 1.7073443008225617) internal successors, (29059), 17040 states have internal predecessors, (29059), 2119 states have call successors, (2119), 37 states have call predecessors, (2119), 37 states have return successors, (2119), 2099 states have call predecessors, (2119), 2119 states have call successors, (2119) [2025-01-09 10:02:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19177 states to 19177 states and 33297 transitions. [2025-01-09 10:02:07,698 INFO L78 Accepts]: Start accepts. Automaton has 19177 states and 33297 transitions. Word has length 534 [2025-01-09 10:02:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:07,699 INFO L471 AbstractCegarLoop]: Abstraction has 19177 states and 33297 transitions. [2025-01-09 10:02:07,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:07,702 INFO L276 IsEmpty]: Start isEmpty. Operand 19177 states and 33297 transitions. [2025-01-09 10:02:07,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:02:07,721 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:07,722 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:07,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 10:02:07,722 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:07,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1769391038, now seen corresponding path program 1 times [2025-01-09 10:02:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182124935] [2025-01-09 10:02:07,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:07,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:07,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:02:07,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:02:07,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:07,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:02:08,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182124935] [2025-01-09 10:02:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182124935] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:08,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:08,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:02:08,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005323581] [2025-01-09 10:02:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:08,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:02:08,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:08,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:02:08,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:02:08,288 INFO L87 Difference]: Start difference. First operand 19177 states and 33297 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:09,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:09,183 INFO L93 Difference]: Finished difference Result 41239 states and 71635 transitions. [2025-01-09 10:02:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:02:09,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 10:02:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:09,289 INFO L225 Difference]: With dead ends: 41239 [2025-01-09 10:02:09,289 INFO L226 Difference]: Without dead ends: 24953 [2025-01-09 10:02:09,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 10:02:09,349 INFO L435 NwaCegarLoop]: 660 mSDtfsCounter, 314 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:09,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1087 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:02:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24953 states. [2025-01-09 10:02:10,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24953 to 24951. [2025-01-09 10:02:10,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24951 states, 21990 states have (on average 1.7110959527057754) internal successors, (37627), 22014 states have internal predecessors, (37627), 2911 states have call successors, (2911), 49 states have call predecessors, (2911), 49 states have return successors, (2911), 2887 states have call predecessors, (2911), 2911 states have call successors, (2911) [2025-01-09 10:02:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24951 states to 24951 states and 43449 transitions. [2025-01-09 10:02:10,911 INFO L78 Accepts]: Start accepts. Automaton has 24951 states and 43449 transitions. Word has length 534 [2025-01-09 10:02:10,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:10,912 INFO L471 AbstractCegarLoop]: Abstraction has 24951 states and 43449 transitions. [2025-01-09 10:02:10,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:10,913 INFO L276 IsEmpty]: Start isEmpty. Operand 24951 states and 43449 transitions. [2025-01-09 10:02:10,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:02:10,934 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:10,934 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:10,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 10:02:10,935 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:10,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1193088070, now seen corresponding path program 1 times [2025-01-09 10:02:10,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:10,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689815656] [2025-01-09 10:02:10,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:10,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:02:11,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:02:11,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:11,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:02:11,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:11,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689815656] [2025-01-09 10:02:11,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689815656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:11,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:11,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:02:11,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761758973] [2025-01-09 10:02:11,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:11,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:02:11,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:11,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:02:11,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:02:11,731 INFO L87 Difference]: Start difference. First operand 24951 states and 43449 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:13,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:13,206 INFO L93 Difference]: Finished difference Result 78467 states and 135960 transitions. [2025-01-09 10:02:13,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 10:02:13,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 10:02:13,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:13,422 INFO L225 Difference]: With dead ends: 78467 [2025-01-09 10:02:13,422 INFO L226 Difference]: Without dead ends: 60093 [2025-01-09 10:02:13,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:02:13,490 INFO L435 NwaCegarLoop]: 498 mSDtfsCounter, 591 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:13,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 2273 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:02:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60093 states. [2025-01-09 10:02:15,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60093 to 45423. [2025-01-09 10:02:15,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45423 states, 41741 states have (on average 1.7227665844134066) internal successors, (71910), 41813 states have internal predecessors, (71910), 3583 states have call successors, (3583), 98 states have call predecessors, (3583), 98 states have return successors, (3583), 3511 states have call predecessors, (3583), 3583 states have call successors, (3583) [2025-01-09 10:02:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45423 states to 45423 states and 79076 transitions. [2025-01-09 10:02:16,052 INFO L78 Accepts]: Start accepts. Automaton has 45423 states and 79076 transitions. Word has length 534 [2025-01-09 10:02:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:16,053 INFO L471 AbstractCegarLoop]: Abstraction has 45423 states and 79076 transitions. [2025-01-09 10:02:16,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 45423 states and 79076 transitions. [2025-01-09 10:02:16,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:02:16,094 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:16,094 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:16,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 10:02:16,095 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:16,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2086574408, now seen corresponding path program 1 times [2025-01-09 10:02:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616770974] [2025-01-09 10:02:16,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:16,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:16,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:02:16,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:02:16,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:16,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:19,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:02:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:19,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616770974] [2025-01-09 10:02:19,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616770974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:19,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:19,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 10:02:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921237557] [2025-01-09 10:02:19,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:19,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 10:02:19,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:19,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 10:02:19,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 10:02:19,494 INFO L87 Difference]: Start difference. First operand 45423 states and 79076 transitions. Second operand has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:26,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:26,002 INFO L93 Difference]: Finished difference Result 119397 states and 206688 transitions. [2025-01-09 10:02:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 10:02:26,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) Word has length 534 [2025-01-09 10:02:26,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:26,255 INFO L225 Difference]: With dead ends: 119397 [2025-01-09 10:02:26,256 INFO L226 Difference]: Without dead ends: 89783 [2025-01-09 10:02:26,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2025-01-09 10:02:26,341 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 1619 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 1940 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 3590 SdHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 1940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:26,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 3590 Invalid, 2443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 1940 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 10:02:26,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89783 states. [2025-01-09 10:02:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89783 to 89729. [2025-01-09 10:02:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89729 states, 83130 states have (on average 1.717538794658968) internal successors, (142779), 83314 states have internal predecessors, (142779), 6347 states have call successors, (6347), 251 states have call predecessors, (6347), 251 states have return successors, (6347), 6163 states have call predecessors, (6347), 6347 states have call successors, (6347) [2025-01-09 10:02:30,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89729 states to 89729 states and 155473 transitions. [2025-01-09 10:02:30,036 INFO L78 Accepts]: Start accepts. Automaton has 89729 states and 155473 transitions. Word has length 534 [2025-01-09 10:02:30,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:30,038 INFO L471 AbstractCegarLoop]: Abstraction has 89729 states and 155473 transitions. [2025-01-09 10:02:30,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 14.2) internal successors, (142), 10 states have internal predecessors, (142), 1 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 1 states have call predecessors, (79), 1 states have call successors, (79) [2025-01-09 10:02:30,038 INFO L276 IsEmpty]: Start isEmpty. Operand 89729 states and 155473 transitions. [2025-01-09 10:02:30,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:02:30,125 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:30,126 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:30,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 10:02:30,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -163346374, now seen corresponding path program 1 times [2025-01-09 10:02:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:30,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570317104] [2025-01-09 10:02:30,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:30,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:02:30,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:02:30,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:30,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12324 trivial. 0 not checked. [2025-01-09 10:02:31,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:31,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570317104] [2025-01-09 10:02:31,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570317104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:02:31,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:02:31,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 10:02:31,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976163784] [2025-01-09 10:02:31,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:02:31,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 10:02:31,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:31,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 10:02:31,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 10:02:31,428 INFO L87 Difference]: Start difference. First operand 89729 states and 155473 transitions. Second operand has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 10:02:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:02:35,502 INFO L93 Difference]: Finished difference Result 210777 states and 363235 transitions. [2025-01-09 10:02:35,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 10:02:35,503 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) Word has length 534 [2025-01-09 10:02:35,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:02:35,926 INFO L225 Difference]: With dead ends: 210777 [2025-01-09 10:02:35,926 INFO L226 Difference]: Without dead ends: 146449 [2025-01-09 10:02:36,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 10:02:36,087 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 333 mSDsluCounter, 1214 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1777 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:02:36,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1777 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:02:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146449 states. [2025-01-09 10:02:41,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146449 to 146447. [2025-01-09 10:02:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146447 states, 134688 states have (on average 1.7054600261344737) internal successors, (229705), 135036 states have internal predecessors, (229705), 11291 states have call successors, (11291), 467 states have call predecessors, (11291), 467 states have return successors, (11291), 10943 states have call predecessors, (11291), 11291 states have call successors, (11291) [2025-01-09 10:02:42,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146447 states to 146447 states and 252287 transitions. [2025-01-09 10:02:42,072 INFO L78 Accepts]: Start accepts. Automaton has 146447 states and 252287 transitions. Word has length 534 [2025-01-09 10:02:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:02:42,073 INFO L471 AbstractCegarLoop]: Abstraction has 146447 states and 252287 transitions. [2025-01-09 10:02:42,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 2 states have call successors, (79), 1 states have call predecessors, (79), 1 states have return successors, (79), 2 states have call predecessors, (79), 2 states have call successors, (79) [2025-01-09 10:02:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 146447 states and 252287 transitions. [2025-01-09 10:02:42,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2025-01-09 10:02:42,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:02:42,166 INFO L218 NwaCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:02:42,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 10:02:42,166 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:02:42,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:02:42,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2125949176, now seen corresponding path program 1 times [2025-01-09 10:02:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:02:42,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143058658] [2025-01-09 10:02:42,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:42,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:02:42,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:02:42,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:02:42,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:42,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 51 proven. 183 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-01-09 10:02:43,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:02:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143058658] [2025-01-09 10:02:43,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143058658] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:02:43,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239918259] [2025-01-09 10:02:43,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:02:43,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:02:43,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:02:43,365 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 10:02:43,392 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 10:02:43,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 534 statements into 1 equivalence classes. [2025-01-09 10:02:43,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 534 of 534 statements. [2025-01-09 10:02:43,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:02:43,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:02:43,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1289 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 10:02:43,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:02:44,592 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 1950 proven. 18 refuted. 0 times theorem prover too weak. 10356 trivial. 0 not checked. [2025-01-09 10:02:44,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:02:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12324 backedges. 216 proven. 18 refuted. 0 times theorem prover too weak. 12090 trivial. 0 not checked. [2025-01-09 10:02:45,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239918259] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:02:45,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:02:45,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 10] total 20 [2025-01-09 10:02:45,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078504549] [2025-01-09 10:02:45,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:02:45,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 10:02:45,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:02:45,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 10:02:45,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2025-01-09 10:02:45,280 INFO L87 Difference]: Start difference. First operand 146447 states and 252287 transitions. Second operand has 20 states, 20 states have (on average 14.95) internal successors, (299), 20 states have internal predecessors, (299), 4 states have call successors, (146), 2 states have call predecessors, (146), 4 states have return successors, (148), 4 states have call predecessors, (148), 4 states have call successors, (148)