./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 05:48:39,092 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 05:48:39,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 05:48:39,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 05:48:39,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 05:48:39,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 05:48:39,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 05:48:39,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 05:48:39,191 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 05:48:39,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 05:48:39,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 05:48:39,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 05:48:39,193 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 05:48:39,193 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 05:48:39,195 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 05:48:39,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 05:48:39,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 05:48:39,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 05:48:39,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 05:48:39,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 05:48:39,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 05:48:39,201 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 05:48:39,202 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 05:48:39,202 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 05:48:39,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 05:48:39,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 05:48:39,202 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 05:48:39,203 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 05:48:39,203 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 05:48:39,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 05:48:39,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 05:48:39,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 05:48:39,204 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:48:39,204 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 05:48:39,204 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 05:48:39,204 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 05:48:39,204 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 05:48:39,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 05:48:39,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 05:48:39,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 05:48:39,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 05:48:39,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 05:48:39,208 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 6148f57821a61bb66da81c5e9fb13250aa14d609ed7f31d3b9237ae5f0b8d661 [2024-10-24 05:48:39,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 05:48:39,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 05:48:39,524 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 05:48:39,525 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 05:48:39,525 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 05:48:39,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2024-10-24 05:48:40,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 05:48:41,167 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 05:48:41,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i [2024-10-24 05:48:41,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b188c7769/c9359016f29040fc8c99b5af75400229/FLAG5dec96e5a [2024-10-24 05:48:41,493 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b188c7769/c9359016f29040fc8c99b5af75400229 [2024-10-24 05:48:41,495 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 05:48:41,496 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 05:48:41,498 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 05:48:41,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 05:48:41,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 05:48:41,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50bac310 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41, skipping insertion in model container [2024-10-24 05:48:41,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 05:48:41,717 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2024-10-24 05:48:41,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:48:41,778 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 05:48:41,793 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-86.i[913,926] [2024-10-24 05:48:41,831 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 05:48:41,850 INFO L204 MainTranslator]: Completed translation [2024-10-24 05:48:41,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41 WrapperNode [2024-10-24 05:48:41,851 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 05:48:41,852 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 05:48:41,852 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 05:48:41,852 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 05:48:41,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,913 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-24 05:48:41,914 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 05:48:41,915 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 05:48:41,915 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 05:48:41,915 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 05:48:41,926 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,929 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,952 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]. [2024-10-24 05:48:41,953 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,953 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,963 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,977 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 05:48:41,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 05:48:41,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 05:48:41,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 05:48:41,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (1/1) ... [2024-10-24 05:48:41,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 05:48:41,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 05:48:42,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 05:48:42,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 05:48:42,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 05:48:42,069 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 05:48:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 05:48:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 05:48:42,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 05:48:42,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 05:48:42,151 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 05:48:42,155 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 05:48:42,597 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-10-24 05:48:42,597 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 05:48:42,651 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 05:48:42,653 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 05:48:42,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:48:42 BoogieIcfgContainer [2024-10-24 05:48:42,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 05:48:42,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 05:48:42,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 05:48:42,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 05:48:42,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 05:48:41" (1/3) ... [2024-10-24 05:48:42,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545f034f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:48:42, skipping insertion in model container [2024-10-24 05:48:42,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 05:48:41" (2/3) ... [2024-10-24 05:48:42,661 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545f034f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 05:48:42, skipping insertion in model container [2024-10-24 05:48:42,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 05:48:42" (3/3) ... [2024-10-24 05:48:42,662 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-86.i [2024-10-24 05:48:42,673 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 05:48:42,673 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 05:48:42,734 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 05:48:42,747 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;@dd2f3c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 05:48:42,747 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 05:48:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 05:48:42,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 05:48:42,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:48:42,762 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:48:42,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:48:42,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:48:42,766 INFO L85 PathProgramCache]: Analyzing trace with hash -418828216, now seen corresponding path program 1 times [2024-10-24 05:48:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:48:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94693489] [2024-10-24 05:48:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:48:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:48:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:48:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:48:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:48:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:48:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:48:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:48:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:48:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:48:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:48:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:48:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:48:43,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:48:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:48:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:48:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:48:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:48:43,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:48:43,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94693489] [2024-10-24 05:48:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94693489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:48:43,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:48:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 05:48:43,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285824425] [2024-10-24 05:48:43,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:48:43,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 05:48:43,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:48:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 05:48:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:48:43,159 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:48:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:48:43,206 INFO L93 Difference]: Finished difference Result 95 states and 165 transitions. [2024-10-24 05:48:43,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 05:48:43,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-10-24 05:48:43,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:48:43,217 INFO L225 Difference]: With dead ends: 95 [2024-10-24 05:48:43,217 INFO L226 Difference]: Without dead ends: 47 [2024-10-24 05:48:43,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 05:48:43,226 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:48:43,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:48:43,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-24 05:48:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-24 05:48:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 05:48:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 71 transitions. [2024-10-24 05:48:43,267 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 71 transitions. Word has length 97 [2024-10-24 05:48:43,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:48:43,269 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 71 transitions. [2024-10-24 05:48:43,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:48:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 71 transitions. [2024-10-24 05:48:43,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 05:48:43,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:48:43,276 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:48:43,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 05:48:43,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:48:43,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:48:43,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1564567482, now seen corresponding path program 1 times [2024-10-24 05:48:43,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:48:43,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344669221] [2024-10-24 05:48:43,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:48:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:48:43,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:48:43,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:48:43,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:48:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:48:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:48:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:48:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:48:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:48:43,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:48:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:48:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:48:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:48:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:48:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:48:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:48:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:48:43,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:48:43,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344669221] [2024-10-24 05:48:43,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344669221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:48:43,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:48:43,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 05:48:43,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918228950] [2024-10-24 05:48:43,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:48:43,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 05:48:43,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:48:43,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 05:48:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 05:48:43,768 INFO L87 Difference]: Start difference. First operand 47 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:43,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:48:43,976 INFO L93 Difference]: Finished difference Result 140 states and 212 transitions. [2024-10-24 05:48:43,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 05:48:43,977 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-24 05:48:43,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:48:43,979 INFO L225 Difference]: With dead ends: 140 [2024-10-24 05:48:43,979 INFO L226 Difference]: Without dead ends: 94 [2024-10-24 05:48:43,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 05:48:43,982 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 63 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 05:48:43,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 227 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 05:48:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-24 05:48:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 75. [2024-10-24 05:48:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:48:44,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 113 transitions. [2024-10-24 05:48:44,012 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 113 transitions. Word has length 97 [2024-10-24 05:48:44,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:48:44,013 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 113 transitions. [2024-10-24 05:48:44,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:44,014 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 113 transitions. [2024-10-24 05:48:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 05:48:44,016 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:48:44,016 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:48:44,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 05:48:44,017 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:48:44,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:48:44,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2143593800, now seen corresponding path program 1 times [2024-10-24 05:48:44,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:48:44,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640357044] [2024-10-24 05:48:44,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:48:44,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:48:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:48:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:48:51,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:48:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:48:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:48:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:48:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:48:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:48:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:48:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:48:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:48:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:48:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:48:51,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:48:51,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:48:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:48:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:48:51,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640357044] [2024-10-24 05:48:51,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640357044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:48:51,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:48:51,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 05:48:51,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131382874] [2024-10-24 05:48:51,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:48:51,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 05:48:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:48:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 05:48:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-10-24 05:48:51,169 INFO L87 Difference]: Start difference. First operand 75 states and 113 transitions. Second operand has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:48:53,713 INFO L93 Difference]: Finished difference Result 192 states and 284 transitions. [2024-10-24 05:48:53,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 05:48:53,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-24 05:48:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:48:53,716 INFO L225 Difference]: With dead ends: 192 [2024-10-24 05:48:53,717 INFO L226 Difference]: Without dead ends: 146 [2024-10-24 05:48:53,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2024-10-24 05:48:53,720 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 202 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:48:53,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 394 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 05:48:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-10-24 05:48:53,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 91. [2024-10-24 05:48:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-24 05:48:53,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 135 transitions. [2024-10-24 05:48:53,749 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 135 transitions. Word has length 97 [2024-10-24 05:48:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:48:53,750 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 135 transitions. [2024-10-24 05:48:53,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:53,750 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 135 transitions. [2024-10-24 05:48:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-24 05:48:53,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:48:53,752 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:48:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 05:48:53,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:48:53,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:48:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1750566790, now seen corresponding path program 1 times [2024-10-24 05:48:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:48:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634342647] [2024-10-24 05:48:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:48:53,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:48:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:48:53,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:48:53,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:48:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:48:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:48:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:48:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:48:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:48:53,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:48:53,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:48:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:48:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:48:53,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:48:53,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:48:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:48:53,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:48:53,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:48:53,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634342647] [2024-10-24 05:48:53,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634342647] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:48:53,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:48:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 05:48:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639370532] [2024-10-24 05:48:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:48:53,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 05:48:53,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:48:53,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 05:48:53,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:48:53,858 INFO L87 Difference]: Start difference. First operand 91 states and 135 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:53,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:48:53,897 INFO L93 Difference]: Finished difference Result 182 states and 273 transitions. [2024-10-24 05:48:53,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 05:48:53,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 97 [2024-10-24 05:48:53,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:48:53,900 INFO L225 Difference]: With dead ends: 182 [2024-10-24 05:48:53,900 INFO L226 Difference]: Without dead ends: 136 [2024-10-24 05:48:53,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 05:48:53,902 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:48:53,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 139 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:48:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-24 05:48:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-10-24 05:48:53,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 85 states have internal predecessors, (109), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:48:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2024-10-24 05:48:53,932 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 97 [2024-10-24 05:48:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:48:53,934 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 199 transitions. [2024-10-24 05:48:53,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:53,934 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 199 transitions. [2024-10-24 05:48:53,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 05:48:53,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:48:53,938 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:48:53,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 05:48:53,938 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:48:53,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:48:53,939 INFO L85 PathProgramCache]: Analyzing trace with hash -612437910, now seen corresponding path program 1 times [2024-10-24 05:48:53,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:48:53,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520893635] [2024-10-24 05:48:53,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:48:53,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:48:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:48:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:48:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:48:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:48:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:48:54,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:48:54,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:48:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:48:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:48:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:48:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:48:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:48:54,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:48:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:48:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:48:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:54,196 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:48:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:48:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520893635] [2024-10-24 05:48:54,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520893635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:48:54,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:48:54,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 05:48:54,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764016311] [2024-10-24 05:48:54,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:48:54,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 05:48:54,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:48:54,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 05:48:54,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:48:54,199 INFO L87 Difference]: Start difference. First operand 134 states and 199 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:54,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:48:54,243 INFO L93 Difference]: Finished difference Result 235 states and 349 transitions. [2024-10-24 05:48:54,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 05:48:54,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 05:48:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:48:54,247 INFO L225 Difference]: With dead ends: 235 [2024-10-24 05:48:54,248 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 05:48:54,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 05:48:54,252 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:48:54,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 182 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 05:48:54,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 05:48:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2024-10-24 05:48:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 85 states have internal predecessors, (106), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:48:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 196 transitions. [2024-10-24 05:48:54,277 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 196 transitions. Word has length 98 [2024-10-24 05:48:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:48:54,278 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 196 transitions. [2024-10-24 05:48:54,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 196 transitions. [2024-10-24 05:48:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 05:48:54,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:48:54,280 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:48:54,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 05:48:54,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:48:54,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:48:54,281 INFO L85 PathProgramCache]: Analyzing trace with hash -555179608, now seen corresponding path program 1 times [2024-10-24 05:48:54,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:48:54,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514122843] [2024-10-24 05:48:54,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:48:54,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:48:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:48:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:48:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:48:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:48:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:48:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:48:57,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:48:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:48:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:48:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:48:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:48:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:48:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:48:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:48:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:48:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:48:57,296 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:48:57,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:48:57,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514122843] [2024-10-24 05:48:57,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514122843] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:48:57,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:48:57,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 05:48:57,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251029037] [2024-10-24 05:48:57,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:48:57,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 05:48:57,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:48:57,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 05:48:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2024-10-24 05:48:57,299 INFO L87 Difference]: Start difference. First operand 134 states and 196 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:48:58,403 INFO L93 Difference]: Finished difference Result 186 states and 254 transitions. [2024-10-24 05:48:58,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 05:48:58,404 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 05:48:58,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:48:58,406 INFO L225 Difference]: With dead ends: 186 [2024-10-24 05:48:58,406 INFO L226 Difference]: Without dead ends: 184 [2024-10-24 05:48:58,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=227, Invalid=643, Unknown=0, NotChecked=0, Total=870 [2024-10-24 05:48:58,408 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 225 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 05:48:58,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 369 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 05:48:58,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-10-24 05:48:58,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 132. [2024-10-24 05:48:58,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 83 states have internal predecessors, (103), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:48:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 193 transitions. [2024-10-24 05:48:58,429 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 193 transitions. Word has length 98 [2024-10-24 05:48:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:48:58,429 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 193 transitions. [2024-10-24 05:48:58,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:48:58,430 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 193 transitions. [2024-10-24 05:48:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 05:48:58,431 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:48:58,431 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:48:58,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 05:48:58,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:48:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:48:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2026805188, now seen corresponding path program 1 times [2024-10-24 05:48:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:48:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972481557] [2024-10-24 05:48:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:48:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:48:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:02,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:02,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:02,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:02,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:02,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:02,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972481557] [2024-10-24 05:49:02,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972481557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:02,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 05:49:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194651902] [2024-10-24 05:49:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:02,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 05:49:02,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:02,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 05:49:02,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 05:49:02,278 INFO L87 Difference]: Start difference. First operand 132 states and 193 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:49:04,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:49:04,651 INFO L93 Difference]: Finished difference Result 182 states and 250 transitions. [2024-10-24 05:49:04,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 05:49:04,652 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 05:49:04,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:49:04,653 INFO L225 Difference]: With dead ends: 182 [2024-10-24 05:49:04,653 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 05:49:04,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2024-10-24 05:49:04,654 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 208 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:49:04,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 306 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:49:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 05:49:04,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 135. [2024-10-24 05:49:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 86 states have (on average 1.244186046511628) internal successors, (107), 86 states have internal predecessors, (107), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:49:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 197 transitions. [2024-10-24 05:49:04,680 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 197 transitions. Word has length 98 [2024-10-24 05:49:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:49:04,681 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 197 transitions. [2024-10-24 05:49:04,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:49:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 197 transitions. [2024-10-24 05:49:04,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 05:49:04,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:49:04,683 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:49:04,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 05:49:04,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:49:04,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:49:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2062893163, now seen corresponding path program 1 times [2024-10-24 05:49:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:49:04,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123692407] [2024-10-24 05:49:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:49:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:49:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:08,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:08,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123692407] [2024-10-24 05:49:08,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123692407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:08,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:08,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 05:49:08,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237188640] [2024-10-24 05:49:08,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:08,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 05:49:08,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:08,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 05:49:08,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-10-24 05:49:08,425 INFO L87 Difference]: Start difference. First operand 135 states and 197 transitions. Second operand has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:49:10,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:49:10,410 INFO L93 Difference]: Finished difference Result 199 states and 270 transitions. [2024-10-24 05:49:10,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 05:49:10,412 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-24 05:49:10,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:49:10,413 INFO L225 Difference]: With dead ends: 199 [2024-10-24 05:49:10,413 INFO L226 Difference]: Without dead ends: 197 [2024-10-24 05:49:10,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2024-10-24 05:49:10,414 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 195 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 05:49:10,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 389 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 05:49:10,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-24 05:49:10,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 144. [2024-10-24 05:49:10,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:49:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-24 05:49:10,436 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-24 05:49:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:49:10,437 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-24 05:49:10,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 15 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 05:49:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-24 05:49:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 05:49:10,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:49:10,439 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:49:10,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 05:49:10,440 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:49:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:49:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1253546537, now seen corresponding path program 1 times [2024-10-24 05:49:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:49:10,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507947716] [2024-10-24 05:49:10,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:49:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:49:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:13,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:13,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507947716] [2024-10-24 05:49:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507947716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 05:49:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211249511] [2024-10-24 05:49:13,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:13,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 05:49:13,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:13,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 05:49:13,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:49:13,916 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:49:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:49:16,475 INFO L93 Difference]: Finished difference Result 193 states and 264 transitions. [2024-10-24 05:49:16,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 05:49:16,476 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-10-24 05:49:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:49:16,477 INFO L225 Difference]: With dead ends: 193 [2024-10-24 05:49:16,477 INFO L226 Difference]: Without dead ends: 191 [2024-10-24 05:49:16,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=280, Invalid=650, Unknown=0, NotChecked=0, Total=930 [2024-10-24 05:49:16,478 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 187 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 05:49:16,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 395 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 05:49:16,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-24 05:49:16,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 144. [2024-10-24 05:49:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:49:16,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-24 05:49:16,494 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 98 [2024-10-24 05:49:16,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:49:16,494 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-24 05:49:16,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.7333333333333334) internal successors, (26), 16 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:49:16,494 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-24 05:49:16,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 05:49:16,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:49:16,495 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:49:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 05:49:16,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:49:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:49:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash -30791836, now seen corresponding path program 1 times [2024-10-24 05:49:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:49:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165209802] [2024-10-24 05:49:16,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:49:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:49:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:21,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:21,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:21,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:21,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165209802] [2024-10-24 05:49:21,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165209802] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:21,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:21,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 05:49:21,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047062113] [2024-10-24 05:49:21,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:21,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 05:49:21,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:21,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 05:49:21,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2024-10-24 05:49:21,102 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 05:49:22,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:49:22,909 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2024-10-24 05:49:22,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 05:49:22,909 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 99 [2024-10-24 05:49:22,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:49:22,911 INFO L225 Difference]: With dead ends: 182 [2024-10-24 05:49:22,911 INFO L226 Difference]: Without dead ends: 180 [2024-10-24 05:49:22,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=216, Invalid=654, Unknown=0, NotChecked=0, Total=870 [2024-10-24 05:49:22,912 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 236 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 05:49:22,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 337 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 05:49:22,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-10-24 05:49:22,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 141. [2024-10-24 05:49:22,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:49:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 205 transitions. [2024-10-24 05:49:22,922 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 205 transitions. Word has length 99 [2024-10-24 05:49:22,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:49:22,923 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 205 transitions. [2024-10-24 05:49:22,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-10-24 05:49:22,923 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 205 transitions. [2024-10-24 05:49:22,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 05:49:22,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:49:22,924 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:49:22,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 05:49:22,924 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:49:22,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:49:22,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1238067941, now seen corresponding path program 1 times [2024-10-24 05:49:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:49:22,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629845992] [2024-10-24 05:49:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:49:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:49:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:28,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:28,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:28,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:28,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629845992] [2024-10-24 05:49:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629845992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 05:49:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038421640] [2024-10-24 05:49:28,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:28,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 05:49:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 05:49:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-10-24 05:49:28,024 INFO L87 Difference]: Start difference. First operand 141 states and 205 transitions. Second operand has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:49:31,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:49:31,501 INFO L93 Difference]: Finished difference Result 198 states and 269 transitions. [2024-10-24 05:49:31,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 05:49:31,502 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-10-24 05:49:31,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:49:31,503 INFO L225 Difference]: With dead ends: 198 [2024-10-24 05:49:31,503 INFO L226 Difference]: Without dead ends: 196 [2024-10-24 05:49:31,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=304, Invalid=818, Unknown=0, NotChecked=0, Total=1122 [2024-10-24 05:49:31,504 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 305 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 05:49:31,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 346 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 05:49:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-10-24 05:49:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 144. [2024-10-24 05:49:31,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 95 states have internal predecessors, (119), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:49:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 209 transitions. [2024-10-24 05:49:31,515 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 209 transitions. Word has length 99 [2024-10-24 05:49:31,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:49:31,515 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 209 transitions. [2024-10-24 05:49:31,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.588235294117647) internal successors, (27), 17 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 05:49:31,516 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 209 transitions. [2024-10-24 05:49:31,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 05:49:31,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:49:31,517 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:49:31,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 05:49:31,517 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:49:31,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:49:31,518 INFO L85 PathProgramCache]: Analyzing trace with hash -474854977, now seen corresponding path program 1 times [2024-10-24 05:49:31,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:49:31,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406707661] [2024-10-24 05:49:31,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:49:31,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:49:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:36,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:36,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:37,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:37,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:37,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406707661] [2024-10-24 05:49:37,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406707661] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 05:49:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192822816] [2024-10-24 05:49:37,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:37,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 05:49:37,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:37,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 05:49:37,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-24 05:49:37,041 INFO L87 Difference]: Start difference. First operand 144 states and 209 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 05:49:42,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:49:42,858 INFO L93 Difference]: Finished difference Result 200 states and 270 transitions. [2024-10-24 05:49:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-24 05:49:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 99 [2024-10-24 05:49:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:49:42,860 INFO L225 Difference]: With dead ends: 200 [2024-10-24 05:49:42,860 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 05:49:42,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=343, Invalid=989, Unknown=0, NotChecked=0, Total=1332 [2024-10-24 05:49:42,861 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 349 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:49:42,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 457 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 05:49:42,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 05:49:42,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2024-10-24 05:49:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 101 states have internal predecessors, (126), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:49:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2024-10-24 05:49:42,874 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 99 [2024-10-24 05:49:42,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:49:42,875 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2024-10-24 05:49:42,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 05:49:42,875 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2024-10-24 05:49:42,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 05:49:42,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:49:42,876 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:49:42,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 05:49:42,876 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:49:42,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:49:42,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1918126311, now seen corresponding path program 1 times [2024-10-24 05:49:42,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:49:42,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100270765] [2024-10-24 05:49:42,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:49:42,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:49:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:47,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:47,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:47,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:47,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:47,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:47,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100270765] [2024-10-24 05:49:47,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100270765] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:47,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:47,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-24 05:49:47,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997257766] [2024-10-24 05:49:47,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:47,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-24 05:49:47,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-24 05:49:47,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2024-10-24 05:49:47,152 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 05:49:51,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 05:49:51,686 INFO L93 Difference]: Finished difference Result 200 states and 270 transitions. [2024-10-24 05:49:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-24 05:49:51,687 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 99 [2024-10-24 05:49:51,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 05:49:51,688 INFO L225 Difference]: With dead ends: 200 [2024-10-24 05:49:51,688 INFO L226 Difference]: Without dead ends: 198 [2024-10-24 05:49:51,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=434, Invalid=1126, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 05:49:51,690 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 238 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-24 05:49:51,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 501 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-24 05:49:51,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-24 05:49:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 151. [2024-10-24 05:49:51,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 101 states have internal predecessors, (126), 45 states have call successors, (45), 4 states have call predecessors, (45), 4 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-24 05:49:51,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2024-10-24 05:49:51,706 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 99 [2024-10-24 05:49:51,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 05:49:51,707 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2024-10-24 05:49:51,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.5) internal successors, (27), 19 states have internal predecessors, (27), 4 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-10-24 05:49:51,707 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2024-10-24 05:49:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 05:49:51,708 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 05:49:51,708 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 05:49:51,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 05:49:51,708 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 05:49:51,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 05:49:51,709 INFO L85 PathProgramCache]: Analyzing trace with hash 205203393, now seen corresponding path program 1 times [2024-10-24 05:49:51,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 05:49:51,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091808948] [2024-10-24 05:49:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 05:49:51,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 05:49:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 05:49:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 05:49:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 05:49:59,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 05:49:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 05:49:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 05:49:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 05:49:59,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 05:49:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 05:49:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 05:49:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-24 05:49:59,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 05:49:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 05:49:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 05:49:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 05:49:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 05:49:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 05:49:59,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 05:49:59,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091808948] [2024-10-24 05:49:59,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091808948] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 05:49:59,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 05:49:59,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 05:49:59,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749172915] [2024-10-24 05:49:59,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 05:49:59,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 05:49:59,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 05:49:59,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 05:49:59,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-10-24 05:49:59,599 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand has 16 states, 16 states have (on average 1.6875) internal successors, (27), 16 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)