./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 c56a954c6b6423eb9dc896d65464ae85499e68477be4edbb5172c2d6eb981204 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:38:55,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:38:55,597 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:38:55,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:38:55,601 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:38:55,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:38:55,638 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:38:55,638 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:38:55,639 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:38:55,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:38:55,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:38:55,644 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:38:55,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:38:55,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:38:55,645 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:38:55,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:38:55,646 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:38:55,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:38:55,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:38:55,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:38:55,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:38:55,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:38:55,648 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:38:55,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:38:55,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:38:55,649 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:38:55,649 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:38:55,649 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:38:55,650 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:38:55,650 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:38:55,650 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:38:55,650 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:38:55,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:38:55,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:38:55,651 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:38:55,651 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:38:55,651 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:38:55,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:38:55,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:38:55,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:38:55,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:38:55,654 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:38:55,654 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-clean/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-clean/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 -> c56a954c6b6423eb9dc896d65464ae85499e68477be4edbb5172c2d6eb981204 [2024-10-10 22:38:55,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:38:55,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:38:55,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:38:55,938 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:38:55,941 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:38:55,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c [2024-10-10 22:38:57,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:38:57,764 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:38:57,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c [2024-10-10 22:38:57,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce60ca2be/826a9328ec724becbe5f4560233d2cf8/FLAG19b787725 [2024-10-10 22:38:58,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ce60ca2be/826a9328ec724becbe5f4560233d2cf8 [2024-10-10 22:38:58,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:38:58,014 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:38:58,015 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:38:58,016 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:38:58,021 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:38:58,022 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:58,023 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7c3a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58, skipping insertion in model container [2024-10-10 22:38:58,023 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:58,098 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:38:58,608 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c[60825,60838] [2024-10-10 22:38:58,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:38:58,648 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:38:58,829 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label47.c[60825,60838] [2024-10-10 22:38:58,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:38:58,862 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:38:58,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58 WrapperNode [2024-10-10 22:38:58,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:38:58,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:38:58,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:38:58,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:38:58,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:58,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,069 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-10-10 22:38:59,070 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:38:59,070 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:38:59,071 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:38:59,071 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:38:59,082 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,093 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,134 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:38:59,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,187 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,203 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:38:59,246 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:38:59,246 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:38:59,246 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:38:59,247 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (1/1) ... [2024-10-10 22:38:59,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:38:59,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:38:59,280 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:38:59,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:38:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:38:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:38:59,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:38:59,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:38:59,429 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:38:59,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:39:01,246 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-10-10 22:39:01,249 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:39:01,320 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:39:01,323 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:39:01,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:39:01 BoogieIcfgContainer [2024-10-10 22:39:01,324 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:39:01,326 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:39:01,326 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:39:01,329 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:39:01,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:38:58" (1/3) ... [2024-10-10 22:39:01,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4552b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:39:01, skipping insertion in model container [2024-10-10 22:39:01,331 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:38:58" (2/3) ... [2024-10-10 22:39:01,331 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4552b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:39:01, skipping insertion in model container [2024-10-10 22:39:01,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:39:01" (3/3) ... [2024-10-10 22:39:01,334 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label47.c [2024-10-10 22:39:01,353 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:39:01,354 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:39:01,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:39:01,430 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;@613bb9df, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:39:01,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:39:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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-10-10 22:39:01,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-10 22:39:01,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:01,452 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:39:01,453 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:01,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash 989673365, now seen corresponding path program 1 times [2024-10-10 22:39:01,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:01,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932075795] [2024-10-10 22:39:01,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:01,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932075795] [2024-10-10 22:39:02,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932075795] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:02,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:02,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930735848] [2024-10-10 22:39:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:02,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 22:39:02,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:02,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 22:39:02,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:39:02,099 INFO L87 Difference]: Start difference. First operand has 240 states, 238 states have (on average 1.9201680672268908) internal successors, (457), 239 states have internal predecessors, (457), 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 2 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:02,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:02,147 INFO L93 Difference]: Finished difference Result 479 states and 913 transitions. [2024-10-10 22:39:02,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 22:39:02,150 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-10-10 22:39:02,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:02,160 INFO L225 Difference]: With dead ends: 479 [2024-10-10 22:39:02,160 INFO L226 Difference]: Without dead ends: 238 [2024-10-10 22:39:02,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 22:39:02,168 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:02,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 392 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 22:39:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-10 22:39:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-10-10 22:39:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 237 states have (on average 1.6540084388185654) internal successors, (392), 237 states have internal predecessors, (392), 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-10-10 22:39:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 392 transitions. [2024-10-10 22:39:02,220 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 392 transitions. Word has length 196 [2024-10-10 22:39:02,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:02,222 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 392 transitions. [2024-10-10 22:39:02,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 98.0) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:02,222 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 392 transitions. [2024-10-10 22:39:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-10 22:39:02,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:02,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:39:02,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:39:02,229 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:02,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:02,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1113992718, now seen corresponding path program 1 times [2024-10-10 22:39:02,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:02,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843714914] [2024-10-10 22:39:02,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:02,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:02,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:02,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843714914] [2024-10-10 22:39:02,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843714914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:02,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:02,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:02,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724332077] [2024-10-10 22:39:02,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:02,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:02,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:02,978 INFO L87 Difference]: Start difference. First operand 238 states and 392 transitions. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:04,018 INFO L93 Difference]: Finished difference Result 692 states and 1147 transitions. [2024-10-10 22:39:04,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:04,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-10-10 22:39:04,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:04,024 INFO L225 Difference]: With dead ends: 692 [2024-10-10 22:39:04,024 INFO L226 Difference]: Without dead ends: 455 [2024-10-10 22:39:04,025 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-10-10 22:39:04,026 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 59 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:04,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 122 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 22:39:04,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-10-10 22:39:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 450. [2024-10-10 22:39:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 449 states have (on average 1.5634743875278396) internal successors, (702), 449 states have internal predecessors, (702), 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-10-10 22:39:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 702 transitions. [2024-10-10 22:39:04,061 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 702 transitions. Word has length 196 [2024-10-10 22:39:04,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:04,062 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 702 transitions. [2024-10-10 22:39:04,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 2 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 702 transitions. [2024-10-10 22:39:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-10-10 22:39:04,070 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:04,070 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:39:04,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:39:04,071 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:04,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:04,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1149030656, now seen corresponding path program 1 times [2024-10-10 22:39:04,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:04,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252661473] [2024-10-10 22:39:04,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:04,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:04,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:04,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252661473] [2024-10-10 22:39:04,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252661473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:04,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399422766] [2024-10-10 22:39:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:04,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:04,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:04,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:04,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:04,511 INFO L87 Difference]: Start difference. First operand 450 states and 702 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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-10-10 22:39:05,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:05,288 INFO L93 Difference]: Finished difference Result 1339 states and 2093 transitions. [2024-10-10 22:39:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:05,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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 202 [2024-10-10 22:39:05,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:05,293 INFO L225 Difference]: With dead ends: 1339 [2024-10-10 22:39:05,293 INFO L226 Difference]: Without dead ends: 890 [2024-10-10 22:39:05,295 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-10-10 22:39:05,296 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 285 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 704 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:05,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 152 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 704 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:39:05,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2024-10-10 22:39:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 886. [2024-10-10 22:39:05,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 1.5480225988700564) internal successors, (1370), 885 states have internal predecessors, (1370), 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-10-10 22:39:05,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1370 transitions. [2024-10-10 22:39:05,334 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1370 transitions. Word has length 202 [2024-10-10 22:39:05,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:05,335 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1370 transitions. [2024-10-10 22:39:05,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 2 states have internal predecessors, (202), 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-10-10 22:39:05,335 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1370 transitions. [2024-10-10 22:39:05,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-10 22:39:05,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:05,339 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:39:05,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:39:05,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:05,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1804480692, now seen corresponding path program 1 times [2024-10-10 22:39:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229380707] [2024-10-10 22:39:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:05,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:05,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:05,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229380707] [2024-10-10 22:39:05,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229380707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:05,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:05,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:05,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765075712] [2024-10-10 22:39:05,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:05,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:05,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:05,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:05,724 INFO L87 Difference]: Start difference. First operand 886 states and 1370 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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-10-10 22:39:06,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:06,575 INFO L93 Difference]: Finished difference Result 2611 states and 4041 transitions. [2024-10-10 22:39:06,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:06,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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 206 [2024-10-10 22:39:06,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:06,583 INFO L225 Difference]: With dead ends: 2611 [2024-10-10 22:39:06,583 INFO L226 Difference]: Without dead ends: 1726 [2024-10-10 22:39:06,585 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-10-10 22:39:06,588 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 236 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:06,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 110 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:39:06,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2024-10-10 22:39:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1724. [2024-10-10 22:39:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 1.4730121880441092) internal successors, (2538), 1723 states have internal predecessors, (2538), 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-10-10 22:39:06,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2538 transitions. [2024-10-10 22:39:06,632 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2538 transitions. Word has length 206 [2024-10-10 22:39:06,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:06,632 INFO L471 AbstractCegarLoop]: Abstraction has 1724 states and 2538 transitions. [2024-10-10 22:39:06,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 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-10-10 22:39:06,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2538 transitions. [2024-10-10 22:39:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-10 22:39:06,637 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:06,637 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:39:06,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 22:39:06,638 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:06,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1760278308, now seen corresponding path program 1 times [2024-10-10 22:39:06,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:06,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109915553] [2024-10-10 22:39:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:06,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:39:06,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:06,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109915553] [2024-10-10 22:39:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109915553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:06,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:06,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:06,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776610937] [2024-10-10 22:39:06,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:06,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:06,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:06,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:06,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:06,871 INFO L87 Difference]: Start difference. First operand 1724 states and 2538 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-10-10 22:39:07,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:07,698 INFO L93 Difference]: Finished difference Result 5077 states and 7480 transitions. [2024-10-10 22:39:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:07,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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 208 [2024-10-10 22:39:07,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:07,710 INFO L225 Difference]: With dead ends: 5077 [2024-10-10 22:39:07,711 INFO L226 Difference]: Without dead ends: 3354 [2024-10-10 22:39:07,714 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-10-10 22:39:07,715 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 241 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:07,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 164 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:39:07,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3354 states. [2024-10-10 22:39:07,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3354 to 3351. [2024-10-10 22:39:07,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3351 states, 3350 states have (on average 1.335223880597015) internal successors, (4473), 3350 states have internal predecessors, (4473), 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-10-10 22:39:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3351 states to 3351 states and 4473 transitions. [2024-10-10 22:39:07,784 INFO L78 Accepts]: Start accepts. Automaton has 3351 states and 4473 transitions. Word has length 208 [2024-10-10 22:39:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:07,784 INFO L471 AbstractCegarLoop]: Abstraction has 3351 states and 4473 transitions. [2024-10-10 22:39:07,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 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-10-10 22:39:07,785 INFO L276 IsEmpty]: Start isEmpty. Operand 3351 states and 4473 transitions. [2024-10-10 22:39:07,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-10-10 22:39:07,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:07,792 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:39:07,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:39:07,792 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:07,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:07,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1756419225, now seen corresponding path program 1 times [2024-10-10 22:39:07,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:07,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111540728] [2024-10-10 22:39:07,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:07,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111540728] [2024-10-10 22:39:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111540728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:08,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:08,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118657555] [2024-10-10 22:39:08,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:08,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:08,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:08,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:08,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:08,098 INFO L87 Difference]: Start difference. First operand 3351 states and 4473 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-10-10 22:39:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:08,927 INFO L93 Difference]: Finished difference Result 10018 states and 13380 transitions. [2024-10-10 22:39:08,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:08,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 208 [2024-10-10 22:39:08,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:08,967 INFO L225 Difference]: With dead ends: 10018 [2024-10-10 22:39:08,968 INFO L226 Difference]: Without dead ends: 6668 [2024-10-10 22:39:08,975 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-10-10 22:39:08,978 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 275 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:08,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 99 Invalid, 710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 22:39:08,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6668 states. [2024-10-10 22:39:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6668 to 6653. [2024-10-10 22:39:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6653 states, 6652 states have (on average 1.3215574263379435) internal successors, (8791), 6652 states have internal predecessors, (8791), 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-10-10 22:39:09,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6653 states to 6653 states and 8791 transitions. [2024-10-10 22:39:09,114 INFO L78 Accepts]: Start accepts. Automaton has 6653 states and 8791 transitions. Word has length 208 [2024-10-10 22:39:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:09,114 INFO L471 AbstractCegarLoop]: Abstraction has 6653 states and 8791 transitions. [2024-10-10 22:39:09,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-10-10 22:39:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 6653 states and 8791 transitions. [2024-10-10 22:39:09,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-10 22:39:09,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:09,126 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-10-10 22:39:09,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:39:09,127 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:09,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1525972413, now seen corresponding path program 1 times [2024-10-10 22:39:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739248751] [2024-10-10 22:39:09,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:09,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:09,493 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:39:09,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:09,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739248751] [2024-10-10 22:39:09,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739248751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:09,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:09,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:09,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371152758] [2024-10-10 22:39:09,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:09,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:09,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:09,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:09,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:09,495 INFO L87 Difference]: Start difference. First operand 6653 states and 8791 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-10-10 22:39:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:10,286 INFO L93 Difference]: Finished difference Result 16555 states and 21423 transitions. [2024-10-10 22:39:10,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:10,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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 213 [2024-10-10 22:39:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:10,319 INFO L225 Difference]: With dead ends: 16555 [2024-10-10 22:39:10,319 INFO L226 Difference]: Without dead ends: 9903 [2024-10-10 22:39:10,328 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-10-10 22:39:10,333 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 210 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:10,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 185 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:39:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9903 states. [2024-10-10 22:39:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9903 to 9901. [2024-10-10 22:39:10,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9901 states, 9900 states have (on average 1.2617171717171718) internal successors, (12491), 9900 states have internal predecessors, (12491), 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-10-10 22:39:10,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9901 states to 9901 states and 12491 transitions. [2024-10-10 22:39:10,500 INFO L78 Accepts]: Start accepts. Automaton has 9901 states and 12491 transitions. Word has length 213 [2024-10-10 22:39:10,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:10,501 INFO L471 AbstractCegarLoop]: Abstraction has 9901 states and 12491 transitions. [2024-10-10 22:39:10,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 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-10-10 22:39:10,502 INFO L276 IsEmpty]: Start isEmpty. Operand 9901 states and 12491 transitions. [2024-10-10 22:39:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-10 22:39:10,515 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:10,515 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2024-10-10 22:39:10,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:39:10,516 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:10,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1781006505, now seen corresponding path program 1 times [2024-10-10 22:39:10,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:10,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367924293] [2024-10-10 22:39:10,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:10,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:39:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367924293] [2024-10-10 22:39:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367924293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:10,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:39:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326018573] [2024-10-10 22:39:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:10,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:39:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:39:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:39:10,830 INFO L87 Difference]: Start difference. First operand 9901 states and 12491 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 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-10-10 22:39:12,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:12,139 INFO L93 Difference]: Finished difference Result 39241 states and 49479 transitions. [2024-10-10 22:39:12,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:39:12,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-10-10 22:39:12,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:12,209 INFO L225 Difference]: With dead ends: 39241 [2024-10-10 22:39:12,209 INFO L226 Difference]: Without dead ends: 29341 [2024-10-10 22:39:12,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:39:12,227 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 888 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 941 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:12,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 111 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 941 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 22:39:12,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29341 states. [2024-10-10 22:39:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29341 to 26076. [2024-10-10 22:39:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26076 states, 26075 states have (on average 1.2580249280920421) internal successors, (32803), 26075 states have internal predecessors, (32803), 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-10-10 22:39:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26076 states to 26076 states and 32803 transitions. [2024-10-10 22:39:12,799 INFO L78 Accepts]: Start accepts. Automaton has 26076 states and 32803 transitions. Word has length 223 [2024-10-10 22:39:12,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:12,799 INFO L471 AbstractCegarLoop]: Abstraction has 26076 states and 32803 transitions. [2024-10-10 22:39:12,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 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-10-10 22:39:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 26076 states and 32803 transitions. [2024-10-10 22:39:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-10-10 22:39:12,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:12,812 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 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-10-10 22:39:12,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 22:39:12,813 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:12,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:12,813 INFO L85 PathProgramCache]: Analyzing trace with hash 648178413, now seen corresponding path program 1 times [2024-10-10 22:39:12,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:12,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461345907] [2024-10-10 22:39:12,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:12,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:13,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:13,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461345907] [2024-10-10 22:39:13,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461345907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:13,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:13,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:13,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347704208] [2024-10-10 22:39:13,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:13,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:13,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:13,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:13,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:13,361 INFO L87 Difference]: Start difference. First operand 26076 states and 32803 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:14,238 INFO L93 Difference]: Finished difference Result 63201 states and 79769 transitions. [2024-10-10 22:39:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226 [2024-10-10 22:39:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:14,317 INFO L225 Difference]: With dead ends: 63201 [2024-10-10 22:39:14,318 INFO L226 Difference]: Without dead ends: 37126 [2024-10-10 22:39:14,351 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-10-10 22:39:14,354 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 211 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:14,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 113 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 22:39:14,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37126 states. [2024-10-10 22:39:14,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37126 to 37069. [2024-10-10 22:39:14,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37069 states, 37068 states have (on average 1.259981655336139) internal successors, (46705), 37068 states have internal predecessors, (46705), 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-10-10 22:39:15,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37069 states to 37069 states and 46705 transitions. [2024-10-10 22:39:15,122 INFO L78 Accepts]: Start accepts. Automaton has 37069 states and 46705 transitions. Word has length 226 [2024-10-10 22:39:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:15,124 INFO L471 AbstractCegarLoop]: Abstraction has 37069 states and 46705 transitions. [2024-10-10 22:39:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 37069 states and 46705 transitions. [2024-10-10 22:39:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-10 22:39:15,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:15,152 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2024-10-10 22:39:15,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:39:15,157 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:15,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 2077012733, now seen corresponding path program 1 times [2024-10-10 22:39:15,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:15,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331174924] [2024-10-10 22:39:15,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:15,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:15,558 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-10 22:39:15,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:15,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331174924] [2024-10-10 22:39:15,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331174924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:15,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:15,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:39:15,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996750978] [2024-10-10 22:39:15,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:15,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 22:39:15,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:15,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 22:39:15,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:39:15,560 INFO L87 Difference]: Start difference. First operand 37069 states and 46705 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 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-10-10 22:39:16,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:16,896 INFO L93 Difference]: Finished difference Result 121302 states and 152831 transitions. [2024-10-10 22:39:16,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 22:39:16,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 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 241 [2024-10-10 22:39:16,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:17,044 INFO L225 Difference]: With dead ends: 121302 [2024-10-10 22:39:17,045 INFO L226 Difference]: Without dead ends: 84640 [2024-10-10 22:39:17,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 22:39:17,096 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 558 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:17,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 570 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 22:39:17,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84640 states. [2024-10-10 22:39:18,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84640 to 84612. [2024-10-10 22:39:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84612 states, 84611 states have (on average 1.2258571580527355) internal successors, (103721), 84611 states have internal predecessors, (103721), 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-10-10 22:39:18,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84612 states to 84612 states and 103721 transitions. [2024-10-10 22:39:18,835 INFO L78 Accepts]: Start accepts. Automaton has 84612 states and 103721 transitions. Word has length 241 [2024-10-10 22:39:18,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:18,835 INFO L471 AbstractCegarLoop]: Abstraction has 84612 states and 103721 transitions. [2024-10-10 22:39:18,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 3 states have internal predecessors, (236), 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-10-10 22:39:18,835 INFO L276 IsEmpty]: Start isEmpty. Operand 84612 states and 103721 transitions. [2024-10-10 22:39:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-10-10 22:39:18,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:18,849 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:39:18,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 22:39:18,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:18,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2032688464, now seen corresponding path program 1 times [2024-10-10 22:39:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:18,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494329712] [2024-10-10 22:39:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:18,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:19,323 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:19,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494329712] [2024-10-10 22:39:19,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494329712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60528220] [2024-10-10 22:39:19,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:19,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:19,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:19,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:19,327 INFO L87 Difference]: Start difference. First operand 84612 states and 103721 transitions. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 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-10-10 22:39:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:20,837 INFO L93 Difference]: Finished difference Result 229892 states and 282741 transitions. [2024-10-10 22:39:20,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:20,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 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 250 [2024-10-10 22:39:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:21,310 INFO L225 Difference]: With dead ends: 229892 [2024-10-10 22:39:21,310 INFO L226 Difference]: Without dead ends: 146093 [2024-10-10 22:39:21,356 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-10-10 22:39:21,357 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 237 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:21,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 145 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:21,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146093 states. [2024-10-10 22:39:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146093 to 146033. [2024-10-10 22:39:23,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146033 states, 146032 states have (on average 1.2229100471129615) internal successors, (178584), 146032 states have internal predecessors, (178584), 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-10-10 22:39:23,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146033 states to 146033 states and 178584 transitions. [2024-10-10 22:39:23,888 INFO L78 Accepts]: Start accepts. Automaton has 146033 states and 178584 transitions. Word has length 250 [2024-10-10 22:39:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:23,888 INFO L471 AbstractCegarLoop]: Abstraction has 146033 states and 178584 transitions. [2024-10-10 22:39:23,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 2 states have internal predecessors, (250), 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-10-10 22:39:23,888 INFO L276 IsEmpty]: Start isEmpty. Operand 146033 states and 178584 transitions. [2024-10-10 22:39:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 22:39:23,907 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:23,907 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:39:23,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:39:23,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:23,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -496776377, now seen corresponding path program 1 times [2024-10-10 22:39:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:23,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020516324] [2024-10-10 22:39:23,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:23,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:24,142 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:39:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020516324] [2024-10-10 22:39:24,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020516324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:24,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:24,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:24,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18238129] [2024-10-10 22:39:24,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:24,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:24,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:24,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:24,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:24,146 INFO L87 Difference]: Start difference. First operand 146033 states and 178584 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:26,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:26,571 INFO L93 Difference]: Finished difference Result 399901 states and 488594 transitions. [2024-10-10 22:39:26,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:26,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 254 [2024-10-10 22:39:26,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:26,971 INFO L225 Difference]: With dead ends: 399901 [2024-10-10 22:39:26,971 INFO L226 Difference]: Without dead ends: 254681 [2024-10-10 22:39:27,084 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-10-10 22:39:27,084 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 222 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:27,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 144 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-10 22:39:27,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254681 states. [2024-10-10 22:39:30,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254681 to 240638. [2024-10-10 22:39:30,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240638 states, 240637 states have (on average 1.2161097420596167) internal successors, (292641), 240637 states have internal predecessors, (292641), 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-10-10 22:39:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240638 states to 240638 states and 292641 transitions. [2024-10-10 22:39:31,666 INFO L78 Accepts]: Start accepts. Automaton has 240638 states and 292641 transitions. Word has length 254 [2024-10-10 22:39:31,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:31,666 INFO L471 AbstractCegarLoop]: Abstraction has 240638 states and 292641 transitions. [2024-10-10 22:39:31,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:39:31,667 INFO L276 IsEmpty]: Start isEmpty. Operand 240638 states and 292641 transitions. [2024-10-10 22:39:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-10-10 22:39:31,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:31,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:39:31,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:39:31,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:31,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash -645477354, now seen corresponding path program 1 times [2024-10-10 22:39:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680145600] [2024-10-10 22:39:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:31,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:39:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680145600] [2024-10-10 22:39:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680145600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:32,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349899071] [2024-10-10 22:39:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:32,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:32,035 INFO L87 Difference]: Start difference. First operand 240638 states and 292641 transitions. Second operand has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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-10-10 22:39:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:34,368 INFO L93 Difference]: Finished difference Result 485136 states and 589455 transitions. [2024-10-10 22:39:34,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:34,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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 260 [2024-10-10 22:39:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:35,406 INFO L225 Difference]: With dead ends: 485136 [2024-10-10 22:39:35,406 INFO L226 Difference]: Without dead ends: 245514 [2024-10-10 22:39:35,517 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-10-10 22:39:35,518 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 182 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:35,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 189 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:39:35,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245514 states. [2024-10-10 22:39:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245514 to 245510. [2024-10-10 22:39:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245510 states, 245509 states have (on average 1.2135155941330054) internal successors, (297929), 245509 states have internal predecessors, (297929), 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-10-10 22:39:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245510 states to 245510 states and 297929 transitions. [2024-10-10 22:39:39,472 INFO L78 Accepts]: Start accepts. Automaton has 245510 states and 297929 transitions. Word has length 260 [2024-10-10 22:39:39,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:39,472 INFO L471 AbstractCegarLoop]: Abstraction has 245510 states and 297929 transitions. [2024-10-10 22:39:39,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.0) internal successors, (231), 2 states have internal predecessors, (231), 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-10-10 22:39:39,472 INFO L276 IsEmpty]: Start isEmpty. Operand 245510 states and 297929 transitions. [2024-10-10 22:39:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-10-10 22:39:39,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:39,576 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-10-10 22:39:39,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 22:39:39,577 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:39,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1787288874, now seen corresponding path program 1 times [2024-10-10 22:39:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:39,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508794564] [2024-10-10 22:39:39,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:39,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-10 22:39:40,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:40,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508794564] [2024-10-10 22:39:40,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508794564] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:39:40,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288547150] [2024-10-10 22:39:40,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:40,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:39:40,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:39:40,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:39:40,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:39:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:40,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:39:40,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:39:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-10-10 22:39:40,645 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:39:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288547150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:40,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:39:40,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:39:40,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134832649] [2024-10-10 22:39:40,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:40,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:40,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:40,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:40,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:39:40,648 INFO L87 Difference]: Start difference. First operand 245510 states and 297929 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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-10-10 22:39:43,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:43,163 INFO L93 Difference]: Finished difference Result 592704 states and 726740 transitions. [2024-10-10 22:39:43,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:43,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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 261 [2024-10-10 22:39:43,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:43,698 INFO L225 Difference]: With dead ends: 592704 [2024-10-10 22:39:43,698 INFO L226 Difference]: Without dead ends: 348616 [2024-10-10 22:39:44,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:39:44,523 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 71 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:44,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 133 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:44,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348616 states. [2024-10-10 22:39:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348616 to 287531. [2024-10-10 22:39:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287531 states, 287530 states have (on average 1.2118804994261467) internal successors, (348452), 287530 states have internal predecessors, (348452), 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-10-10 22:39:49,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287531 states to 287531 states and 348452 transitions. [2024-10-10 22:39:49,948 INFO L78 Accepts]: Start accepts. Automaton has 287531 states and 348452 transitions. Word has length 261 [2024-10-10 22:39:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:39:49,948 INFO L471 AbstractCegarLoop]: Abstraction has 287531 states and 348452 transitions. [2024-10-10 22:39:49,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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-10-10 22:39:49,949 INFO L276 IsEmpty]: Start isEmpty. Operand 287531 states and 348452 transitions. [2024-10-10 22:39:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2024-10-10 22:39:49,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:39:49,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 22:39:49,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 22:39:50,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 22:39:50,177 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:39:50,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:39:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1471438516, now seen corresponding path program 1 times [2024-10-10 22:39:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:39:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177645304] [2024-10-10 22:39:50,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:39:50,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:39:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:39:50,378 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:39:50,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:39:50,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177645304] [2024-10-10 22:39:50,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177645304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:39:50,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:39:50,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:39:50,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555149040] [2024-10-10 22:39:50,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:39:50,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:39:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:39:50,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:39:50,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:39:50,380 INFO L87 Difference]: Start difference. First operand 287531 states and 348452 transitions. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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-10-10 22:39:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:39:54,277 INFO L93 Difference]: Finished difference Result 771856 states and 935932 transitions. [2024-10-10 22:39:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:39:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 2 states have internal predecessors, (274), 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 274 [2024-10-10 22:39:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:39:55,203 INFO L225 Difference]: With dead ends: 771856 [2024-10-10 22:39:55,204 INFO L226 Difference]: Without dead ends: 485544 [2024-10-10 22:39:55,351 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-10-10 22:39:55,352 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 176 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 22:39:55,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 221 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 22:39:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485544 states.