./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -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 38de1f601deff70f21f1ef1f0123eb0d7f517b820846e07815605162625b0305 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:51:56,605 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:51:56,659 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:51:56,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:51:56,666 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:51:56,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:51:56,689 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:51:56,690 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:51:56,690 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:51:56,691 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:51:56,691 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:51:56,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:51:56,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:51:56,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:51:56,693 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:51:56,694 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:51:56,694 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:51:56,694 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:51:56,694 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:51:56,695 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:51:56,695 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:51:56,698 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:51:56,699 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:51:56,699 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:51:56,699 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:51:56,699 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:51:56,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:51:56,700 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:51:56,700 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:51:56,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:51:56,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:51:56,700 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:51:56,700 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:51:56,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:51:56,701 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:51:56,701 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:51:56,701 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:51:56,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:51:56,701 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:51:56,702 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:51:56,702 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:51:56,703 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:51:56,703 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 -> 38de1f601deff70f21f1ef1f0123eb0d7f517b820846e07815605162625b0305 [2024-11-08 15:51:56,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:51:56,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:51:56,980 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:51:56,982 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:51:56,982 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:51:56,984 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-08 15:51:58,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:51:58,596 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:51:58,597 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-08 15:51:58,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f128fb2e2/c1df911c6a6b4cf48299959b8e5c2ddd/FLAG5d53f93d2 [2024-11-08 15:51:58,628 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f128fb2e2/c1df911c6a6b4cf48299959b8e5c2ddd [2024-11-08 15:51:58,630 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:51:58,632 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:51:58,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:51:58,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:51:58,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:51:58,638 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:51:58" (1/1) ... [2024-11-08 15:51:58,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f319975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:58, skipping insertion in model container [2024-11-08 15:51:58,640 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:51:58" (1/1) ... [2024-11-08 15:51:58,708 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:51:59,158 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[30493,30506] [2024-11-08 15:51:59,216 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[33882,33895] [2024-11-08 15:51:59,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:51:59,382 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:51:59,519 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[30493,30506] [2024-11-08 15:51:59,547 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c[33882,33895] [2024-11-08 15:51:59,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:51:59,658 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:51:59,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59 WrapperNode [2024-11-08 15:51:59,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:51:59,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:51:59,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:51:59,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:51:59,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,773 INFO L138 Inliner]: procedures = 24, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3966 [2024-11-08 15:51:59,774 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:51:59,774 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:51:59,774 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:51:59,775 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:51:59,783 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,828 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-11-08 15:51:59,828 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,829 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,856 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:51:59,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:51:59,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:51:59,919 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:51:59,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (1/1) ... [2024-11-08 15:51:59,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:51:59,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:51:59,950 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-11-08 15:51:59,956 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-11-08 15:52:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:52:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:52:00,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:52:00,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:52:00,172 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:52:00,174 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:52:02,212 INFO L? ?]: Removed 221 outVars from TransFormulas that were not future-live. [2024-11-08 15:52:02,212 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:52:02,251 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:52:02,251 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 15:52:02,252 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:52:02 BoogieIcfgContainer [2024-11-08 15:52:02,252 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:52:02,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:52:02,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:52:02,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:52:02,256 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:51:58" (1/3) ... [2024-11-08 15:52:02,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0e84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:52:02, skipping insertion in model container [2024-11-08 15:52:02,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:51:59" (2/3) ... [2024-11-08 15:52:02,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0e84e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:52:02, skipping insertion in model container [2024-11-08 15:52:02,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:52:02" (3/3) ... [2024-11-08 15:52:02,261 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2024-11-08 15:52:02,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:52:02,276 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 15:52:02,365 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:52:02,370 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;@362ac794, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:52:02,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 15:52:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 1121 states, 1118 states have (on average 1.7361359570661896) internal successors, (1941), 1120 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:02,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-08 15:52:02,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:02,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:02,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:02,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash 456360996, now seen corresponding path program 1 times [2024-11-08 15:52:02,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537370518] [2024-11-08 15:52:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:02,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:03,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:03,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:03,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537370518] [2024-11-08 15:52:03,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537370518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:03,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:03,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:03,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347317001] [2024-11-08 15:52:03,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:03,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:03,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:03,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:03,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:03,095 INFO L87 Difference]: Start difference. First operand has 1121 states, 1118 states have (on average 1.7361359570661896) internal successors, (1941), 1120 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:03,269 INFO L93 Difference]: Finished difference Result 2054 states and 3532 transitions. [2024-11-08 15:52:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:03,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-08 15:52:03,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:03,294 INFO L225 Difference]: With dead ends: 2054 [2024-11-08 15:52:03,294 INFO L226 Difference]: Without dead ends: 1118 [2024-11-08 15:52:03,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:03,306 INFO L432 NwaCegarLoop]: 1937 mSDtfsCounter, 0 mSDsluCounter, 3826 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5763 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:03,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5763 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2024-11-08 15:52:03,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1118. [2024-11-08 15:52:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1116 states have (on average 1.6926523297491038) internal successors, (1889), 1117 states have internal predecessors, (1889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:03,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1889 transitions. [2024-11-08 15:52:03,380 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1889 transitions. Word has length 150 [2024-11-08 15:52:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:03,380 INFO L471 AbstractCegarLoop]: Abstraction has 1118 states and 1889 transitions. [2024-11-08 15:52:03,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1889 transitions. [2024-11-08 15:52:03,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 15:52:03,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:03,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:03,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 15:52:03,389 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:03,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1166050469, now seen corresponding path program 1 times [2024-11-08 15:52:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:03,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970209752] [2024-11-08 15:52:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:03,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:03,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:03,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970209752] [2024-11-08 15:52:03,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970209752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:03,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:03,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:03,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911439854] [2024-11-08 15:52:03,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:03,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:03,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:03,627 INFO L87 Difference]: Start difference. First operand 1118 states and 1889 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:03,910 INFO L93 Difference]: Finished difference Result 2859 states and 4838 transitions. [2024-11-08 15:52:03,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:03,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2024-11-08 15:52:03,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:03,916 INFO L225 Difference]: With dead ends: 2859 [2024-11-08 15:52:03,917 INFO L226 Difference]: Without dead ends: 1949 [2024-11-08 15:52:03,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:03,919 INFO L432 NwaCegarLoop]: 3002 mSDtfsCounter, 1382 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 4723 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:03,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 4723 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:52:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2024-11-08 15:52:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1939. [2024-11-08 15:52:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1939 states, 1937 states have (on average 1.6721734641197727) internal successors, (3239), 1938 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:03,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 3239 transitions. [2024-11-08 15:52:03,963 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 3239 transitions. Word has length 191 [2024-11-08 15:52:03,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:03,964 INFO L471 AbstractCegarLoop]: Abstraction has 1939 states and 3239 transitions. [2024-11-08 15:52:03,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:03,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 3239 transitions. [2024-11-08 15:52:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-08 15:52:03,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:03,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:03,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 15:52:03,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:03,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:03,971 INFO L85 PathProgramCache]: Analyzing trace with hash 955874818, now seen corresponding path program 1 times [2024-11-08 15:52:03,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:03,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085336709] [2024-11-08 15:52:03,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:03,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:04,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:04,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:04,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085336709] [2024-11-08 15:52:04,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085336709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54510392] [2024-11-08 15:52:04,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:04,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:04,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:04,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:04,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:04,156 INFO L87 Difference]: Start difference. First operand 1939 states and 3239 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:04,230 INFO L93 Difference]: Finished difference Result 3238 states and 5452 transitions. [2024-11-08 15:52:04,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:04,231 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-11-08 15:52:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:04,239 INFO L225 Difference]: With dead ends: 3238 [2024-11-08 15:52:04,240 INFO L226 Difference]: Without dead ends: 2328 [2024-11-08 15:52:04,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:04,244 INFO L432 NwaCegarLoop]: 2907 mSDtfsCounter, 1241 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1241 SdHoareTripleChecker+Valid, 4541 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:04,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1241 Valid, 4541 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:52:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2024-11-08 15:52:04,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2324. [2024-11-08 15:52:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2324 states, 2322 states have (on average 1.677433247200689) internal successors, (3895), 2323 states have internal predecessors, (3895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:04,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2324 states to 2324 states and 3895 transitions. [2024-11-08 15:52:04,278 INFO L78 Accepts]: Start accepts. Automaton has 2324 states and 3895 transitions. Word has length 196 [2024-11-08 15:52:04,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:04,279 INFO L471 AbstractCegarLoop]: Abstraction has 2324 states and 3895 transitions. [2024-11-08 15:52:04,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:04,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2324 states and 3895 transitions. [2024-11-08 15:52:04,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-08 15:52:04,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:04,283 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:04,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 15:52:04,284 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:04,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:04,284 INFO L85 PathProgramCache]: Analyzing trace with hash 339194995, now seen corresponding path program 1 times [2024-11-08 15:52:04,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:04,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819268209] [2024-11-08 15:52:04,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:04,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:04,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:04,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819268209] [2024-11-08 15:52:04,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819268209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:04,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:04,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736406911] [2024-11-08 15:52:04,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:04,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:04,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:04,476 INFO L87 Difference]: Start difference. First operand 2324 states and 3895 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:04,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:04,598 INFO L93 Difference]: Finished difference Result 6356 states and 10643 transitions. [2024-11-08 15:52:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:04,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-11-08 15:52:04,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:04,613 INFO L225 Difference]: With dead ends: 6356 [2024-11-08 15:52:04,613 INFO L226 Difference]: Without dead ends: 4258 [2024-11-08 15:52:04,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:04,622 INFO L432 NwaCegarLoop]: 2994 mSDtfsCounter, 1399 mSDsluCounter, 1718 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 4712 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:04,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 4712 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2024-11-08 15:52:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 4237. [2024-11-08 15:52:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4237 states, 4235 states have (on average 1.667060212514758) internal successors, (7060), 4236 states have internal predecessors, (7060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4237 states to 4237 states and 7060 transitions. [2024-11-08 15:52:04,700 INFO L78 Accepts]: Start accepts. Automaton has 4237 states and 7060 transitions. Word has length 199 [2024-11-08 15:52:04,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:04,702 INFO L471 AbstractCegarLoop]: Abstraction has 4237 states and 7060 transitions. [2024-11-08 15:52:04,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4237 states and 7060 transitions. [2024-11-08 15:52:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-08 15:52:04,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:04,709 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:04,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 15:52:04,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:04,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:04,711 INFO L85 PathProgramCache]: Analyzing trace with hash 62690234, now seen corresponding path program 1 times [2024-11-08 15:52:04,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:04,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122799231] [2024-11-08 15:52:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:04,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:04,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:04,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:04,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122799231] [2024-11-08 15:52:04,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122799231] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:04,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135587803] [2024-11-08 15:52:04,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:04,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:04,883 INFO L87 Difference]: Start difference. First operand 4237 states and 7060 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:04,989 INFO L93 Difference]: Finished difference Result 7494 states and 12548 transitions. [2024-11-08 15:52:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 204 [2024-11-08 15:52:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:05,005 INFO L225 Difference]: With dead ends: 7494 [2024-11-08 15:52:05,005 INFO L226 Difference]: Without dead ends: 5396 [2024-11-08 15:52:05,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:05,010 INFO L432 NwaCegarLoop]: 2840 mSDtfsCounter, 1212 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1212 SdHoareTripleChecker+Valid, 4431 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:05,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1212 Valid, 4431 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:05,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5396 states. [2024-11-08 15:52:05,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5396 to 5392. [2024-11-08 15:52:05,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5392 states, 5390 states have (on average 1.6701298701298701) internal successors, (9002), 5391 states have internal predecessors, (9002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:05,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5392 states to 5392 states and 9002 transitions. [2024-11-08 15:52:05,090 INFO L78 Accepts]: Start accepts. Automaton has 5392 states and 9002 transitions. Word has length 204 [2024-11-08 15:52:05,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:05,090 INFO L471 AbstractCegarLoop]: Abstraction has 5392 states and 9002 transitions. [2024-11-08 15:52:05,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 3 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:05,091 INFO L276 IsEmpty]: Start isEmpty. Operand 5392 states and 9002 transitions. [2024-11-08 15:52:05,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-08 15:52:05,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:05,098 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:05,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 15:52:05,098 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:05,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:05,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1975423087, now seen corresponding path program 1 times [2024-11-08 15:52:05,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:05,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122314577] [2024-11-08 15:52:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:05,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:05,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122314577] [2024-11-08 15:52:05,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122314577] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:05,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:05,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:05,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364596124] [2024-11-08 15:52:05,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:05,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:05,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:05,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:05,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:05,317 INFO L87 Difference]: Start difference. First operand 5392 states and 9002 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:05,476 INFO L93 Difference]: Finished difference Result 15236 states and 25366 transitions. [2024-11-08 15:52:05,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:05,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2024-11-08 15:52:05,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:05,505 INFO L225 Difference]: With dead ends: 15236 [2024-11-08 15:52:05,505 INFO L226 Difference]: Without dead ends: 10088 [2024-11-08 15:52:05,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:05,516 INFO L432 NwaCegarLoop]: 2919 mSDtfsCounter, 1368 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 4586 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:05,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 4586 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10088 states. [2024-11-08 15:52:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10088 to 10035. [2024-11-08 15:52:05,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10035 states, 10033 states have (on average 1.6552377155387221) internal successors, (16607), 10034 states have internal predecessors, (16607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10035 states to 10035 states and 16607 transitions. [2024-11-08 15:52:05,704 INFO L78 Accepts]: Start accepts. Automaton has 10035 states and 16607 transitions. Word has length 207 [2024-11-08 15:52:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:05,704 INFO L471 AbstractCegarLoop]: Abstraction has 10035 states and 16607 transitions. [2024-11-08 15:52:05,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:05,704 INFO L276 IsEmpty]: Start isEmpty. Operand 10035 states and 16607 transitions. [2024-11-08 15:52:05,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-08 15:52:05,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:05,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:05,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:52:05,717 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:05,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:05,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1745832106, now seen corresponding path program 1 times [2024-11-08 15:52:05,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:05,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130867561] [2024-11-08 15:52:05,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:05,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:05,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:05,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:05,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130867561] [2024-11-08 15:52:05,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130867561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:05,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:05,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:05,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825258847] [2024-11-08 15:52:05,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:05,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:05,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:05,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:05,895 INFO L87 Difference]: Start difference. First operand 10035 states and 16607 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:06,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:06,033 INFO L93 Difference]: Finished difference Result 18168 states and 30221 transitions. [2024-11-08 15:52:06,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2024-11-08 15:52:06,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:06,061 INFO L225 Difference]: With dead ends: 18168 [2024-11-08 15:52:06,061 INFO L226 Difference]: Without dead ends: 13020 [2024-11-08 15:52:06,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:06,072 INFO L432 NwaCegarLoop]: 2765 mSDtfsCounter, 1183 mSDsluCounter, 1540 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1183 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:06,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1183 Valid, 4305 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13020 states. [2024-11-08 15:52:06,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13020 to 13016. [2024-11-08 15:52:06,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13016 states, 13014 states have (on average 1.657061625941294) internal successors, (21565), 13015 states have internal predecessors, (21565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:06,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 21565 transitions. [2024-11-08 15:52:06,300 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 21565 transitions. Word has length 212 [2024-11-08 15:52:06,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:06,300 INFO L471 AbstractCegarLoop]: Abstraction has 13016 states and 21565 transitions. [2024-11-08 15:52:06,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 21565 transitions. [2024-11-08 15:52:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 15:52:06,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:06,315 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:06,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:52:06,316 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:06,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:06,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1067466193, now seen corresponding path program 1 times [2024-11-08 15:52:06,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:06,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486740950] [2024-11-08 15:52:06,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:06,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:06,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:06,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486740950] [2024-11-08 15:52:06,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486740950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:06,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:06,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:06,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104222755] [2024-11-08 15:52:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:06,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:06,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:06,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:06,509 INFO L87 Difference]: Start difference. First operand 13016 states and 21565 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:06,712 INFO L93 Difference]: Finished difference Result 37226 states and 61403 transitions. [2024-11-08 15:52:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:06,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-11-08 15:52:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:06,750 INFO L225 Difference]: With dead ends: 37226 [2024-11-08 15:52:06,751 INFO L226 Difference]: Without dead ends: 24472 [2024-11-08 15:52:06,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:06,771 INFO L432 NwaCegarLoop]: 2844 mSDtfsCounter, 1337 mSDsluCounter, 1616 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1337 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:06,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1337 Valid, 4460 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:06,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24472 states. [2024-11-08 15:52:07,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24472 to 24325. [2024-11-08 15:52:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24325 states, 24323 states have (on average 1.637380257369568) internal successors, (39826), 24324 states have internal predecessors, (39826), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:07,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24325 states to 24325 states and 39826 transitions. [2024-11-08 15:52:07,169 INFO L78 Accepts]: Start accepts. Automaton has 24325 states and 39826 transitions. Word has length 215 [2024-11-08 15:52:07,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:07,170 INFO L471 AbstractCegarLoop]: Abstraction has 24325 states and 39826 transitions. [2024-11-08 15:52:07,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:07,170 INFO L276 IsEmpty]: Start isEmpty. Operand 24325 states and 39826 transitions. [2024-11-08 15:52:07,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-08 15:52:07,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:07,196 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:07,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:52:07,197 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:07,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash -518054986, now seen corresponding path program 1 times [2024-11-08 15:52:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:07,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727023799] [2024-11-08 15:52:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:07,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:07,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:07,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727023799] [2024-11-08 15:52:07,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727023799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:07,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:07,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 15:52:07,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237524320] [2024-11-08 15:52:07,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:07,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:52:07,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:07,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:52:07,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:07,304 INFO L87 Difference]: Start difference. First operand 24325 states and 39826 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:07,566 INFO L93 Difference]: Finished difference Result 44146 states and 72658 transitions. [2024-11-08 15:52:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:52:07,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 220 [2024-11-08 15:52:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:07,623 INFO L225 Difference]: With dead ends: 44146 [2024-11-08 15:52:07,624 INFO L226 Difference]: Without dead ends: 31392 [2024-11-08 15:52:07,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 15:52:07,652 INFO L432 NwaCegarLoop]: 2690 mSDtfsCounter, 1154 mSDsluCounter, 1489 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 4179 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:07,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 4179 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:52:07,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31392 states. [2024-11-08 15:52:08,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31392 to 31388. [2024-11-08 15:52:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31388 states, 31386 states have (on average 1.636908175619703) internal successors, (51376), 31387 states have internal predecessors, (51376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31388 states to 31388 states and 51376 transitions. [2024-11-08 15:52:08,209 INFO L78 Accepts]: Start accepts. Automaton has 31388 states and 51376 transitions. Word has length 220 [2024-11-08 15:52:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:08,209 INFO L471 AbstractCegarLoop]: Abstraction has 31388 states and 51376 transitions. [2024-11-08 15:52:08,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 31388 states and 51376 transitions. [2024-11-08 15:52:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-08 15:52:08,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:08,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:08,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:52:08,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:08,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:08,245 INFO L85 PathProgramCache]: Analyzing trace with hash 855859059, now seen corresponding path program 1 times [2024-11-08 15:52:08,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:08,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598919837] [2024-11-08 15:52:08,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:08,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:08,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:08,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598919837] [2024-11-08 15:52:08,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598919837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:08,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:08,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:08,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530029887] [2024-11-08 15:52:08,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:08,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:08,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:08,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:08,695 INFO L87 Difference]: Start difference. First operand 31388 states and 51376 transitions. Second operand has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:10,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:10,208 INFO L93 Difference]: Finished difference Result 198225 states and 327011 transitions. [2024-11-08 15:52:10,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:52:10,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-11-08 15:52:10,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:10,674 INFO L225 Difference]: With dead ends: 198225 [2024-11-08 15:52:10,674 INFO L226 Difference]: Without dead ends: 167111 [2024-11-08 15:52:10,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-08 15:52:10,769 INFO L432 NwaCegarLoop]: 3517 mSDtfsCounter, 10966 mSDsluCounter, 10451 mSDsCounter, 0 mSdLazyCounter, 854 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10966 SdHoareTripleChecker+Valid, 13968 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:10,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10966 Valid, 13968 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 854 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 15:52:10,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167111 states. [2024-11-08 15:52:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167111 to 61336. [2024-11-08 15:52:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61336 states, 61334 states have (on average 1.6298627188834904) internal successors, (99966), 61335 states have internal predecessors, (99966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61336 states to 61336 states and 99966 transitions. [2024-11-08 15:52:12,790 INFO L78 Accepts]: Start accepts. Automaton has 61336 states and 99966 transitions. Word has length 223 [2024-11-08 15:52:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:12,791 INFO L471 AbstractCegarLoop]: Abstraction has 61336 states and 99966 transitions. [2024-11-08 15:52:12,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 61336 states and 99966 transitions. [2024-11-08 15:52:12,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-08 15:52:12,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:12,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:12,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:52:12,854 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:12,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:12,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1539236947, now seen corresponding path program 1 times [2024-11-08 15:52:12,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:12,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629377945] [2024-11-08 15:52:12,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:12,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:13,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:13,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629377945] [2024-11-08 15:52:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629377945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:13,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:13,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:13,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619656374] [2024-11-08 15:52:13,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:13,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:13,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:13,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:13,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:13,015 INFO L87 Difference]: Start difference. First operand 61336 states and 99966 transitions. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:13,946 INFO L93 Difference]: Finished difference Result 200629 states and 328993 transitions. [2024-11-08 15:52:13,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:13,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2024-11-08 15:52:13,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:14,132 INFO L225 Difference]: With dead ends: 200629 [2024-11-08 15:52:14,132 INFO L226 Difference]: Without dead ends: 139567 [2024-11-08 15:52:14,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:52:14,171 INFO L432 NwaCegarLoop]: 1755 mSDtfsCounter, 4165 mSDsluCounter, 4052 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4165 SdHoareTripleChecker+Valid, 5807 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:14,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4165 Valid, 5807 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:52:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139567 states. [2024-11-08 15:52:15,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139567 to 100928. [2024-11-08 15:52:15,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100928 states, 100926 states have (on average 1.6307888948338387) internal successors, (164589), 100927 states have internal predecessors, (164589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:15,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100928 states to 100928 states and 164589 transitions. [2024-11-08 15:52:15,990 INFO L78 Accepts]: Start accepts. Automaton has 100928 states and 164589 transitions. Word has length 225 [2024-11-08 15:52:15,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:15,990 INFO L471 AbstractCegarLoop]: Abstraction has 100928 states and 164589 transitions. [2024-11-08 15:52:15,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:15,990 INFO L276 IsEmpty]: Start isEmpty. Operand 100928 states and 164589 transitions. [2024-11-08 15:52:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-08 15:52:16,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:16,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:16,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 15:52:16,068 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:16,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:16,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2146001833, now seen corresponding path program 1 times [2024-11-08 15:52:16,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:16,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28616402] [2024-11-08 15:52:16,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:16,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:16,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:16,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28616402] [2024-11-08 15:52:16,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28616402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:16,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:16,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:16,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528220030] [2024-11-08 15:52:16,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:16,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:16,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:16,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:16,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:16,228 INFO L87 Difference]: Start difference. First operand 100928 states and 164589 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:18,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:18,017 INFO L93 Difference]: Finished difference Result 326563 states and 533826 transitions. [2024-11-08 15:52:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-11-08 15:52:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:18,378 INFO L225 Difference]: With dead ends: 326563 [2024-11-08 15:52:18,378 INFO L226 Difference]: Without dead ends: 225909 [2024-11-08 15:52:18,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:52:18,456 INFO L432 NwaCegarLoop]: 1754 mSDtfsCounter, 4114 mSDsluCounter, 4070 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4114 SdHoareTripleChecker+Valid, 5824 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:18,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4114 Valid, 5824 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:52:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225909 states. [2024-11-08 15:52:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225909 to 164024. [2024-11-08 15:52:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164024 states, 164022 states have (on average 1.6255014571216055) internal successors, (266618), 164023 states have internal predecessors, (266618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:21,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164024 states to 164024 states and 266618 transitions. [2024-11-08 15:52:21,357 INFO L78 Accepts]: Start accepts. Automaton has 164024 states and 266618 transitions. Word has length 226 [2024-11-08 15:52:21,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:21,357 INFO L471 AbstractCegarLoop]: Abstraction has 164024 states and 266618 transitions. [2024-11-08 15:52:21,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 164024 states and 266618 transitions. [2024-11-08 15:52:21,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 15:52:21,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:21,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:21,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:52:21,501 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:21,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:21,501 INFO L85 PathProgramCache]: Analyzing trace with hash 989961350, now seen corresponding path program 1 times [2024-11-08 15:52:21,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:21,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258262582] [2024-11-08 15:52:21,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:21,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:21,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:21,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258262582] [2024-11-08 15:52:21,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258262582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:21,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:21,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:21,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212425649] [2024-11-08 15:52:21,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:21,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:21,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:21,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:21,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:21,652 INFO L87 Difference]: Start difference. First operand 164024 states and 266618 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:23,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:23,730 INFO L93 Difference]: Finished difference Result 526603 states and 858078 transitions. [2024-11-08 15:52:23,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:23,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-08 15:52:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:24,328 INFO L225 Difference]: With dead ends: 526603 [2024-11-08 15:52:24,328 INFO L226 Difference]: Without dead ends: 362853 [2024-11-08 15:52:24,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:52:24,495 INFO L432 NwaCegarLoop]: 2672 mSDtfsCounter, 4063 mSDsluCounter, 3864 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4063 SdHoareTripleChecker+Valid, 6536 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:24,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4063 Valid, 6536 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 15:52:25,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362853 states. [2024-11-08 15:52:29,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362853 to 263990. [2024-11-08 15:52:30,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263990 states, 263988 states have (on average 1.6201797051381124) internal successors, (427708), 263989 states have internal predecessors, (427708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:30,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263990 states to 263990 states and 427708 transitions. [2024-11-08 15:52:30,531 INFO L78 Accepts]: Start accepts. Automaton has 263990 states and 427708 transitions. Word has length 227 [2024-11-08 15:52:30,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:30,531 INFO L471 AbstractCegarLoop]: Abstraction has 263990 states and 427708 transitions. [2024-11-08 15:52:30,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:30,531 INFO L276 IsEmpty]: Start isEmpty. Operand 263990 states and 427708 transitions. [2024-11-08 15:52:30,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 15:52:30,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:30,721 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:30,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:52:30,721 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:30,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:30,722 INFO L85 PathProgramCache]: Analyzing trace with hash -108589616, now seen corresponding path program 1 times [2024-11-08 15:52:30,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:30,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228284667] [2024-11-08 15:52:30,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:30,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:31,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:31,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:31,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228284667] [2024-11-08 15:52:31,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228284667] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:31,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:31,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 15:52:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668482784] [2024-11-08 15:52:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:31,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 15:52:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:31,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 15:52:31,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 15:52:31,584 INFO L87 Difference]: Start difference. First operand 263990 states and 427708 transitions. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:34,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:52:34,831 INFO L93 Difference]: Finished difference Result 835862 states and 1357536 transitions. [2024-11-08 15:52:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 15:52:34,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 228 [2024-11-08 15:52:34,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:52:35,855 INFO L225 Difference]: With dead ends: 835862 [2024-11-08 15:52:35,855 INFO L226 Difference]: Without dead ends: 572146 [2024-11-08 15:52:36,781 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 15:52:36,781 INFO L432 NwaCegarLoop]: 1753 mSDtfsCounter, 4012 mSDsluCounter, 3792 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4012 SdHoareTripleChecker+Valid, 5545 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:52:36,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4012 Valid, 5545 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 15:52:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572146 states. [2024-11-08 15:52:45,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572146 to 417856. [2024-11-08 15:52:45,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417856 states, 417854 states have (on average 1.6147841111967338) internal successors, (674744), 417855 states have internal predecessors, (674744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417856 states to 417856 states and 674744 transitions. [2024-11-08 15:52:46,843 INFO L78 Accepts]: Start accepts. Automaton has 417856 states and 674744 transitions. Word has length 228 [2024-11-08 15:52:46,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:52:46,844 INFO L471 AbstractCegarLoop]: Abstraction has 417856 states and 674744 transitions. [2024-11-08 15:52:46,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 15:52:46,844 INFO L276 IsEmpty]: Start isEmpty. Operand 417856 states and 674744 transitions. [2024-11-08 15:52:47,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-08 15:52:47,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:52:47,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-08 15:52:47,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:52:47,233 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:52:47,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:52:47,233 INFO L85 PathProgramCache]: Analyzing trace with hash -192327276, now seen corresponding path program 1 times [2024-11-08 15:52:47,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:52:47,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390844203] [2024-11-08 15:52:47,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:52:47,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:52:47,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:52:48,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 15:52:48,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:52:48,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390844203] [2024-11-08 15:52:48,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390844203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:52:48,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:52:48,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 15:52:48,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204889252] [2024-11-08 15:52:48,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:52:48,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 15:52:48,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:52:48,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 15:52:48,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-08 15:52:48,383 INFO L87 Difference]: Start difference. First operand 417856 states and 674744 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)