./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-18.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-250_file-18.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 44903c27af28474fa8f64f9be68c4119ba3454622360f31f5c3d951f7d2ecb67 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:39:53,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:39:53,288 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:39:53,295 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:39:53,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:39:53,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:39:53,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:39:53,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:39:53,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:39:53,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:39:53,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:39:53,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:39:53,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:39:53,316 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:39:53,316 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:39:53,316 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:53,317 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:53,317 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:39:53,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:39:53,319 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:39:53,319 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:39:53,319 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:39:53,319 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:39:53,319 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 -> 44903c27af28474fa8f64f9be68c4119ba3454622360f31f5c3d951f7d2ecb67 [2025-01-09 09:39:53,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:39:53,553 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:39:53,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:39:53,557 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:39:53,557 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:39:53,559 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-250_file-18.i [2025-01-09 09:39:54,740 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4546a847b/aa33ce9d5944442999386869a0082d9b/FLAGa1318279f [2025-01-09 09:39:55,056 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:39:55,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-18.i [2025-01-09 09:39:55,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4546a847b/aa33ce9d5944442999386869a0082d9b/FLAGa1318279f [2025-01-09 09:39:55,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4546a847b/aa33ce9d5944442999386869a0082d9b [2025-01-09 09:39:55,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:39:55,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:39:55,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:39:55,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:39:55,092 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:39:55,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d25dcd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55, skipping insertion in model container [2025-01-09 09:39:55,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,118 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:39:55,225 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-250_file-18.i[916,929] [2025-01-09 09:39:55,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:39:55,354 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:39:55,361 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-250_file-18.i[916,929] [2025-01-09 09:39:55,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:39:55,444 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:39:55,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55 WrapperNode [2025-01-09 09:39:55,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:39:55,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:39:55,447 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:39:55,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:39:55,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,507 INFO L138 Inliner]: procedures = 26, calls = 95, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 575 [2025-01-09 09:39:55,508 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:39:55,509 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:39:55,509 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:39:55,510 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:39:55,516 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,516 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,526 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,551 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 09:39:55,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,551 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,568 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,573 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,581 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,601 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:39:55,602 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:39:55,603 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:39:55,603 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:39:55,604 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (1/1) ... [2025-01-09 09:39:55,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:39:55,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:55,628 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 09:39:55,631 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 09:39:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:39:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:39:55,647 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:39:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:39:55,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:39:55,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:39:55,743 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:39:55,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:39:56,375 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-09 09:39:56,375 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:39:56,384 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:39:56,384 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:39:56,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:56 BoogieIcfgContainer [2025-01-09 09:39:56,384 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:39:56,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:39:56,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:39:56,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:39:56,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:39:55" (1/3) ... [2025-01-09 09:39:56,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af9d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:56, skipping insertion in model container [2025-01-09 09:39:56,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:39:55" (2/3) ... [2025-01-09 09:39:56,394 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7af9d88d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:39:56, skipping insertion in model container [2025-01-09 09:39:56,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:39:56" (3/3) ... [2025-01-09 09:39:56,395 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-18.i [2025-01-09 09:39:56,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:39:56,413 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-18.i that has 2 procedures, 240 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:39:56,479 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:39:56,490 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;@771ab217, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:39:56,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:39:56,493 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 09:39:56,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:39:56,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:56,515 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:56,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:56,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1435929855, now seen corresponding path program 1 times [2025-01-09 09:39:56,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:56,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088954892] [2025-01-09 09:39:56,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:56,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:56,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:39:56,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:39:56,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:56,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:57,002 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-01-09 09:39:57,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:57,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088954892] [2025-01-09 09:39:57,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088954892] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:39:57,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525259076] [2025-01-09 09:39:57,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:57,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:39:57,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:39:57,007 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 09:39:57,009 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 09:39:57,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:39:57,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:39:57,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:57,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:57,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:39:57,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:39:57,305 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 13122 trivial. 0 not checked. [2025-01-09 09:39:57,306 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:39:57,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525259076] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:57,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:39:57,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:39:57,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72782543] [2025-01-09 09:39:57,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:57,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:39:57,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:57,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:39:57,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:39:57,330 INFO L87 Difference]: Start difference. First operand has 240 states, 155 states have (on average 1.5161290322580645) internal successors, (235), 156 states have internal predecessors, (235), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) Second operand has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:39:57,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:57,375 INFO L93 Difference]: Finished difference Result 474 states and 875 transitions. [2025-01-09 09:39:57,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:39:57,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-01-09 09:39:57,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:57,385 INFO L225 Difference]: With dead ends: 474 [2025-01-09 09:39:57,386 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 09:39:57,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 519 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 09:39:57,394 INFO L435 NwaCegarLoop]: 392 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, 392 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 09:39:57,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:57,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 09:39:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2025-01-09 09:39:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 153 states have (on average 1.4901960784313726) internal successors, (228), 153 states have internal predecessors, (228), 82 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2025-01-09 09:39:57,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 392 transitions. [2025-01-09 09:39:57,460 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 392 transitions. Word has length 518 [2025-01-09 09:39:57,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:57,460 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 392 transitions. [2025-01-09 09:39:57,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 56.5) internal successors, (113), 2 states have internal predecessors, (113), 2 states have call successors, (82), 2 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:39:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 392 transitions. [2025-01-09 09:39:57,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:39:57,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:57,479 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:57,492 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 09:39:57,680 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 09:39:57,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:57,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:57,683 INFO L85 PathProgramCache]: Analyzing trace with hash -2052656447, now seen corresponding path program 1 times [2025-01-09 09:39:57,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:57,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391298954] [2025-01-09 09:39:57,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:57,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:57,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:39:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:39:57,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:57,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:39:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:58,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391298954] [2025-01-09 09:39:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391298954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:58,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:58,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:39:58,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384580579] [2025-01-09 09:39:58,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:58,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:39:58,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:58,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:39:58,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:58,140 INFO L87 Difference]: Start difference. First operand 237 states and 392 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:39:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:58,252 INFO L93 Difference]: Finished difference Result 704 states and 1168 transitions. [2025-01-09 09:39:58,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:39:58,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:39:58,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:58,260 INFO L225 Difference]: With dead ends: 704 [2025-01-09 09:39:58,261 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 09:39:58,262 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 09:39:58,263 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 376 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:58,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 09:39:58,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 468. [2025-01-09 09:39:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 301 states have (on average 1.478405315614618) internal successors, (445), 301 states have internal predecessors, (445), 164 states have call successors, (164), 2 states have call predecessors, (164), 2 states have return successors, (164), 164 states have call predecessors, (164), 164 states have call successors, (164) [2025-01-09 09:39:58,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 773 transitions. [2025-01-09 09:39:58,325 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 773 transitions. Word has length 518 [2025-01-09 09:39:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:58,326 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 773 transitions. [2025-01-09 09:39:58,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:39:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 773 transitions. [2025-01-09 09:39:58,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:39:58,332 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:58,332 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:58,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:39:58,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:58,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:58,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1145452099, now seen corresponding path program 1 times [2025-01-09 09:39:58,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:58,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921438569] [2025-01-09 09:39:58,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:58,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:58,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:39:58,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:39:58,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:58,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:58,695 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:39:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921438569] [2025-01-09 09:39:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921438569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:39:58,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070962688] [2025-01-09 09:39:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:58,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:39:58,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:58,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:39:58,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:58,700 INFO L87 Difference]: Start difference. First operand 468 states and 773 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:39:58,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:58,758 INFO L93 Difference]: Finished difference Result 1181 states and 1954 transitions. [2025-01-09 09:39:58,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:39:58,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:39:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:58,767 INFO L225 Difference]: With dead ends: 1181 [2025-01-09 09:39:58,767 INFO L226 Difference]: Without dead ends: 716 [2025-01-09 09:39:58,770 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 09:39:58,770 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 184 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:58,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 763 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-09 09:39:58,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 712. [2025-01-09 09:39:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 509 states have (on average 1.5343811394891944) internal successors, (781), 511 states have internal predecessors, (781), 198 states have call successors, (198), 4 states have call predecessors, (198), 4 states have return successors, (198), 196 states have call predecessors, (198), 198 states have call successors, (198) [2025-01-09 09:39:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1177 transitions. [2025-01-09 09:39:58,852 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1177 transitions. Word has length 518 [2025-01-09 09:39:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:58,855 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1177 transitions. [2025-01-09 09:39:58,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:39:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1177 transitions. [2025-01-09 09:39:58,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:39:58,862 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:58,863 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:58,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:39:58,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:58,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:58,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1083412485, now seen corresponding path program 1 times [2025-01-09 09:39:58,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:58,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888424366] [2025-01-09 09:39:58,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:58,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:58,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:39:58,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:39:58,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:58,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:39:59,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:59,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888424366] [2025-01-09 09:39:59,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888424366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:59,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:59,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:39:59,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984240952] [2025-01-09 09:39:59,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:39:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:59,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:39:59,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:39:59,218 INFO L87 Difference]: Start difference. First operand 712 states and 1177 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:39:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:39:59,295 INFO L93 Difference]: Finished difference Result 1919 states and 3176 transitions. [2025-01-09 09:39:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:39:59,296 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:39:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:39:59,303 INFO L225 Difference]: With dead ends: 1919 [2025-01-09 09:39:59,303 INFO L226 Difference]: Without dead ends: 1210 [2025-01-09 09:39:59,306 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 09:39:59,306 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 222 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:39:59,306 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 882 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:39:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2025-01-09 09:39:59,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 1206. [2025-01-09 09:39:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1206 states, 915 states have (on average 1.5595628415300546) internal successors, (1427), 921 states have internal predecessors, (1427), 282 states have call successors, (282), 8 states have call predecessors, (282), 8 states have return successors, (282), 276 states have call predecessors, (282), 282 states have call successors, (282) [2025-01-09 09:39:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1206 states to 1206 states and 1991 transitions. [2025-01-09 09:39:59,395 INFO L78 Accepts]: Start accepts. Automaton has 1206 states and 1991 transitions. Word has length 518 [2025-01-09 09:39:59,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:39:59,396 INFO L471 AbstractCegarLoop]: Abstraction has 1206 states and 1991 transitions. [2025-01-09 09:39:59,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:39:59,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1206 states and 1991 transitions. [2025-01-09 09:39:59,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:39:59,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:39:59,411 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:39:59,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:39:59,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:39:59,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:39:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash 454927545, now seen corresponding path program 1 times [2025-01-09 09:39:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:39:59,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954355618] [2025-01-09 09:39:59,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:39:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:39:59,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:39:59,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:39:59,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:39:59,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:39:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:39:59,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:39:59,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954355618] [2025-01-09 09:39:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954355618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:39:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:39:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:39:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404495485] [2025-01-09 09:39:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:39:59,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:39:59,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:39:59,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:39:59,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:39:59,755 INFO L87 Difference]: Start difference. First operand 1206 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:00,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:00,468 INFO L93 Difference]: Finished difference Result 4137 states and 6785 transitions. [2025-01-09 09:40:00,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:00,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:40:00,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:00,488 INFO L225 Difference]: With dead ends: 4137 [2025-01-09 09:40:00,488 INFO L226 Difference]: Without dead ends: 2934 [2025-01-09 09:40:00,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:00,493 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 514 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:00,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 1100 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:40:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2025-01-09 09:40:00,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2294. [2025-01-09 09:40:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2294 states, 1759 states have (on average 1.5616827743035815) internal successors, (2747), 1773 states have internal predecessors, (2747), 518 states have call successors, (518), 16 states have call predecessors, (518), 16 states have return successors, (518), 504 states have call predecessors, (518), 518 states have call successors, (518) [2025-01-09 09:40:00,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2294 states to 2294 states and 3783 transitions. [2025-01-09 09:40:00,670 INFO L78 Accepts]: Start accepts. Automaton has 2294 states and 3783 transitions. Word has length 518 [2025-01-09 09:40:00,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:00,672 INFO L471 AbstractCegarLoop]: Abstraction has 2294 states and 3783 transitions. [2025-01-09 09:40:00,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2294 states and 3783 transitions. [2025-01-09 09:40:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:00,679 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:00,679 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:00,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:40:00,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:00,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:00,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1133420357, now seen corresponding path program 1 times [2025-01-09 09:40:00,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:00,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195707502] [2025-01-09 09:40:00,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:00,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:00,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:00,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:00,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:00,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:00,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195707502] [2025-01-09 09:40:00,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195707502] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:00,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:00,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:00,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292807097] [2025-01-09 09:40:00,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:00,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:00,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:00,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:00,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:00,928 INFO L87 Difference]: Start difference. First operand 2294 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:01,084 INFO L93 Difference]: Finished difference Result 5665 states and 9316 transitions. [2025-01-09 09:40:01,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:01,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:40:01,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:01,109 INFO L225 Difference]: With dead ends: 5665 [2025-01-09 09:40:01,109 INFO L226 Difference]: Without dead ends: 3374 [2025-01-09 09:40:01,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:40:01,117 INFO L435 NwaCegarLoop]: 684 mSDtfsCounter, 386 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:01,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 1071 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:01,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3374 states. [2025-01-09 09:40:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3374 to 2179. [2025-01-09 09:40:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2179 states, 1582 states have (on average 1.5183312262958282) internal successors, (2402), 1597 states have internal predecessors, (2402), 577 states have call successors, (577), 19 states have call predecessors, (577), 19 states have return successors, (577), 562 states have call predecessors, (577), 577 states have call successors, (577) [2025-01-09 09:40:01,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2179 states to 2179 states and 3556 transitions. [2025-01-09 09:40:01,331 INFO L78 Accepts]: Start accepts. Automaton has 2179 states and 3556 transitions. Word has length 518 [2025-01-09 09:40:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:01,332 INFO L471 AbstractCegarLoop]: Abstraction has 2179 states and 3556 transitions. [2025-01-09 09:40:01,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:01,333 INFO L276 IsEmpty]: Start isEmpty. Operand 2179 states and 3556 transitions. [2025-01-09 09:40:01,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:01,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:01,337 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:01,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:40:01,337 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:01,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1156527419, now seen corresponding path program 1 times [2025-01-09 09:40:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086253500] [2025-01-09 09:40:01,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:01,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:01,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:01,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:01,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:01,720 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086253500] [2025-01-09 09:40:01,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086253500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:01,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:01,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:40:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005432757] [2025-01-09 09:40:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:01,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:40:01,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:40:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:40:01,723 INFO L87 Difference]: Start difference. First operand 2179 states and 3556 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:03,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:03,581 INFO L93 Difference]: Finished difference Result 10967 states and 17731 transitions. [2025-01-09 09:40:03,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:40:03,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-01-09 09:40:03,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:03,625 INFO L225 Difference]: With dead ends: 10967 [2025-01-09 09:40:03,626 INFO L226 Difference]: Without dead ends: 8900 [2025-01-09 09:40:03,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:40:03,635 INFO L435 NwaCegarLoop]: 389 mSDtfsCounter, 1173 mSDsluCounter, 2102 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 2491 SdHoareTripleChecker+Invalid, 1045 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:03,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 2491 Invalid, 1045 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 09:40:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8900 states. [2025-01-09 09:40:04,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8900 to 4990. [2025-01-09 09:40:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4990 states, 3683 states have (on average 1.5329894108064077) internal successors, (5646), 3716 states have internal predecessors, (5646), 1263 states have call successors, (1263), 43 states have call predecessors, (1263), 43 states have return successors, (1263), 1230 states have call predecessors, (1263), 1263 states have call successors, (1263) [2025-01-09 09:40:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4990 states to 4990 states and 8172 transitions. [2025-01-09 09:40:04,048 INFO L78 Accepts]: Start accepts. Automaton has 4990 states and 8172 transitions. Word has length 518 [2025-01-09 09:40:04,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:04,049 INFO L471 AbstractCegarLoop]: Abstraction has 4990 states and 8172 transitions. [2025-01-09 09:40:04,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:04,049 INFO L276 IsEmpty]: Start isEmpty. Operand 4990 states and 8172 transitions. [2025-01-09 09:40:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:04,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:04,055 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:04,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:40:04,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:04,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash -431820483, now seen corresponding path program 1 times [2025-01-09 09:40:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449394821] [2025-01-09 09:40:04,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:04,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:04,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:04,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:04,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:04,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:04,450 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:04,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:04,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449394821] [2025-01-09 09:40:04,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449394821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:04,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:04,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:04,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389555373] [2025-01-09 09:40:04,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:04,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:04,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:04,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:04,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:04,454 INFO L87 Difference]: Start difference. First operand 4990 states and 8172 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:04,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:04,892 INFO L93 Difference]: Finished difference Result 14746 states and 24180 transitions. [2025-01-09 09:40:04,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:04,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:40:04,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:04,942 INFO L225 Difference]: With dead ends: 14746 [2025-01-09 09:40:04,942 INFO L226 Difference]: Without dead ends: 9868 [2025-01-09 09:40:04,952 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 09:40:04,952 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 247 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:04,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1198 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:04,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9868 states. [2025-01-09 09:40:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9868 to 9866. [2025-01-09 09:40:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9866 states, 7315 states have (on average 1.5312371838687628) internal successors, (11201), 7380 states have internal predecessors, (11201), 2467 states have call successors, (2467), 83 states have call predecessors, (2467), 83 states have return successors, (2467), 2402 states have call predecessors, (2467), 2467 states have call successors, (2467) [2025-01-09 09:40:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9866 states to 9866 states and 16135 transitions. [2025-01-09 09:40:05,594 INFO L78 Accepts]: Start accepts. Automaton has 9866 states and 16135 transitions. Word has length 518 [2025-01-09 09:40:05,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:05,594 INFO L471 AbstractCegarLoop]: Abstraction has 9866 states and 16135 transitions. [2025-01-09 09:40:05,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:05,595 INFO L276 IsEmpty]: Start isEmpty. Operand 9866 states and 16135 transitions. [2025-01-09 09:40:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:05,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:05,606 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:05,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:40:05,606 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:05,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash -858660743, now seen corresponding path program 1 times [2025-01-09 09:40:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041910634] [2025-01-09 09:40:05,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:05,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:05,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:05,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:05,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:06,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041910634] [2025-01-09 09:40:06,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041910634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:06,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:40:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779832954] [2025-01-09 09:40:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:06,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:40:06,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:06,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:40:06,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:40:06,142 INFO L87 Difference]: Start difference. First operand 9866 states and 16135 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:07,776 INFO L93 Difference]: Finished difference Result 27578 states and 45043 transitions. [2025-01-09 09:40:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:40:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-01-09 09:40:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:07,845 INFO L225 Difference]: With dead ends: 27578 [2025-01-09 09:40:07,845 INFO L226 Difference]: Without dead ends: 17824 [2025-01-09 09:40:07,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:40:07,880 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1411 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1411 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:07,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1411 Valid, 2103 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 09:40:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17824 states. [2025-01-09 09:40:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17824 to 16810. [2025-01-09 09:40:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16810 states, 12591 states have (on average 1.5316495909776824) internal successors, (19285), 12720 states have internal predecessors, (19285), 4067 states have call successors, (4067), 151 states have call predecessors, (4067), 151 states have return successors, (4067), 3938 states have call predecessors, (4067), 4067 states have call successors, (4067) [2025-01-09 09:40:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16810 states to 16810 states and 27419 transitions. [2025-01-09 09:40:09,040 INFO L78 Accepts]: Start accepts. Automaton has 16810 states and 27419 transitions. Word has length 518 [2025-01-09 09:40:09,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:09,041 INFO L471 AbstractCegarLoop]: Abstraction has 16810 states and 27419 transitions. [2025-01-09 09:40:09,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 16810 states and 27419 transitions. [2025-01-09 09:40:09,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:09,054 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:09,054 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:09,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:40:09,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:09,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash 248606901, now seen corresponding path program 1 times [2025-01-09 09:40:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102572046] [2025-01-09 09:40:09,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:09,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:09,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:09,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:09,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:09,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:09,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:09,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102572046] [2025-01-09 09:40:09,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102572046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:09,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:09,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:09,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210344982] [2025-01-09 09:40:09,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:09,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:09,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:09,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:09,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:09,208 INFO L87 Difference]: Start difference. First operand 16810 states and 27419 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:09,826 INFO L93 Difference]: Finished difference Result 30674 states and 49801 transitions. [2025-01-09 09:40:09,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:09,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:40:09,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:09,895 INFO L225 Difference]: With dead ends: 30674 [2025-01-09 09:40:09,895 INFO L226 Difference]: Without dead ends: 13976 [2025-01-09 09:40:09,938 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 09:40:09,938 INFO L435 NwaCegarLoop]: 488 mSDtfsCounter, 203 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:09,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 866 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13976 states. [2025-01-09 09:40:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13976 to 11542. [2025-01-09 09:40:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11542 states, 8411 states have (on average 1.5012483652360005) internal successors, (12627), 8476 states have internal predecessors, (12627), 2979 states have call successors, (2979), 151 states have call predecessors, (2979), 151 states have return successors, (2979), 2914 states have call predecessors, (2979), 2979 states have call successors, (2979) [2025-01-09 09:40:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11542 states to 11542 states and 18585 transitions. [2025-01-09 09:40:10,674 INFO L78 Accepts]: Start accepts. Automaton has 11542 states and 18585 transitions. Word has length 518 [2025-01-09 09:40:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:10,675 INFO L471 AbstractCegarLoop]: Abstraction has 11542 states and 18585 transitions. [2025-01-09 09:40:10,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11542 states and 18585 transitions. [2025-01-09 09:40:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:10,682 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:10,682 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:10,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:40:10,682 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:10,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:10,683 INFO L85 PathProgramCache]: Analyzing trace with hash -166521095, now seen corresponding path program 1 times [2025-01-09 09:40:10,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:10,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130981013] [2025-01-09 09:40:10,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:10,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:10,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:10,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:10,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:10,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:10,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:10,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130981013] [2025-01-09 09:40:10,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130981013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:10,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:10,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198998150] [2025-01-09 09:40:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:10,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:10,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:10,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:10,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:10,875 INFO L87 Difference]: Start difference. First operand 11542 states and 18585 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:11,888 INFO L93 Difference]: Finished difference Result 32026 states and 51537 transitions. [2025-01-09 09:40:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 518 [2025-01-09 09:40:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:11,962 INFO L225 Difference]: With dead ends: 32026 [2025-01-09 09:40:11,962 INFO L226 Difference]: Without dead ends: 20596 [2025-01-09 09:40:11,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:11,984 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 237 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:11,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1050 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:40:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20596 states. [2025-01-09 09:40:13,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20596 to 20594. [2025-01-09 09:40:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20594 states, 14751 states have (on average 1.4887804216663276) internal successors, (21961), 14872 states have internal predecessors, (21961), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-01-09 09:40:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20594 states to 20594 states and 33087 transitions. [2025-01-09 09:40:13,678 INFO L78 Accepts]: Start accepts. Automaton has 20594 states and 33087 transitions. Word has length 518 [2025-01-09 09:40:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:13,679 INFO L471 AbstractCegarLoop]: Abstraction has 20594 states and 33087 transitions. [2025-01-09 09:40:13,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:13,680 INFO L276 IsEmpty]: Start isEmpty. Operand 20594 states and 33087 transitions. [2025-01-09 09:40:13,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:13,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:13,689 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:13,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 09:40:13,690 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:13,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -560887881, now seen corresponding path program 1 times [2025-01-09 09:40:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:13,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155242821] [2025-01-09 09:40:13,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:13,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:13,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:13,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:13,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155242821] [2025-01-09 09:40:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155242821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:13,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101582517] [2025-01-09 09:40:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:13,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:13,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:13,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:13,918 INFO L87 Difference]: Start difference. First operand 20594 states and 33087 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:15,929 INFO L93 Difference]: Finished difference Result 52954 states and 84689 transitions. [2025-01-09 09:40:15,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:40:15,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-01-09 09:40:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:16,049 INFO L225 Difference]: With dead ends: 52954 [2025-01-09 09:40:16,049 INFO L226 Difference]: Without dead ends: 32472 [2025-01-09 09:40:16,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 09:40:16,094 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 714 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:16,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 2086 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:40:16,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32472 states. [2025-01-09 09:40:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32472 to 21650. [2025-01-09 09:40:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21650 states, 15807 states have (on average 1.48649332574176) internal successors, (23497), 15928 states have internal predecessors, (23497), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-01-09 09:40:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21650 states to 21650 states and 34623 transitions. [2025-01-09 09:40:17,383 INFO L78 Accepts]: Start accepts. Automaton has 21650 states and 34623 transitions. Word has length 518 [2025-01-09 09:40:17,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:17,384 INFO L471 AbstractCegarLoop]: Abstraction has 21650 states and 34623 transitions. [2025-01-09 09:40:17,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:17,384 INFO L276 IsEmpty]: Start isEmpty. Operand 21650 states and 34623 transitions. [2025-01-09 09:40:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2025-01-09 09:40:17,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:17,391 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:17,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 09:40:17,392 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:17,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:17,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2145731513, now seen corresponding path program 1 times [2025-01-09 09:40:17,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:17,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323679690] [2025-01-09 09:40:17,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:17,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:17,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 518 statements into 1 equivalence classes. [2025-01-09 09:40:17,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 518 of 518 statements. [2025-01-09 09:40:17,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:17,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:17,732 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:17,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:17,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323679690] [2025-01-09 09:40:17,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323679690] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:17,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:17,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:17,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026277722] [2025-01-09 09:40:17,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:17,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:17,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:17,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:17,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:17,735 INFO L87 Difference]: Start difference. First operand 21650 states and 34623 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:20,843 INFO L93 Difference]: Finished difference Result 52778 states and 84075 transitions. [2025-01-09 09:40:20,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 09:40:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 518 [2025-01-09 09:40:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:20,974 INFO L225 Difference]: With dead ends: 52778 [2025-01-09 09:40:20,974 INFO L226 Difference]: Without dead ends: 31240 [2025-01-09 09:40:21,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:40:21,038 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 1070 mSDsluCounter, 1379 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:21,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 2022 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:40:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31240 states. [2025-01-09 09:40:22,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31240 to 21074. [2025-01-09 09:40:22,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21074 states, 15231 states have (on average 1.4812553345151336) internal successors, (22561), 15352 states have internal predecessors, (22561), 5563 states have call successors, (5563), 279 states have call predecessors, (5563), 279 states have return successors, (5563), 5442 states have call predecessors, (5563), 5563 states have call successors, (5563) [2025-01-09 09:40:22,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21074 states to 21074 states and 33687 transitions. [2025-01-09 09:40:22,582 INFO L78 Accepts]: Start accepts. Automaton has 21074 states and 33687 transitions. Word has length 518 [2025-01-09 09:40:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:22,582 INFO L471 AbstractCegarLoop]: Abstraction has 21074 states and 33687 transitions. [2025-01-09 09:40:22,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 21074 states and 33687 transitions. [2025-01-09 09:40:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 09:40:22,590 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:22,590 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:22,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 09:40:22,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:22,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1570702875, now seen corresponding path program 1 times [2025-01-09 09:40:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912066331] [2025-01-09 09:40:22,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:22,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 09:40:22,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 09:40:22,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:22,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:22,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:22,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912066331] [2025-01-09 09:40:22,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912066331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:22,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:22,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:40:22,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33766106] [2025-01-09 09:40:22,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:22,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:40:22,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:22,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:40:22,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:22,896 INFO L87 Difference]: Start difference. First operand 21074 states and 33687 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:26,028 INFO L93 Difference]: Finished difference Result 58830 states and 93695 transitions. [2025-01-09 09:40:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:40:26,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-01-09 09:40:26,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:26,166 INFO L225 Difference]: With dead ends: 58830 [2025-01-09 09:40:26,166 INFO L226 Difference]: Without dead ends: 47400 [2025-01-09 09:40:26,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:40:26,198 INFO L435 NwaCegarLoop]: 381 mSDtfsCounter, 934 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:26,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1197 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 09:40:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47400 states. [2025-01-09 09:40:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47400 to 25050. [2025-01-09 09:40:28,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25050 states, 18495 states have (on average 1.4997026223303596) internal successors, (27737), 18632 states have internal predecessors, (27737), 6235 states have call successors, (6235), 319 states have call predecessors, (6235), 319 states have return successors, (6235), 6098 states have call predecessors, (6235), 6235 states have call successors, (6235) [2025-01-09 09:40:28,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25050 states to 25050 states and 40207 transitions. [2025-01-09 09:40:28,119 INFO L78 Accepts]: Start accepts. Automaton has 25050 states and 40207 transitions. Word has length 519 [2025-01-09 09:40:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:28,119 INFO L471 AbstractCegarLoop]: Abstraction has 25050 states and 40207 transitions. [2025-01-09 09:40:28,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 25050 states and 40207 transitions. [2025-01-09 09:40:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 09:40:28,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:28,129 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:28,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 09:40:28,130 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:28,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:28,130 INFO L85 PathProgramCache]: Analyzing trace with hash -17645027, now seen corresponding path program 1 times [2025-01-09 09:40:28,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:28,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863212639] [2025-01-09 09:40:28,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:28,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:28,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 09:40:28,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 09:40:28,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:28,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:28,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:28,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863212639] [2025-01-09 09:40:28,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863212639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:28,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:28,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:40:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248825643] [2025-01-09 09:40:28,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:28,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:40:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:28,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:40:28,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:40:28,560 INFO L87 Difference]: Start difference. First operand 25050 states and 40207 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:31,530 INFO L93 Difference]: Finished difference Result 53388 states and 85740 transitions. [2025-01-09 09:40:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:40:31,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-01-09 09:40:31,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:31,674 INFO L225 Difference]: With dead ends: 53388 [2025-01-09 09:40:31,675 INFO L226 Difference]: Without dead ends: 39662 [2025-01-09 09:40:31,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:40:31,724 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 546 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:31,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 1579 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:40:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39662 states. [2025-01-09 09:40:33,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39662 to 33342. [2025-01-09 09:40:33,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33342 states, 24075 states have (on average 1.4853167185877467) internal successors, (35759), 24268 states have internal predecessors, (35759), 8819 states have call successors, (8819), 447 states have call predecessors, (8819), 447 states have return successors, (8819), 8626 states have call predecessors, (8819), 8819 states have call successors, (8819) [2025-01-09 09:40:34,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33342 states to 33342 states and 53397 transitions. [2025-01-09 09:40:34,226 INFO L78 Accepts]: Start accepts. Automaton has 33342 states and 53397 transitions. Word has length 519 [2025-01-09 09:40:34,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:34,226 INFO L471 AbstractCegarLoop]: Abstraction has 33342 states and 53397 transitions. [2025-01-09 09:40:34,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:34,226 INFO L276 IsEmpty]: Start isEmpty. Operand 33342 states and 53397 transitions. [2025-01-09 09:40:34,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 09:40:34,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:34,233 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:34,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 09:40:34,233 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:34,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:34,233 INFO L85 PathProgramCache]: Analyzing trace with hash 421324149, now seen corresponding path program 1 times [2025-01-09 09:40:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:34,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98084537] [2025-01-09 09:40:34,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:34,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:34,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 09:40:34,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 09:40:34,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:34,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:34,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:34,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98084537] [2025-01-09 09:40:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98084537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:34,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:34,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:40:34,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189399117] [2025-01-09 09:40:34,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:34,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:40:34,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:34,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:40:34,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:40:34,568 INFO L87 Difference]: Start difference. First operand 33342 states and 53397 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:37,427 INFO L93 Difference]: Finished difference Result 83350 states and 133337 transitions. [2025-01-09 09:40:37,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:40:37,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) Word has length 519 [2025-01-09 09:40:37,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:37,578 INFO L225 Difference]: With dead ends: 83350 [2025-01-09 09:40:37,578 INFO L226 Difference]: Without dead ends: 50120 [2025-01-09 09:40:37,632 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 09:40:37,632 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 235 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:37,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 767 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:40:37,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50120 states. [2025-01-09 09:40:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50120 to 50118. [2025-01-09 09:40:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50118 states, 36249 states have (on average 1.4801235896162652) internal successors, (53653), 36538 states have internal predecessors, (53653), 13199 states have call successors, (13199), 669 states have call predecessors, (13199), 669 states have return successors, (13199), 12910 states have call predecessors, (13199), 13199 states have call successors, (13199) [2025-01-09 09:40:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50118 states to 50118 states and 80051 transitions. [2025-01-09 09:40:41,608 INFO L78 Accepts]: Start accepts. Automaton has 50118 states and 80051 transitions. Word has length 519 [2025-01-09 09:40:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:40:41,609 INFO L471 AbstractCegarLoop]: Abstraction has 50118 states and 80051 transitions. [2025-01-09 09:40:41,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82) [2025-01-09 09:40:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 50118 states and 80051 transitions. [2025-01-09 09:40:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 09:40:41,620 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:40:41,620 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:40:41,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 09:40:41,621 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:40:41,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:40:41,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1424043017, now seen corresponding path program 1 times [2025-01-09 09:40:41,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:40:41,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559433431] [2025-01-09 09:40:41,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:40:41,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:40:41,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 09:40:41,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 09:40:41,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:40:41,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:40:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:40:43,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:40:43,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559433431] [2025-01-09 09:40:43,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559433431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:40:43,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:40:43,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:40:43,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877449563] [2025-01-09 09:40:43,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:40:43,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:40:43,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:40:43,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:40:43,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:40:43,630 INFO L87 Difference]: Start difference. First operand 50118 states and 80051 transitions. Second operand has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:40:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:40:53,617 INFO L93 Difference]: Finished difference Result 118248 states and 187996 transitions. [2025-01-09 09:40:53,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 09:40:53,618 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) Word has length 519 [2025-01-09 09:40:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:40:53,878 INFO L225 Difference]: With dead ends: 118248 [2025-01-09 09:40:53,878 INFO L226 Difference]: Without dead ends: 76610 [2025-01-09 09:40:53,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2025-01-09 09:40:53,980 INFO L435 NwaCegarLoop]: 965 mSDtfsCounter, 1831 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 698 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1831 SdHoareTripleChecker+Valid, 4405 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 698 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:40:53,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1831 Valid, 4405 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [698 Valid, 2601 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 09:40:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76610 states. [2025-01-09 09:41:00,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76610 to 75024. [2025-01-09 09:41:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75024 states, 52376 states have (on average 1.447074996181457) internal successors, (75792), 52939 states have internal predecessors, (75792), 21429 states have call successors, (21429), 1218 states have call predecessors, (21429), 1218 states have return successors, (21429), 20866 states have call predecessors, (21429), 21429 states have call successors, (21429) [2025-01-09 09:41:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75024 states to 75024 states and 118650 transitions. [2025-01-09 09:41:01,247 INFO L78 Accepts]: Start accepts. Automaton has 75024 states and 118650 transitions. Word has length 519 [2025-01-09 09:41:01,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:41:01,248 INFO L471 AbstractCegarLoop]: Abstraction has 75024 states and 118650 transitions. [2025-01-09 09:41:01,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.2) internal successors, (112), 10 states have internal predecessors, (112), 2 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 2 states have call predecessors, (82), 2 states have call successors, (82) [2025-01-09 09:41:01,248 INFO L276 IsEmpty]: Start isEmpty. Operand 75024 states and 118650 transitions. [2025-01-09 09:41:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-01-09 09:41:01,262 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:41:01,263 INFO L218 NwaCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:41:01,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 09:41:01,263 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:41:01,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:41:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash -764511495, now seen corresponding path program 1 times [2025-01-09 09:41:01,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:41:01,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671386170] [2025-01-09 09:41:01,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:41:01,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:41:01,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-01-09 09:41:01,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-01-09 09:41:01,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:41:01,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:41:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13284 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13284 trivial. 0 not checked. [2025-01-09 09:41:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:41:02,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671386170] [2025-01-09 09:41:02,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671386170] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:41:02,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:41:02,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 09:41:02,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836059622] [2025-01-09 09:41:02,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:41:02,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:41:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:41:02,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:41:02,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 09:41:02,358 INFO L87 Difference]: Start difference. First operand 75024 states and 118650 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 1 states have call successors, (82), 1 states have call predecessors, (82), 1 states have return successors, (82), 1 states have call predecessors, (82), 1 states have call successors, (82)