./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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/eca-rers2012/Problem15_label07.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 496f4b0b7816aa03b8a4c1153581ca52fffcd239004f8a1c536179ce4f046e04 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 19:40:13,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 19:40:13,991 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 19:40:13,996 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 19:40:13,998 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 19:40:14,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 19:40:14,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 19:40:14,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 19:40:14,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 19:40:14,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 19:40:14,031 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 19:40:14,032 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 19:40:14,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 19:40:14,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 19:40:14,035 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 19:40:14,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 19:40:14,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 19:40:14,036 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 19:40:14,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 19:40:14,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 19:40:14,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 19:40:14,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 19:40:14,041 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 19:40:14,041 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 19:40:14,042 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 19:40:14,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 19:40:14,042 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 19:40:14,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 19:40:14,042 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 19:40:14,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 19:40:14,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 19:40:14,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 19:40:14,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:40:14,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 19:40:14,043 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 19:40:14,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 19:40:14,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 19:40:14,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 19:40:14,046 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 19:40:14,046 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 19:40:14,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 19:40:14,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 19:40:14,047 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 -> 496f4b0b7816aa03b8a4c1153581ca52fffcd239004f8a1c536179ce4f046e04 [2024-11-09 19:40:14,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 19:40:14,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 19:40:14,300 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 19:40:14,301 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 19:40:14,302 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 19:40:14,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label07.c [2024-11-09 19:40:15,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 19:40:16,088 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 19:40:16,089 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label07.c [2024-11-09 19:40:16,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56fdf843/d0833e01d3974edaba819fb08b065ffb/FLAGa743d595e [2024-11-09 19:40:16,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b56fdf843/d0833e01d3974edaba819fb08b065ffb [2024-11-09 19:40:16,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 19:40:16,304 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 19:40:16,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 19:40:16,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 19:40:16,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 19:40:16,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:40:16" (1/1) ... [2024-11-09 19:40:16,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d1ba85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:16, skipping insertion in model container [2024-11-09 19:40:16,312 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:40:16" (1/1) ... [2024-11-09 19:40:16,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 19:40:16,651 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/eca-rers2012/Problem15_label07.c[1469,1482] [2024-11-09 19:40:17,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:40:17,094 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 19:40:17,109 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/eca-rers2012/Problem15_label07.c[1469,1482] [2024-11-09 19:40:17,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 19:40:17,306 INFO L204 MainTranslator]: Completed translation [2024-11-09 19:40:17,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17 WrapperNode [2024-11-09 19:40:17,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 19:40:17,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 19:40:17,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 19:40:17,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 19:40:17,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,530 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1759 [2024-11-09 19:40:17,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 19:40:17,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 19:40:17,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 19:40:17,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 19:40:17,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,560 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,627 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-09 19:40:17,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,731 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,738 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,749 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 19:40:17,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 19:40:17,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 19:40:17,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 19:40:17,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (1/1) ... [2024-11-09 19:40:17,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 19:40:17,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:40:17,814 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-09 19:40:17,816 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-09 19:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 19:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 19:40:17,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 19:40:17,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 19:40:17,915 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 19:40:17,918 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 19:40:20,648 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1665: havoc calculate_output_#t~ret7#1; [2024-11-09 19:40:20,794 INFO L? ?]: Removed 697 outVars from TransFormulas that were not future-live. [2024-11-09 19:40:20,794 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 19:40:20,826 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 19:40:20,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 19:40:20,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:40:20 BoogieIcfgContainer [2024-11-09 19:40:20,833 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 19:40:20,835 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 19:40:20,835 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 19:40:20,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 19:40:20,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:40:16" (1/3) ... [2024-11-09 19:40:20,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a2691f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:40:20, skipping insertion in model container [2024-11-09 19:40:20,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:40:17" (2/3) ... [2024-11-09 19:40:20,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29a2691f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:40:20, skipping insertion in model container [2024-11-09 19:40:20,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 07:40:20" (3/3) ... [2024-11-09 19:40:20,842 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label07.c [2024-11-09 19:40:20,858 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 19:40:20,858 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 19:40:20,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 19:40:20,977 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;@a0b642d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 19:40:20,977 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 19:40:20,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 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-09 19:40:20,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 19:40:20,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:20,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:20,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:20,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:20,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1881198798, now seen corresponding path program 1 times [2024-11-09 19:40:21,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:21,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620235914] [2024-11-09 19:40:21,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:21,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:21,235 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-09 19:40:21,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:21,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620235914] [2024-11-09 19:40:21,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620235914] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:21,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:21,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:21,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142542053] [2024-11-09 19:40:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:21,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:21,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:21,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:21,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:21,273 INFO L87 Difference]: Start difference. First operand has 427 states, 425 states have (on average 2.3176470588235296) internal successors, (985), 426 states have internal predecessors, (985), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09 19:40:23,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:23,582 INFO L93 Difference]: Finished difference Result 1160 states and 2808 transitions. [2024-11-09 19:40:23,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:23,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 12 [2024-11-09 19:40:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:23,600 INFO L225 Difference]: With dead ends: 1160 [2024-11-09 19:40:23,600 INFO L226 Difference]: Without dead ends: 668 [2024-11-09 19:40:23,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:40:23,607 INFO L432 NwaCegarLoop]: 337 mSDtfsCounter, 543 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1440 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:23,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 388 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1440 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 19:40:23,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-09 19:40:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2024-11-09 19:40:23,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 665 states have (on average 2.177443609022556) internal successors, (1448), 665 states have internal predecessors, (1448), 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-09 19:40:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 1448 transitions. [2024-11-09 19:40:23,685 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 1448 transitions. Word has length 12 [2024-11-09 19:40:23,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:23,686 INFO L471 AbstractCegarLoop]: Abstraction has 666 states and 1448 transitions. [2024-11-09 19:40:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-09 19:40:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 1448 transitions. [2024-11-09 19:40:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-09 19:40:23,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:23,689 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:23,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 19:40:23,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:23,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash 590717004, now seen corresponding path program 1 times [2024-11-09 19:40:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:23,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65573744] [2024-11-09 19:40:23,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:23,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:24,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:24,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65573744] [2024-11-09 19:40:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65573744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:24,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719881536] [2024-11-09 19:40:24,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:24,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:24,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:24,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:24,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:24,125 INFO L87 Difference]: Start difference. First operand 666 states and 1448 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-09 19:40:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:25,871 INFO L93 Difference]: Finished difference Result 1631 states and 3482 transitions. [2024-11-09 19:40:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:25,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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 78 [2024-11-09 19:40:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:25,877 INFO L225 Difference]: With dead ends: 1631 [2024-11-09 19:40:25,877 INFO L226 Difference]: Without dead ends: 967 [2024-11-09 19:40:25,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:40:25,880 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 469 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1374 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:25,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 341 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1374 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:40:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2024-11-09 19:40:25,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2024-11-09 19:40:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 966 states have (on average 2.0817805383022776) internal successors, (2011), 966 states have internal predecessors, (2011), 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-09 19:40:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 2011 transitions. [2024-11-09 19:40:25,930 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 2011 transitions. Word has length 78 [2024-11-09 19:40:25,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:25,932 INFO L471 AbstractCegarLoop]: Abstraction has 967 states and 2011 transitions. [2024-11-09 19:40:25,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 2 states have internal predecessors, (78), 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-09 19:40:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 2011 transitions. [2024-11-09 19:40:25,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-09 19:40:25,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:25,935 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:25,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 19:40:25,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:25,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:25,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1567195297, now seen corresponding path program 1 times [2024-11-09 19:40:25,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:25,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905716246] [2024-11-09 19:40:25,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:25,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:26,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:26,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905716246] [2024-11-09 19:40:26,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905716246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:26,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:26,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:26,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080535780] [2024-11-09 19:40:26,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:26,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:26,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:26,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:26,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:26,097 INFO L87 Difference]: Start difference. First operand 967 states and 2011 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-09 19:40:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:28,077 INFO L93 Difference]: Finished difference Result 2238 states and 4819 transitions. [2024-11-09 19:40:28,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2024-11-09 19:40:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:28,085 INFO L225 Difference]: With dead ends: 2238 [2024-11-09 19:40:28,086 INFO L226 Difference]: Without dead ends: 1573 [2024-11-09 19:40:28,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:40:28,089 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 488 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:28,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 322 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 19:40:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-09 19:40:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1271. [2024-11-09 19:40:28,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 2.0338582677165356) internal successors, (2583), 1270 states have internal predecessors, (2583), 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-09 19:40:28,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 2583 transitions. [2024-11-09 19:40:28,115 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 2583 transitions. Word has length 83 [2024-11-09 19:40:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:28,116 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 2583 transitions. [2024-11-09 19:40:28,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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-09 19:40:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 2583 transitions. [2024-11-09 19:40:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-09 19:40:28,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:28,121 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:40:28,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 19:40:28,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:28,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:28,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1034489841, now seen corresponding path program 1 times [2024-11-09 19:40:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:28,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572421602] [2024-11-09 19:40:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:28,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-09 19:40:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:28,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572421602] [2024-11-09 19:40:28,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572421602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:28,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:28,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668363811] [2024-11-09 19:40:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:28,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:28,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:28,333 INFO L87 Difference]: Start difference. First operand 1271 states and 2583 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-09 19:40:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:30,052 INFO L93 Difference]: Finished difference Result 3450 states and 7116 transitions. [2024-11-09 19:40:30,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:30,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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 180 [2024-11-09 19:40:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:30,062 INFO L225 Difference]: With dead ends: 3450 [2024-11-09 19:40:30,062 INFO L226 Difference]: Without dead ends: 2181 [2024-11-09 19:40:30,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:40:30,066 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 490 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1255 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:30,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 344 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1255 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:40:30,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2024-11-09 19:40:30,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2176. [2024-11-09 19:40:30,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2176 states, 2175 states have (on average 1.9802298850574713) internal successors, (4307), 2175 states have internal predecessors, (4307), 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-09 19:40:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2176 states to 2176 states and 4307 transitions. [2024-11-09 19:40:30,117 INFO L78 Accepts]: Start accepts. Automaton has 2176 states and 4307 transitions. Word has length 180 [2024-11-09 19:40:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 2176 states and 4307 transitions. [2024-11-09 19:40:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 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-09 19:40:30,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2176 states and 4307 transitions. [2024-11-09 19:40:30,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2024-11-09 19:40:30,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:30,127 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:30,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 19:40:30,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:30,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:30,128 INFO L85 PathProgramCache]: Analyzing trace with hash -421845885, now seen corresponding path program 1 times [2024-11-09 19:40:30,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:30,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851005684] [2024-11-09 19:40:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:30,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:30,697 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-09 19:40:30,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:30,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851005684] [2024-11-09 19:40:30,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851005684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:30,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:30,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 19:40:30,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335686700] [2024-11-09 19:40:30,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:30,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:30,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:30,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:30,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:30,701 INFO L87 Difference]: Start difference. First operand 2176 states and 4307 transitions. Second operand has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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-09 19:40:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:32,520 INFO L93 Difference]: Finished difference Result 4650 states and 9156 transitions. [2024-11-09 19:40:32,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:32,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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 286 [2024-11-09 19:40:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:32,532 INFO L225 Difference]: With dead ends: 4650 [2024-11-09 19:40:32,532 INFO L226 Difference]: Without dead ends: 2476 [2024-11-09 19:40:32,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-09 19:40:32,538 INFO L432 NwaCegarLoop]: 326 mSDtfsCounter, 337 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:32,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 363 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 19:40:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2476 states. [2024-11-09 19:40:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2476 to 2476. [2024-11-09 19:40:32,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 2475 states have (on average 1.9575757575757575) internal successors, (4845), 2475 states have internal predecessors, (4845), 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-09 19:40:32,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 4845 transitions. [2024-11-09 19:40:32,589 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 4845 transitions. Word has length 286 [2024-11-09 19:40:32,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:32,591 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 4845 transitions. [2024-11-09 19:40:32,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.66666666666667) internal successors, (278), 2 states have internal predecessors, (278), 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-09 19:40:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 4845 transitions. [2024-11-09 19:40:32,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2024-11-09 19:40:32,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:32,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:32,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 19:40:32,598 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:32,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash 622989338, now seen corresponding path program 1 times [2024-11-09 19:40:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:32,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968523091] [2024-11-09 19:40:32,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:32,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:40:32,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:32,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968523091] [2024-11-09 19:40:32,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968523091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:32,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:32,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:32,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474134582] [2024-11-09 19:40:32,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:32,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:32,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:32,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:32,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:32,821 INFO L87 Difference]: Start difference. First operand 2476 states and 4845 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-09 19:40:34,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:34,542 INFO L93 Difference]: Finished difference Result 5251 states and 10505 transitions. [2024-11-09 19:40:34,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:34,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 301 [2024-11-09 19:40:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:34,557 INFO L225 Difference]: With dead ends: 5251 [2024-11-09 19:40:34,557 INFO L226 Difference]: Without dead ends: 3077 [2024-11-09 19:40:34,559 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-09 19:40:34,560 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 537 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:34,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 327 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 1372 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:40:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2024-11-09 19:40:34,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2173. [2024-11-09 19:40:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2173 states, 2172 states have (on average 1.977900552486188) internal successors, (4296), 2172 states have internal predecessors, (4296), 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-09 19:40:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2173 states to 2173 states and 4296 transitions. [2024-11-09 19:40:34,607 INFO L78 Accepts]: Start accepts. Automaton has 2173 states and 4296 transitions. Word has length 301 [2024-11-09 19:40:34,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:34,609 INFO L471 AbstractCegarLoop]: Abstraction has 2173 states and 4296 transitions. [2024-11-09 19:40:34,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-09 19:40:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 2173 states and 4296 transitions. [2024-11-09 19:40:34,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-11-09 19:40:34,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:34,614 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:34,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 19:40:34,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:34,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1723400084, now seen corresponding path program 1 times [2024-11-09 19:40:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:34,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635515475] [2024-11-09 19:40:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:34,979 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-09 19:40:34,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:34,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635515475] [2024-11-09 19:40:34,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635515475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:34,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:34,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:34,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490768447] [2024-11-09 19:40:34,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:34,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:34,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:34,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:34,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:34,981 INFO L87 Difference]: Start difference. First operand 2173 states and 4296 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-09 19:40:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:36,625 INFO L93 Difference]: Finished difference Result 5254 states and 10588 transitions. [2024-11-09 19:40:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 360 [2024-11-09 19:40:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:36,637 INFO L225 Difference]: With dead ends: 5254 [2024-11-09 19:40:36,637 INFO L226 Difference]: Without dead ends: 3383 [2024-11-09 19:40:36,640 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-09 19:40:36,641 INFO L432 NwaCegarLoop]: 834 mSDtfsCounter, 550 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1360 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 1360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:36,641 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 873 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 1360 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:40:36,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states. [2024-11-09 19:40:36,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 3083. [2024-11-09 19:40:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3083 states, 3082 states have (on average 1.9383517196625568) internal successors, (5974), 3082 states have internal predecessors, (5974), 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-09 19:40:36,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3083 states to 3083 states and 5974 transitions. [2024-11-09 19:40:36,735 INFO L78 Accepts]: Start accepts. Automaton has 3083 states and 5974 transitions. Word has length 360 [2024-11-09 19:40:36,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:36,735 INFO L471 AbstractCegarLoop]: Abstraction has 3083 states and 5974 transitions. [2024-11-09 19:40:36,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-09 19:40:36,736 INFO L276 IsEmpty]: Start isEmpty. Operand 3083 states and 5974 transitions. [2024-11-09 19:40:36,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2024-11-09 19:40:36,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:36,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:36,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 19:40:36,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:36,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:36,741 INFO L85 PathProgramCache]: Analyzing trace with hash 358272882, now seen corresponding path program 1 times [2024-11-09 19:40:36,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:36,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291054069] [2024-11-09 19:40:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:36,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:37,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:37,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291054069] [2024-11-09 19:40:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291054069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:37,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:37,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051687566] [2024-11-09 19:40:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:37,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:37,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:37,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:37,009 INFO L87 Difference]: Start difference. First operand 3083 states and 5974 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-09 19:40:38,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:38,749 INFO L93 Difference]: Finished difference Result 7075 states and 13950 transitions. [2024-11-09 19:40:38,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:38,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 365 [2024-11-09 19:40:38,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:38,766 INFO L225 Difference]: With dead ends: 7075 [2024-11-09 19:40:38,767 INFO L226 Difference]: Without dead ends: 4294 [2024-11-09 19:40:38,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-09 19:40:38,771 INFO L432 NwaCegarLoop]: 800 mSDtfsCounter, 479 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:38,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 841 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 19:40:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4294 states. [2024-11-09 19:40:38,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4294 to 3991. [2024-11-09 19:40:38,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3991 states, 3990 states have (on average 1.9210526315789473) internal successors, (7665), 3990 states have internal predecessors, (7665), 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-09 19:40:38,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3991 states to 3991 states and 7665 transitions. [2024-11-09 19:40:38,843 INFO L78 Accepts]: Start accepts. Automaton has 3991 states and 7665 transitions. Word has length 365 [2024-11-09 19:40:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:38,844 INFO L471 AbstractCegarLoop]: Abstraction has 3991 states and 7665 transitions. [2024-11-09 19:40:38,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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-09 19:40:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 3991 states and 7665 transitions. [2024-11-09 19:40:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2024-11-09 19:40:38,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:38,850 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:38,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 19:40:38,850 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:38,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:38,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1936331135, now seen corresponding path program 1 times [2024-11-09 19:40:38,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:38,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831866313] [2024-11-09 19:40:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:38,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:38,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-09 19:40:39,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:39,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831866313] [2024-11-09 19:40:39,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831866313] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:39,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:39,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:39,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583007677] [2024-11-09 19:40:39,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:39,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:39,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:39,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:39,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:39,121 INFO L87 Difference]: Start difference. First operand 3991 states and 7665 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-09 19:40:41,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:41,299 INFO L93 Difference]: Finished difference Result 8881 states and 17320 transitions. [2024-11-09 19:40:41,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 384 [2024-11-09 19:40:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:41,322 INFO L225 Difference]: With dead ends: 8881 [2024-11-09 19:40:41,322 INFO L226 Difference]: Without dead ends: 5192 [2024-11-09 19:40:41,326 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-09 19:40:41,327 INFO L432 NwaCegarLoop]: 813 mSDtfsCounter, 481 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1344 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 1344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:41,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 852 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 1344 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-09 19:40:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5192 states. [2024-11-09 19:40:41,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5192 to 5189. [2024-11-09 19:40:41,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5189 states, 5188 states have (on average 1.9080570547417117) internal successors, (9899), 5188 states have internal predecessors, (9899), 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-09 19:40:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 9899 transitions. [2024-11-09 19:40:41,429 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 9899 transitions. Word has length 384 [2024-11-09 19:40:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:41,430 INFO L471 AbstractCegarLoop]: Abstraction has 5189 states and 9899 transitions. [2024-11-09 19:40:41,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-09 19:40:41,431 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 9899 transitions. [2024-11-09 19:40:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2024-11-09 19:40:41,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:41,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:41,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 19:40:41,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:41,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:41,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1872767102, now seen corresponding path program 1 times [2024-11-09 19:40:41,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:41,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540990180] [2024-11-09 19:40:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:42,122 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 9 proven. 115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:40:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540990180] [2024-11-09 19:40:42,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540990180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:40:42,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602290547] [2024-11-09 19:40:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:42,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:40:42,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:40:42,125 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:40:42,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 19:40:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:42,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:40:42,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:40:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:40:51,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:40:51,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602290547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:51,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:40:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:40:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765262380] [2024-11-09 19:40:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:51,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:51,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:51,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:40:51,648 INFO L87 Difference]: Start difference. First operand 5189 states and 9899 transitions. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-09 19:40:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:53,269 INFO L93 Difference]: Finished difference Result 13082 states and 25156 transitions. [2024-11-09 19:40:53,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:53,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 391 [2024-11-09 19:40:53,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:53,285 INFO L225 Difference]: With dead ends: 13082 [2024-11-09 19:40:53,285 INFO L226 Difference]: Without dead ends: 8195 [2024-11-09 19:40:53,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 390 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:40:53,289 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 604 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:53,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [604 Valid, 183 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:40:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8195 states. [2024-11-09 19:40:53,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8195 to 6693. [2024-11-09 19:40:53,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6693 states, 6692 states have (on average 1.9293185893604303) internal successors, (12911), 6692 states have internal predecessors, (12911), 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-09 19:40:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6693 states to 6693 states and 12911 transitions. [2024-11-09 19:40:53,388 INFO L78 Accepts]: Start accepts. Automaton has 6693 states and 12911 transitions. Word has length 391 [2024-11-09 19:40:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:53,389 INFO L471 AbstractCegarLoop]: Abstraction has 6693 states and 12911 transitions. [2024-11-09 19:40:53,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-09 19:40:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 6693 states and 12911 transitions. [2024-11-09 19:40:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2024-11-09 19:40:53,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:53,393 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:53,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 19:40:53,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 19:40:53,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:53,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:53,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1774994936, now seen corresponding path program 1 times [2024-11-09 19:40:53,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:53,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774826724] [2024-11-09 19:40:53,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:53,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-09 19:40:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:54,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774826724] [2024-11-09 19:40:54,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774826724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:54,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:54,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:54,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564517759] [2024-11-09 19:40:54,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:54,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:54,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:54,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:54,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:54,107 INFO L87 Difference]: Start difference. First operand 6693 states and 12911 transitions. Second operand has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-09 19:40:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:55,736 INFO L93 Difference]: Finished difference Result 18800 states and 36456 transitions. [2024-11-09 19:40:55,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:55,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 504 [2024-11-09 19:40:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:55,763 INFO L225 Difference]: With dead ends: 18800 [2024-11-09 19:40:55,763 INFO L226 Difference]: Without dead ends: 12409 [2024-11-09 19:40:55,771 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-09 19:40:55,772 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 478 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1503 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:55,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 857 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1503 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 19:40:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12409 states. [2024-11-09 19:40:55,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12409 to 11796. [2024-11-09 19:40:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11796 states, 11795 states have (on average 1.9074183976261128) internal successors, (22498), 11795 states have internal predecessors, (22498), 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-09 19:40:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11796 states to 11796 states and 22498 transitions. [2024-11-09 19:40:55,931 INFO L78 Accepts]: Start accepts. Automaton has 11796 states and 22498 transitions. Word has length 504 [2024-11-09 19:40:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:55,932 INFO L471 AbstractCegarLoop]: Abstraction has 11796 states and 22498 transitions. [2024-11-09 19:40:55,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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-09 19:40:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 11796 states and 22498 transitions. [2024-11-09 19:40:55,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2024-11-09 19:40:55,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:55,938 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:55,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 19:40:55,938 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:55,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:55,939 INFO L85 PathProgramCache]: Analyzing trace with hash -238941400, now seen corresponding path program 1 times [2024-11-09 19:40:55,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:55,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684064359] [2024-11-09 19:40:55,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:55,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2024-11-09 19:40:56,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:56,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684064359] [2024-11-09 19:40:56,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684064359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:56,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:56,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:56,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536955405] [2024-11-09 19:40:56,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:56,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:56,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:56,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:56,368 INFO L87 Difference]: Start difference. First operand 11796 states and 22498 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-09 19:40:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:57,982 INFO L93 Difference]: Finished difference Result 23587 states and 45027 transitions. [2024-11-09 19:40:57,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:57,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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 516 [2024-11-09 19:40:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:58,007 INFO L225 Difference]: With dead ends: 23587 [2024-11-09 19:40:58,007 INFO L226 Difference]: Without dead ends: 12093 [2024-11-09 19:40:58,020 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-09 19:40:58,021 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 699 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 699 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:58,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [699 Valid, 74 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:40:58,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12093 states. [2024-11-09 19:40:58,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12093 to 11792. [2024-11-09 19:40:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11792 states, 11791 states have (on average 1.9074718005258249) internal successors, (22491), 11791 states have internal predecessors, (22491), 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-09 19:40:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11792 states to 11792 states and 22491 transitions. [2024-11-09 19:40:58,211 INFO L78 Accepts]: Start accepts. Automaton has 11792 states and 22491 transitions. Word has length 516 [2024-11-09 19:40:58,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:40:58,212 INFO L471 AbstractCegarLoop]: Abstraction has 11792 states and 22491 transitions. [2024-11-09 19:40:58,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 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-09 19:40:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11792 states and 22491 transitions. [2024-11-09 19:40:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2024-11-09 19:40:58,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:40:58,218 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:40:58,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 19:40:58,218 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:40:58,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:40:58,219 INFO L85 PathProgramCache]: Analyzing trace with hash -182430651, now seen corresponding path program 1 times [2024-11-09 19:40:58,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:40:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616955458] [2024-11-09 19:40:58,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:40:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:40:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:40:58,501 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-09 19:40:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:40:58,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616955458] [2024-11-09 19:40:58,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616955458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:40:58,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:40:58,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:40:58,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681594708] [2024-11-09 19:40:58,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:40:58,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:40:58,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:40:58,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:40:58,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:40:58,504 INFO L87 Difference]: Start difference. First operand 11792 states and 22491 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-09 19:40:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:40:59,928 INFO L93 Difference]: Finished difference Result 24782 states and 47313 transitions. [2024-11-09 19:40:59,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:40:59,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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 537 [2024-11-09 19:40:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:40:59,945 INFO L225 Difference]: With dead ends: 24782 [2024-11-09 19:40:59,945 INFO L226 Difference]: Without dead ends: 13292 [2024-11-09 19:40:59,954 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-09 19:40:59,955 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 499 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 1447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:40:59,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 333 Invalid, 1447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:40:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13292 states. [2024-11-09 19:41:00,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13292 to 9689. [2024-11-09 19:41:00,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9689 states, 9688 states have (on average 1.921242774566474) internal successors, (18613), 9688 states have internal predecessors, (18613), 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-09 19:41:00,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9689 states to 9689 states and 18613 transitions. [2024-11-09 19:41:00,160 INFO L78 Accepts]: Start accepts. Automaton has 9689 states and 18613 transitions. Word has length 537 [2024-11-09 19:41:00,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:00,160 INFO L471 AbstractCegarLoop]: Abstraction has 9689 states and 18613 transitions. [2024-11-09 19:41:00,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-09 19:41:00,161 INFO L276 IsEmpty]: Start isEmpty. Operand 9689 states and 18613 transitions. [2024-11-09 19:41:00,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2024-11-09 19:41:00,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:00,168 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:41:00,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 19:41:00,168 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:00,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:00,169 INFO L85 PathProgramCache]: Analyzing trace with hash -873745728, now seen corresponding path program 1 times [2024-11-09 19:41:00,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:00,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563158862] [2024-11-09 19:41:00,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 490 proven. 39 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-11-09 19:41:00,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563158862] [2024-11-09 19:41:00,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563158862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:41:00,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860832167] [2024-11-09 19:41:00,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:00,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:41:00,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:41:00,782 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:41:00,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 19:41:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:00,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 671 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 19:41:01,001 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:41:01,035 INFO L134 CoverageAnalysis]: Checked inductivity of 665 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-09 19:41:01,035 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 19:41:01,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860832167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:01,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 19:41:01,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-09 19:41:01,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003302022] [2024-11-09 19:41:01,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:01,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:01,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:01,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:41:01,038 INFO L87 Difference]: Start difference. First operand 9689 states and 18613 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-09 19:41:02,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:02,481 INFO L93 Difference]: Finished difference Result 21475 states and 41567 transitions. [2024-11-09 19:41:02,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:02,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 544 [2024-11-09 19:41:02,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:02,495 INFO L225 Difference]: With dead ends: 21475 [2024-11-09 19:41:02,496 INFO L226 Difference]: Without dead ends: 12088 [2024-11-09 19:41:02,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 19:41:02,502 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 635 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:02,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 682 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 19:41:02,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12088 states. [2024-11-09 19:41:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12088 to 12088. [2024-11-09 19:41:02,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12088 states, 12087 states have (on average 1.9151981467692563) internal successors, (23149), 12087 states have internal predecessors, (23149), 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-09 19:41:02,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12088 states to 12088 states and 23149 transitions. [2024-11-09 19:41:02,658 INFO L78 Accepts]: Start accepts. Automaton has 12088 states and 23149 transitions. Word has length 544 [2024-11-09 19:41:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:02,659 INFO L471 AbstractCegarLoop]: Abstraction has 12088 states and 23149 transitions. [2024-11-09 19:41:02,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-09 19:41:02,659 INFO L276 IsEmpty]: Start isEmpty. Operand 12088 states and 23149 transitions. [2024-11-09 19:41:02,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2024-11-09 19:41:02,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:02,666 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:41:02,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 19:41:02,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-09 19:41:02,867 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:02,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:02,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1260310613, now seen corresponding path program 1 times [2024-11-09 19:41:02,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:02,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638010355] [2024-11-09 19:41:02,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:02,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 426 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-09 19:41:03,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:03,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638010355] [2024-11-09 19:41:03,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638010355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:03,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:03,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 19:41:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383730356] [2024-11-09 19:41:03,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:03,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 19:41:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 19:41:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 19:41:03,365 INFO L87 Difference]: Start difference. First operand 12088 states and 23149 transitions. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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-09 19:41:04,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:04,938 INFO L93 Difference]: Finished difference Result 31684 states and 60752 transitions. [2024-11-09 19:41:04,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 19:41:04,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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 577 [2024-11-09 19:41:04,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:04,958 INFO L225 Difference]: With dead ends: 31684 [2024-11-09 19:41:04,958 INFO L226 Difference]: Without dead ends: 17198 [2024-11-09 19:41:05,040 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-09 19:41:05,041 INFO L432 NwaCegarLoop]: 727 mSDtfsCounter, 412 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1313 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 1313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:05,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 759 Invalid, 1621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 1313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 19:41:05,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17198 states. [2024-11-09 19:41:05,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17198 to 15997. [2024-11-09 19:41:05,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15997 states, 15996 states have (on average 1.857776944236059) internal successors, (29717), 15996 states have internal predecessors, (29717), 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-09 19:41:05,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15997 states to 15997 states and 29717 transitions. [2024-11-09 19:41:05,207 INFO L78 Accepts]: Start accepts. Automaton has 15997 states and 29717 transitions. Word has length 577 [2024-11-09 19:41:05,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:05,208 INFO L471 AbstractCegarLoop]: Abstraction has 15997 states and 29717 transitions. [2024-11-09 19:41:05,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 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-09 19:41:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand 15997 states and 29717 transitions. [2024-11-09 19:41:05,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2024-11-09 19:41:05,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:05,216 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 19:41:05,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 19:41:05,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:05,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:05,217 INFO L85 PathProgramCache]: Analyzing trace with hash -13400319, now seen corresponding path program 1 times [2024-11-09 19:41:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032903461] [2024-11-09 19:41:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:05,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 104 proven. 407 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:07,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032903461] [2024-11-09 19:41:07,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032903461] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 19:41:07,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034226571] [2024-11-09 19:41:07,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:07,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:41:07,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 19:41:07,207 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 19:41:07,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 19:41:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:07,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 19:41:07,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 19:41:09,472 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 403 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:09,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 19:41:11,587 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 403 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 19:41:11,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034226571] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 19:41:11,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 19:41:11,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 19:41:11,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066688017] [2024-11-09 19:41:11,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 19:41:11,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 19:41:11,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:11,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 19:41:11,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-09 19:41:11,591 INFO L87 Difference]: Start difference. First operand 15997 states and 29717 transitions. Second operand has 11 states, 11 states have (on average 121.0909090909091) internal successors, (1332), 11 states have internal predecessors, (1332), 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-09 19:41:26,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 19:41:26,098 INFO L93 Difference]: Finished difference Result 62112 states and 114259 transitions. [2024-11-09 19:41:26,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-09 19:41:26,099 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 121.0909090909091) internal successors, (1332), 11 states have internal predecessors, (1332), 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 687 [2024-11-09 19:41:26,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 19:41:26,151 INFO L225 Difference]: With dead ends: 62112 [2024-11-09 19:41:26,151 INFO L226 Difference]: Without dead ends: 44073 [2024-11-09 19:41:26,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1451 GetRequests, 1397 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=520, Invalid=2560, Unknown=0, NotChecked=0, Total=3080 [2024-11-09 19:41:26,165 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 14972 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 22093 mSolverCounterSat, 2807 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14972 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 24900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2807 IncrementalHoareTripleChecker+Valid, 22093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2024-11-09 19:41:26,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14972 Valid, 584 Invalid, 24900 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2807 Valid, 22093 Invalid, 0 Unknown, 0 Unchecked, 13.2s Time] [2024-11-09 19:41:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44073 states. [2024-11-09 19:41:26,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44073 to 21404. [2024-11-09 19:41:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21404 states, 21403 states have (on average 1.834649348222212) internal successors, (39267), 21403 states have internal predecessors, (39267), 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-09 19:41:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21404 states to 21404 states and 39267 transitions. [2024-11-09 19:41:26,623 INFO L78 Accepts]: Start accepts. Automaton has 21404 states and 39267 transitions. Word has length 687 [2024-11-09 19:41:26,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 19:41:26,624 INFO L471 AbstractCegarLoop]: Abstraction has 21404 states and 39267 transitions. [2024-11-09 19:41:26,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 121.0909090909091) internal successors, (1332), 11 states have internal predecessors, (1332), 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-09 19:41:26,625 INFO L276 IsEmpty]: Start isEmpty. Operand 21404 states and 39267 transitions. [2024-11-09 19:41:26,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 716 [2024-11-09 19:41:26,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 19:41:26,641 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 19:41:26,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 19:41:26,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 19:41:26,846 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 19:41:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 19:41:26,847 INFO L85 PathProgramCache]: Analyzing trace with hash -548579677, now seen corresponding path program 1 times [2024-11-09 19:41:26,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 19:41:26,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876431416] [2024-11-09 19:41:26,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 19:41:26,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 19:41:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 19:41:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 759 backedges. 417 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-09 19:41:27,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 19:41:27,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876431416] [2024-11-09 19:41:27,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876431416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 19:41:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 19:41:27,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 19:41:27,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53486645] [2024-11-09 19:41:27,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 19:41:27,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 19:41:27,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 19:41:27,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 19:41:27,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 19:41:27,453 INFO L87 Difference]: Start difference. First operand 21404 states and 39267 transitions. Second operand has 4 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 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)